{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PDVQHC6A7L7HC5FKNNQBGCUMBR","short_pith_number":"pith:PDVQHC6A","canonical_record":{"source":{"id":"1411.3317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T20:50:31Z","cross_cats_sorted":["cs.DM","cs.SI","math.ST","stat.TH"],"title_canon_sha256":"a3c3a4bad3392c1273669b227bd1ae29d78effa96997fc812875ec09cca04cde","abstract_canon_sha256":"53843977548cde437fde70a0a573e2195f927e2344ad6eef8c38ce89529a1e42"},"schema_version":"1.0"},"canonical_sha256":"78eb038bc0fafe7174aa6b60130a8c0c671b31d8fd5ec4abc37b7df07ff1bc64","source":{"kind":"arxiv","id":"1411.3317","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3317","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3317v2","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3317","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"PDVQHC6A7L7H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDVQHC6A7L7HC5FK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDVQHC6A","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PDVQHC6A7L7HC5FKNNQBGCUMBR","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T20:50:31Z","cross_cats_sorted":["cs.DM","cs.SI","math.ST","stat.TH"],"title_canon_sha256":"a3c3a4bad3392c1273669b227bd1ae29d78effa96997fc812875ec09cca04cde","abstract_canon_sha256":"53843977548cde437fde70a0a573e2195f927e2344ad6eef8c38ce89529a1e42"},"schema_version":"1.0"},"canonical_sha256":"78eb038bc0fafe7174aa6b60130a8c0c671b31d8fd5ec4abc37b7df07ff1bc64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:39.646260Z","signature_b64":"4VtBoCZr+lHgs4Kv7E9QRx07JVcbhpJ3QKeq+F7f2dOKEmMKZMsdu7BbP8bj66/Tha9/UXrhMplf3hMGEq5gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78eb038bc0fafe7174aa6b60130a8c0c671b31d8fd5ec4abc37b7df07ff1bc64","last_reissued_at":"2026-05-18T01:25:39.645589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:39.645589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3317","source_version":2,"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-05-18T01:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMHV10iekNWDa1n/opMKzjcbPZlnOIsA3/Bqb/w20eiBKAB5Nzd9kA/AAAuYnRmKhdnN7ar7w+oqXBcbxupQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:54:46.291505Z"},"content_sha256":"858018133d158843ee0163c004832f49755eb1daf1c3f71059b31c203c2d4a8b","schema_version":"1.0","event_id":"sha256:858018133d158843ee0163c004832f49755eb1daf1c3f71059b31c203c2d4a8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PDVQHC6A7L7HC5FKNNQBGCUMBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Adam in random growing trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"G\\'abor Lugosi, Luc Devroye, S\\'ebastien Bubeck","submitted_at":"2014-11-12T20:50:31Z","abstract_excerpt":"We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of $K$ vertices, such that, with probability at least $1-\\epsilon$, the first vertex is in this set. We show that for any $\\epsilon$, there exist such algorithms with $K$ independent of the size of the input tree. Moreover, we provide almost tight bounds for the best value of $K$ as a function of $\\epsilon$. In the uniform attachment case we show that the optimal $K$ is subpolynomial in $1/\\epsilon$, and that it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3317","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCjbuhc/ubuglWqZd1mkxw+WF2g3z2a3px+kxjx3XV6R8dLUPcI0e/W1tYg+lYztMM3kNWURnP8/VBaM8kfnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:54:46.291922Z"},"content_sha256":"466252739f058fdab04b18f3538dbbbc5b7ec924aab6150a22f03dc87ee7a7fe","schema_version":"1.0","event_id":"sha256:466252739f058fdab04b18f3538dbbbc5b7ec924aab6150a22f03dc87ee7a7fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDVQHC6A7L7HC5FKNNQBGCUMBR/bundle.json","state_url":"https://pith.science/pith/PDVQHC6A7L7HC5FKNNQBGCUMBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDVQHC6A7L7HC5FKNNQBGCUMBR/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-05-23T00:54:46Z","links":{"resolver":"https://pith.science/pith/PDVQHC6A7L7HC5FKNNQBGCUMBR","bundle":"https://pith.science/pith/PDVQHC6A7L7HC5FKNNQBGCUMBR/bundle.json","state":"https://pith.science/pith/PDVQHC6A7L7HC5FKNNQBGCUMBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDVQHC6A7L7HC5FKNNQBGCUMBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PDVQHC6A7L7HC5FKNNQBGCUMBR","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":"53843977548cde437fde70a0a573e2195f927e2344ad6eef8c38ce89529a1e42","cross_cats_sorted":["cs.DM","cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T20:50:31Z","title_canon_sha256":"a3c3a4bad3392c1273669b227bd1ae29d78effa96997fc812875ec09cca04cde"},"schema_version":"1.0","source":{"id":"1411.3317","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3317","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3317v2","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3317","created_at":"2026-05-18T01:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"PDVQHC6A7L7H","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDVQHC6A7L7HC5FK","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDVQHC6A","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:466252739f058fdab04b18f3538dbbbc5b7ec924aab6150a22f03dc87ee7a7fe","target":"graph","created_at":"2026-05-18T01:25:39Z","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"},"paper":{"abstract_excerpt":"We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of $K$ vertices, such that, with probability at least $1-\\epsilon$, the first vertex is in this set. We show that for any $\\epsilon$, there exist such algorithms with $K$ independent of the size of the input tree. Moreover, we provide almost tight bounds for the best value of $K$ as a function of $\\epsilon$. In the uniform attachment case we show that the optimal $K$ is subpolynomial in $1/\\epsilon$, and that it ","authors_text":"G\\'abor Lugosi, Luc Devroye, S\\'ebastien Bubeck","cross_cats":["cs.DM","cs.SI","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T20:50:31Z","title":"Finding Adam in random growing trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3317","kind":"arxiv","version":2},"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:858018133d158843ee0163c004832f49755eb1daf1c3f71059b31c203c2d4a8b","target":"record","created_at":"2026-05-18T01:25:39Z","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":"53843977548cde437fde70a0a573e2195f927e2344ad6eef8c38ce89529a1e42","cross_cats_sorted":["cs.DM","cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-12T20:50:31Z","title_canon_sha256":"a3c3a4bad3392c1273669b227bd1ae29d78effa96997fc812875ec09cca04cde"},"schema_version":"1.0","source":{"id":"1411.3317","kind":"arxiv","version":2}},"canonical_sha256":"78eb038bc0fafe7174aa6b60130a8c0c671b31d8fd5ec4abc37b7df07ff1bc64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78eb038bc0fafe7174aa6b60130a8c0c671b31d8fd5ec4abc37b7df07ff1bc64","first_computed_at":"2026-05-18T01:25:39.645589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:39.645589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4VtBoCZr+lHgs4Kv7E9QRx07JVcbhpJ3QKeq+F7f2dOKEmMKZMsdu7BbP8bj66/Tha9/UXrhMplf3hMGEq5gDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:39.646260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3317","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:858018133d158843ee0163c004832f49755eb1daf1c3f71059b31c203c2d4a8b","sha256:466252739f058fdab04b18f3538dbbbc5b7ec924aab6150a22f03dc87ee7a7fe"],"state_sha256":"1c4f7d030c12eedc940e1037a020442a2f5517b5e78086d70efc24c6c6176f7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4juhiid733agqDKYz+f7t2vM9vYcwYCM/0R3MjxhOeqhcyumsmxjiqKATcsdNhiuCR+O4cL80QZ/+4y+TvbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T00:54:46.294268Z","bundle_sha256":"599731d6e7f9a0d953609d96918a4cb8d44f05297ecf16ff7edbdf419fad0a7d"}}