{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GYRHWEAFCYARYN2ALAS4G6AXTA","short_pith_number":"pith:GYRHWEAF","schema_version":"1.0","canonical_sha256":"36227b100516011c37405825c37817980bd96f052b4374ea6817f52cbb9fbff3","source":{"kind":"arxiv","id":"2411.14336","version":1},"attestation_state":"computed","paper":{"title":"Finding the root in random nearest neighbor trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"math.PR","authors_text":"Anna Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan","submitted_at":"2024-11-21T17:30:49Z","abstract_excerpt":"We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \\in \\mathbb{N}$, generated by sequentially embedding vertices uniformly at random in the $d$-dimensional torus and connecting each new vertex to the nearest existing vertex. More precisely, given an error parameter $\\varepsilon > 0$ and the unlabeled tree, we want to efficiently find a small set of candidate vertices, such that the root is included in this set with probability at least $1 - \\varepsilon$. We call such a candida"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.14336","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-11-21T17:30:49Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"9830835814c3d560455a2dd54f671b9cf413d152b1cd6dd730e066b4616463f3","abstract_canon_sha256":"c2b8413f0fb7a9738c5247522b73afd2de7be239d10ae1643499096bcbc70acd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:45.299940Z","signature_b64":"dZW7ZhvcjurY7FB5w560gZhHU1u46xk1WzVCu7gafXw9deT3v07NUdk2BEvfs+lcI+rZ+iJepjb1vU/bHEgaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36227b100516011c37405825c37817980bd96f052b4374ea6817f52cbb9fbff3","last_reissued_at":"2026-07-05T09:38:45.299386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:45.299386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding the root in random nearest neighbor trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"math.PR","authors_text":"Anna Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan","submitted_at":"2024-11-21T17:30:49Z","abstract_excerpt":"We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \\in \\mathbb{N}$, generated by sequentially embedding vertices uniformly at random in the $d$-dimensional torus and connecting each new vertex to the nearest existing vertex. More precisely, given an error parameter $\\varepsilon > 0$ and the unlabeled tree, we want to efficiently find a small set of candidate vertices, such that the root is included in this set with probability at least $1 - \\varepsilon$. We call such a candida"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14336","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14336/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.14336","created_at":"2026-07-05T09:38:45.299454+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14336v1","created_at":"2026-07-05T09:38:45.299454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14336","created_at":"2026-07-05T09:38:45.299454+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYRHWEAFCYAR","created_at":"2026-07-05T09:38:45.299454+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYRHWEAFCYARYN2A","created_at":"2026-07-05T09:38:45.299454+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYRHWEAF","created_at":"2026-07-05T09:38:45.299454+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA","json":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA.json","graph_json":"https://pith.science/api/pith-number/GYRHWEAFCYARYN2ALAS4G6AXTA/graph.json","events_json":"https://pith.science/api/pith-number/GYRHWEAFCYARYN2ALAS4G6AXTA/events.json","paper":"https://pith.science/paper/GYRHWEAF"},"agent_actions":{"view_html":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA","download_json":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA.json","view_paper":"https://pith.science/paper/GYRHWEAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14336&json=true","fetch_graph":"https://pith.science/api/pith-number/GYRHWEAFCYARYN2ALAS4G6AXTA/graph.json","fetch_events":"https://pith.science/api/pith-number/GYRHWEAFCYARYN2ALAS4G6AXTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/action/storage_attestation","attest_author":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/action/author_attestation","sign_citation":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/action/citation_signature","submit_replication":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/action/replication_record"}},"created_at":"2026-07-05T09:38:45.299454+00:00","updated_at":"2026-07-05T09:38:45.299454+00:00"}