{"id":"https://openalex.org/W1488844540","doi":"https://doi.org/10.7916/d83776pg","title":"Large Scale Nearest Neighbor Search - Theories, Algorithms, and Applications","display_name":"Large Scale Nearest Neighbor Search - Theories, Algorithms, and Applications","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1488844540","doi":"https://doi.org/10.7916/d83776pg","mag":"1488844540"},"language":"en","primary_location":{"id":"pmh:oai:academiccommons.columbia.edu:10.7916/D83776PG","is_oa":false,"landing_page_url":"https://doi.org/10.7916/D83776PG","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Theses"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.7916/d83776pg","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"He, Junfeng","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"He, Junfeng","raw_affiliation_strings":["Columbia University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9699000120162964,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9569000005722046,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.8184109330177307},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6382975578308105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6311841011047363},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.5917142629623413},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5685297250747681},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5681647658348083},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5623586177825928},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.5187554359436035},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5119386911392212},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.501239538192749},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.45601513981819153},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4539189338684082},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4374104142189026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3985568881034851},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.34189358353614807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2915082573890686},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26099860668182373},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.2332494556903839},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.221112459897995},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.20257872343063354}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.8184109330177307},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6382975578308105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6311841011047363},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.5917142629623413},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5685297250747681},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5681647658348083},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5623586177825928},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.5187554359436035},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5119386911392212},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.501239538192749},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.45601513981819153},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4539189338684082},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4374104142189026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3985568881034851},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.34189358353614807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2915082573890686},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26099860668182373},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.2332494556903839},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.221112459897995},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.20257872343063354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:academiccommons.columbia.edu:10.7916/D83776PG","is_oa":false,"landing_page_url":"https://doi.org/10.7916/D83776PG","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Theses"},{"id":"mag:1488844540","is_oa":false,"landing_page_url":"https://academiccommons.columbia.edu/download/fedora_content/download/ac:168491/CONTENT/He_columbia_0054D_11723.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"doi:10.7916/d83776pg","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d83776pg","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.7916/d83776pg","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d83776pg","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":82,"referenced_works":["https://openalex.org/W205159212","https://openalex.org/W1496508106","https://openalex.org/W1502916507","https://openalex.org/W1518628253","https://openalex.org/W1546243588","https://openalex.org/W1566135517","https://openalex.org/W1570052007","https://openalex.org/W1627400044","https://openalex.org/W1660390307","https://openalex.org/W1677409904","https://openalex.org/W1824657313","https://openalex.org/W1888425992","https://openalex.org/W1969370863","https://openalex.org/W1971927246","https://openalex.org/W1979627555","https://openalex.org/W1979848457","https://openalex.org/W1982193706","https://openalex.org/W1988281247","https://openalex.org/W1992371516","https://openalex.org/W2012833704","https://openalex.org/W2024668293","https://openalex.org/W2036718463","https://openalex.org/W2037140704","https://openalex.org/W2037954058","https://openalex.org/W2049644877","https://openalex.org/W2059139185","https://openalex.org/W2061441693","https://openalex.org/W2063218608","https://openalex.org/W2067869060","https://openalex.org/W2071572981","https://openalex.org/W2076145548","https://openalex.org/W2078530810","https://openalex.org/W2084363474","https://openalex.org/W2097921974","https://openalex.org/W2107410045","https://openalex.org/W2111110737","https://openalex.org/W2112545207","https://openalex.org/W2112979232","https://openalex.org/W2118123209","https://openalex.org/W2121348293","https://openalex.org/W2121713321","https://openalex.org/W2123649031","https://openalex.org/W2124351162","https://openalex.org/W2124509324","https://openalex.org/W2125378448","https://openalex.org/W2128017662","https://openalex.org/W2131846894","https://openalex.org/W2133296809","https://openalex.org/W2135342401","https://openalex.org/W2141224535","https://openalex.org/W2142040641","https://openalex.org/W2144902422","https://openalex.org/W2147717514","https://openalex.org/W2149664435","https://openalex.org/W2150782236","https://openalex.org/W2151103935","https://openalex.org/W2151393298","https://openalex.org/W2154610494","https://openalex.org/W2154956324","https://openalex.org/W2155982529","https://openalex.org/W2156854610","https://openalex.org/W2157941578","https://openalex.org/W2158705726","https://openalex.org/W2162006472","https://openalex.org/W2162881463","https://openalex.org/W2162915993","https://openalex.org/W2164338181","https://openalex.org/W2164996087","https://openalex.org/W2165533158","https://openalex.org/W2165558283","https://openalex.org/W2166563371","https://openalex.org/W2167057485","https://openalex.org/W2168532736","https://openalex.org/W2170605888","https://openalex.org/W2170641980","https://openalex.org/W2171790913","https://openalex.org/W2221852422","https://openalex.org/W2225766585","https://openalex.org/W2293597654","https://openalex.org/W2408177717","https://openalex.org/W2501499209","https://openalex.org/W2913932916"],"related_works":["https://openalex.org/W2745964751","https://openalex.org/W2741620810","https://openalex.org/W3037345255","https://openalex.org/W3173498609","https://openalex.org/W3109426791","https://openalex.org/W642889137","https://openalex.org/W2739530197","https://openalex.org/W2802112837","https://openalex.org/W375236608","https://openalex.org/W2222804367","https://openalex.org/W3173889778","https://openalex.org/W3006235478","https://openalex.org/W2187860343","https://openalex.org/W3130888042","https://openalex.org/W2153315886","https://openalex.org/W3130280039","https://openalex.org/W2335476660","https://openalex.org/W24166384","https://openalex.org/W2588320074","https://openalex.org/W2031043614"],"abstract_inverted_index":{"We":[0,421,695],"are":[1,222,325,503],"witnessing":[2],"a":[3,194,379,435,449,506,567,644],"data":[4,10,30,42,72,96,246,262,276,401,430,440,498,646,653,679,741],"explosion":[5],"era,":[6],"in":[7,121,329,710],"which":[8,127,324,442],"huge":[9,95],"sets":[11],"of":[12,51,123,161,225,243,309,438,489,509,639,649,668,700],"billions":[13],"or":[14,365],"more":[15,366],"samples":[16],"represented":[17],"by":[18,168,205,677],"high-dimensional":[19],"feature":[20,208],"vectors":[21],"can":[22,90,153,202,254,371,458,715],"be":[23,119,203,255,372,459,675,716,726],"easily":[24],"found":[25],"on":[26,146,398,483,495,643,697],"the":[27,78,99,114,124,147,207,241,245,251,299,313,317,326,330,333,345,352,358,363,368,429,496,538,545,562,585,637,656,662,678,698],"Web,":[28],"enterprise":[29],"centers,":[31],"surveillance":[32],"sensor":[33],"systems,":[34],"and":[35,60,71,80,150,213,288,336,391,409,433,457,486,491,516,527,578,595,597,658,665,724,743],"so":[36],"on.":[37],"On":[38],"these":[39],"large":[40,106,169,340,399,466,614,669,701,737],"scale":[41,92,107,170,341,400,467,615,670,738],"sets,":[43,402],"nearest":[44,85,108,158,163,171,178,304,342,395,424,469,575,601,616,627,640,671,688],"neighbor":[45,86,109,159,172,179,305,343,396,425,470,576,602,617,628,641,672,689],"search":[46,76,110,116,137,148,180,185,201,306,360,370,397,426,445,451,471,603,629,631,642,650,673,690,703,733],"is":[47,77,131,249,362,455,636],"fundamental":[48,624],"for":[49,84,197,228,393,403,505,547,613,626,633,692],"lots":[50],"applications":[52,392,730],"including":[53],"content":[54],"based":[55,231,234,237,285,291,413,494],"search/retrieval,":[56],"recommendation,":[57],"clustering,":[58,596],"graph":[59],"social":[61,744],"network":[62,745],"research,":[63],"as":[64,66,101,267,281,373,375,593,736],"well":[65],"many":[67,528],"other":[68,166,529,719,729],"machine":[69,739],"learning":[70,412],"mining":[73],"problems.":[74],"Exhaustive":[75],"simplest":[79],"most":[81,463],"straightforward":[82],"way":[83],"search,":[87,173,344],"but":[88],"it":[89],"not":[91],"up":[93],"to":[94,118,134,142,210,217,350,461,540,543,565,588,610,718,728],"set":[97,647,680],"at":[98,176,607],"sizes":[100],"mentioned":[102],"above.":[103],"To":[104,190],"make":[105,143],"practical,":[111],"we":[112,139,152,174,385,479,535,582,620,684],"need":[113,141],"online":[115,184,302,359,369],"step":[117],"sublinear":[120,136,183],"terms":[122],"database":[125,327],"size,":[126],"means":[128],"offline":[129,188,300,354],"indexing":[130,193,286,405,410,475,548,555,707],"necessary.":[132],"Moreover,":[133,534],"achieve":[135],"time,":[138],"usually":[140,307],"some":[144,191,289],"sacrifice":[145],"accuracy,":[149],"hence":[151],"often":[154],"only":[155],"obtain":[156,322],"approximate":[157,177,200,303,468],"instead":[160],"exact":[162],"neighbor.":[164],"In":[165,382],"words,":[167],"aim":[175],"methods":[181,253,292,427,510,549,691,708],"with":[182,406,411,476,550,556,571,721],"time":[186,490],"via":[187],"indexing.":[189],"extent,":[192],"vector":[195],"dataset":[196],"(sublinear":[198],"time)":[199],"achieved":[204,598],"partitioning":[206],"space":[209,492],"different":[211,223,589],"regions,":[212],"mapping":[214],"each":[215],"point":[216,319],"its":[218],"closet":[219],"regions.":[220],"There":[221],"kinds":[224],"partition":[226,247,252,265,408,431,499,590],"structures,":[227],"example,":[229,634],"tree":[230,290],"partition,":[232,235,238,279,441],"hashing":[233,531,594],"clustering/quantization":[236],"etc.":[239,297,533,747],"From":[240],"viewpoint":[242],"how":[244,349,542],"function":[248],"generated,":[250],"grouped":[256],"into":[257,428],"two":[258,572],"main":[259,417],"categories:":[260],"1.":[261,420],"independent":[263],"(random)":[264],"such":[266,280,356,592,735],"locality":[268,522],"sensitive":[269,523],"hashing,":[270,283,524],"randomized":[271],"trees/forests":[272],"methods,":[273,287,532,604,632],"etc.;":[274],"2.":[275,473],"dependent":[277],"(optimized)":[278],"compact":[282],"quantization":[284],"like":[293],"kd-tree,":[294],"pca":[295],"tree,":[296],"With":[298],"indexing/partitioning,":[301],"consists":[308],"three":[310],"steps:":[311],"locate":[312],"query":[314,318,334],"region":[315,579],"that":[316,357],"falls":[320],"in,":[321],"candidates":[323],"points":[328],"regions":[331],"near":[332],"region,":[335],"rerank/return":[337],"candidates.":[338],"For":[339,474,554],"key":[346],"question":[347],"is:":[348],"design":[351,667],"optimal":[353,439,497],"indexing,":[355],"performance":[361],"best,":[364],"specifically,":[367],"fast":[374],"possible,":[376],"while":[377,447],"meeting":[378],"required":[380,450],"accuracy?":[381],"this":[383,711],"thesis,":[384],"have":[386,480,560,583,621,685],"studied":[387,623],"theories,":[388],"algorithms,":[389],"systems":[390],"(approximate)":[394],"both":[404],"random":[407,525,530,551],"partition.":[414],"Our":[415],"specific":[416],"contributions":[418],"are:":[419],"unify":[422],"various":[423],"framework,":[432],"provide":[434],"general":[436,507],"formulation":[437,454,564],"supports":[443],"fastest":[444],"speed":[446],"satisfying":[448],"accuracy.":[452],"The":[453,501,713],"general,":[456],"used":[460],"explain":[462],"existing":[464],"(sublinear)":[465],"methods.":[472],"data-independent":[477],"partitions,":[478,558],"developed":[481,709],"theories":[482],"their":[484],"lower":[485],"upper":[487],"bounds":[488,502],"complexity,":[493],"formulation.":[500],"applicable":[504],"group":[508],"called":[511],"Nearest":[512,517],"Neighbor":[513,518],"Preferred":[514,519],"Hashing":[515],"Partition,":[520],"including,":[521],"forest,":[526],"also":[536],"extend":[537],"theory":[539],"study":[541],"choose":[544],"parameters":[546],"partitions.":[552],"3.":[553],"data-dependent":[557],"I":[559],"applied":[561,584,686,717],"same":[563],"develop":[566],"joint":[568,586],"optimization":[569,587],"approach":[570],"important":[573],"criteria:":[574],"preserving":[577],"size":[580],"balancing.":[581],"structures":[591],"several":[599],"new":[600,706],"outperforming":[605],"(or":[606],"least":[608],"comparable)":[609],"state-of-the-art":[611],"solutions":[612],"search.":[618],"4.":[619],"further":[622],"problems":[625],"beyond":[630,731],"what":[635],"difficulty":[638,657],"given":[645],"(independent":[648],"methods)?":[651],"What":[652],"properties":[654],"affect":[655],"how?":[659],"How":[660],"will":[661],"theoretical":[663],"analysis":[664],"algorithm":[666],"problem":[674],"affected":[676],"difficulty?":[681],"5.":[682],"Finally,":[683],"our":[687],"practical":[693],"applications.":[694],"focus":[696],"development":[699],"visual":[702,732],"engines":[704],"using":[705],"thesis.":[712],"techniques":[714],"domains":[720],"data-intensive":[722],"applications,":[723],"moreover,":[725],"extended":[727],"engine,":[734],"learning,":[740],"mining,":[742],"analysis,":[746]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}