{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GYRHWEAFCYARYN2ALAS4G6AXTA","short_pith_number":"pith:GYRHWEAF","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"},"canonical_sha256":"36227b100516011c37405825c37817980bd96f052b4374ea6817f52cbb9fbff3","source":{"kind":"arxiv","id":"2411.14336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14336","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14336v1","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14336","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"GYRHWEAFCYAR","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_16","alias_value":"GYRHWEAFCYARYN2A","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_8","alias_value":"GYRHWEAF","created_at":"2026-07-05T09:38:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GYRHWEAFCYARYN2ALAS4G6AXTA","target":"record","payload":{"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"},"canonical_sha256":"36227b100516011c37405825c37817980bd96f052b4374ea6817f52cbb9fbff3","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"},"source_kind":"arxiv","source_id":"2411.14336","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PEylVsI+TR09NinAE+Hj/HJ4+EF5LQ70PFSwK3w7/HGKzFcGvdw4VcJS5f3Ix8it3pn0sHXBLluE76v5F5jDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:22:12.042092Z"},"content_sha256":"0d8357ec038851dceb6266037b1d29efddc7e31e12f859d45d9f2b0887980d8b","schema_version":"1.0","event_id":"sha256:0d8357ec038851dceb6266037b1d29efddc7e31e12f859d45d9f2b0887980d8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GYRHWEAFCYARYN2ALAS4G6AXTA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kD0DSYHRXy4VMJsQ4roO7uH02xPomBC4mTjBfFSoef+o+YAD5tLJwkmxab8dVIW5vRIIIe+19GwGq67752FVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:22:12.042481Z"},"content_sha256":"3f48ca67470904f6f7acba19e271414f2776b4ab1d39ec130bceacff3687b172","schema_version":"1.0","event_id":"sha256:3f48ca67470904f6f7acba19e271414f2776b4ab1d39ec130bceacff3687b172"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/bundle.json","state_url":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T13:22:12Z","links":{"resolver":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA","bundle":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/bundle.json","state":"https://pith.science/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYRHWEAFCYARYN2ALAS4G6AXTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GYRHWEAFCYARYN2ALAS4G6AXTA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c2b8413f0fb7a9738c5247522b73afd2de7be239d10ae1643499096bcbc70acd","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-11-21T17:30:49Z","title_canon_sha256":"9830835814c3d560455a2dd54f671b9cf413d152b1cd6dd730e066b4616463f3"},"schema_version":"1.0","source":{"id":"2411.14336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14336","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14336v1","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14336","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"GYRHWEAFCYAR","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_16","alias_value":"GYRHWEAFCYARYN2A","created_at":"2026-07-05T09:38:45Z"},{"alias_kind":"pith_short_8","alias_value":"GYRHWEAF","created_at":"2026-07-05T09:38:45Z"}],"graph_snapshots":[{"event_id":"sha256:3f48ca67470904f6f7acba19e271414f2776b4ab1d39ec130bceacff3687b172","target":"graph","created_at":"2026-07-05T09:38:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.14336/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anna Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan","cross_cats":["cs.DS","cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-11-21T17:30:49Z","title":"Finding the root in random nearest neighbor trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14336","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d8357ec038851dceb6266037b1d29efddc7e31e12f859d45d9f2b0887980d8b","target":"record","created_at":"2026-07-05T09:38:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c2b8413f0fb7a9738c5247522b73afd2de7be239d10ae1643499096bcbc70acd","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-11-21T17:30:49Z","title_canon_sha256":"9830835814c3d560455a2dd54f671b9cf413d152b1cd6dd730e066b4616463f3"},"schema_version":"1.0","source":{"id":"2411.14336","kind":"arxiv","version":1}},"canonical_sha256":"36227b100516011c37405825c37817980bd96f052b4374ea6817f52cbb9fbff3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36227b100516011c37405825c37817980bd96f052b4374ea6817f52cbb9fbff3","first_computed_at":"2026-07-05T09:38:45.299386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:45.299386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZW7ZhvcjurY7FB5w560gZhHU1u46xk1WzVCu7gafXw9deT3v07NUdk2BEvfs+lcI+rZ+iJepjb1vU/bHEgaDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:45.299940Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d8357ec038851dceb6266037b1d29efddc7e31e12f859d45d9f2b0887980d8b","sha256:3f48ca67470904f6f7acba19e271414f2776b4ab1d39ec130bceacff3687b172"],"state_sha256":"da267503ab74f7cb9ef4d19a037d9a2dd56fd3f3a13a5b0e1e6824bb153dd04b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FOmvMTzmbonsTI+6Q+VQZSyro5WxYPeGUS3Reb6rL+5IpQorCGuJF4qFvw+3LJ1X7BIonD7bzeltKJopgeYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:22:12.044460Z","bundle_sha256":"815ce79f80ce8117025f5135b2aa2742a6214eb0d01c0e5edd72ea1bf5a05356"}}