{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HKUNPOI7FTWUYCJIFZLMFSHJ3F","short_pith_number":"pith:HKUNPOI7","schema_version":"1.0","canonical_sha256":"3aa8d7b91f2ced4c09282e56c2c8e9d95897c6e480b4fb4d544bc16d6289de44","source":{"kind":"arxiv","id":"1801.01816","version":1},"attestation_state":"computed","paper":{"title":"Finding the seed of uniform attachment trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alan S. Pereira, Gabor Lugosi","submitted_at":"2018-01-05T16:14:27Z","abstract_excerpt":"A uniform attachment tree is a random tree that is generated dynamically. Starting from a fixed \"seed\" tree, vertices are added sequentially by attaching each vertex to an existing vertex chosen uniformly at random. Upon observing a large (unlabeled) tree, one wishes to find the initial seed. We investigate to what extent seed trees can be recovered, at least partially. We consider three types of seeds: a path, a star, and a random uniform attachment tree. We propose and analyze seed-finding algorithms for all three types of seed trees."},"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":"1801.01816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-01-05T16:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"5370e47107454e4efbf5d29e83131da8281bfdf0f36d819e79a3665800cfdd12","abstract_canon_sha256":"587bac936d4c772f2b1b77db4f668afbe435b1b0a2e451677a025b81d54c3eff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:40.904761Z","signature_b64":"FqoXT+/NqJoduO30mVeR09R7KFAe/vLhW280kUKWRoARDwEDw50n06ySyYQh2H8TdHTOTsoMf+JbI0P+UKOZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aa8d7b91f2ced4c09282e56c2c8e9d95897c6e480b4fb4d544bc16d6289de44","last_reissued_at":"2026-05-18T00:26:40.904263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:40.904263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding the seed of uniform attachment trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alan S. Pereira, Gabor Lugosi","submitted_at":"2018-01-05T16:14:27Z","abstract_excerpt":"A uniform attachment tree is a random tree that is generated dynamically. Starting from a fixed \"seed\" tree, vertices are added sequentially by attaching each vertex to an existing vertex chosen uniformly at random. Upon observing a large (unlabeled) tree, one wishes to find the initial seed. We investigate to what extent seed trees can be recovered, at least partially. We consider three types of seeds: a path, a star, and a random uniform attachment tree. We propose and analyze seed-finding algorithms for all three types of seed trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01816","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":""},"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":"1801.01816","created_at":"2026-05-18T00:26:40.904354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01816v1","created_at":"2026-05-18T00:26:40.904354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01816","created_at":"2026-05-18T00:26:40.904354+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKUNPOI7FTWU","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKUNPOI7FTWUYCJI","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKUNPOI7","created_at":"2026-05-18T12:32:28.185984+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/HKUNPOI7FTWUYCJIFZLMFSHJ3F","json":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F.json","graph_json":"https://pith.science/api/pith-number/HKUNPOI7FTWUYCJIFZLMFSHJ3F/graph.json","events_json":"https://pith.science/api/pith-number/HKUNPOI7FTWUYCJIFZLMFSHJ3F/events.json","paper":"https://pith.science/paper/HKUNPOI7"},"agent_actions":{"view_html":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F","download_json":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F.json","view_paper":"https://pith.science/paper/HKUNPOI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01816&json=true","fetch_graph":"https://pith.science/api/pith-number/HKUNPOI7FTWUYCJIFZLMFSHJ3F/graph.json","fetch_events":"https://pith.science/api/pith-number/HKUNPOI7FTWUYCJIFZLMFSHJ3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F/action/storage_attestation","attest_author":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F/action/author_attestation","sign_citation":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F/action/citation_signature","submit_replication":"https://pith.science/pith/HKUNPOI7FTWUYCJIFZLMFSHJ3F/action/replication_record"}},"created_at":"2026-05-18T00:26:40.904354+00:00","updated_at":"2026-05-18T00:26:40.904354+00:00"}