{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HVFG6GRTLS5NITKGGFDPZ6HF3F","short_pith_number":"pith:HVFG6GRT","canonical_record":{"source":{"id":"2207.14601","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-07-29T10:46:55Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a6d044b27f1939b7b5c1177e1bf64e4441a7340d65bcc7792180cb6922ee5f1a","abstract_canon_sha256":"67fdc0cfa2cefccc3a1f2bb698495644bb2d974bce575219ad2fb345b02dd4ca"},"schema_version":"1.0"},"canonical_sha256":"3d4a6f1a335cbad44d463146fcf8e5d965f2fcfcfd56a7b3dc65bca31e50bfd1","source":{"kind":"arxiv","id":"2207.14601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.14601","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"2207.14601v1","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.14601","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"HVFG6GRTLS5N","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"pith_short_16","alias_value":"HVFG6GRTLS5NITKG","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"pith_short_8","alias_value":"HVFG6GRT","created_at":"2026-07-05T04:44:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HVFG6GRTLS5NITKGGFDPZ6HF3F","target":"record","payload":{"canonical_record":{"source":{"id":"2207.14601","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-07-29T10:46:55Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a6d044b27f1939b7b5c1177e1bf64e4441a7340d65bcc7792180cb6922ee5f1a","abstract_canon_sha256":"67fdc0cfa2cefccc3a1f2bb698495644bb2d974bce575219ad2fb345b02dd4ca"},"schema_version":"1.0"},"canonical_sha256":"3d4a6f1a335cbad44d463146fcf8e5d965f2fcfcfd56a7b3dc65bca31e50bfd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:35.973431Z","signature_b64":"ZF9v7RAFgyUWeC/8zSNOJPNrwPLbIqcokpkyJ+Nzpl4bV1FdtkqvL6VkfiJftN47T0FcAJ5JBMAOPMNf/CulAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d4a6f1a335cbad44d463146fcf8e5d965f2fcfcfd56a7b3dc65bca31e50bfd1","last_reissued_at":"2026-07-05T04:44:35.973016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:35.973016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.14601","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-05T04:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbWJ4lnLCVvl2W+wGEWgDICXvteOgHq7LtXBVUrqoFwb+bxtcykpJhTeCPspUX9UyknhlCZvuKgmINNrkv1/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:50:37.627357Z"},"content_sha256":"57c78adf25ef47973af17ca1ea8c0d19688b4cec04c443c9219a174f332d05dc","schema_version":"1.0","event_id":"sha256:57c78adf25ef47973af17ca1ea8c0d19688b4cec04c443c9219a174f332d05dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HVFG6GRTLS5NITKGGFDPZ6HF3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Archaeology of random recursive dags and Cooper-Frieze random networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"math.PR","authors_text":"Francisco Calvillo, G\\'abor Lugosi, Simon Briend","submitted_at":"2022-07-29T10:46:55Z","abstract_excerpt":"We study the problem of finding the root vertex in large growing networks. We prove that it is possible to construct confidence sets of size independent of the number of vertices in the network that contain the root vertex with high probability in various models of random networks. The models include uniform random recursive dags and uniform Cooper-Frieze random graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.14601","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/2207.14601/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-05T04:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/HuqtGzbzCHXds0iIWEUS/3DZw+Xj/OFUrqRt+gHTADrc5x+AvP/NqLqChDN1Inz4gJ8nNMluy3Y7n6Z9FlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:50:37.627996Z"},"content_sha256":"ba8ab2aa5f7ddd15619e71961f68b423445d95774c27d9ea7a5c806b573baabf","schema_version":"1.0","event_id":"sha256:ba8ab2aa5f7ddd15619e71961f68b423445d95774c27d9ea7a5c806b573baabf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVFG6GRTLS5NITKGGFDPZ6HF3F/bundle.json","state_url":"https://pith.science/pith/HVFG6GRTLS5NITKGGFDPZ6HF3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVFG6GRTLS5NITKGGFDPZ6HF3F/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-09T06:50:37Z","links":{"resolver":"https://pith.science/pith/HVFG6GRTLS5NITKGGFDPZ6HF3F","bundle":"https://pith.science/pith/HVFG6GRTLS5NITKGGFDPZ6HF3F/bundle.json","state":"https://pith.science/pith/HVFG6GRTLS5NITKGGFDPZ6HF3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVFG6GRTLS5NITKGGFDPZ6HF3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HVFG6GRTLS5NITKGGFDPZ6HF3F","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":"67fdc0cfa2cefccc3a1f2bb698495644bb2d974bce575219ad2fb345b02dd4ca","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-07-29T10:46:55Z","title_canon_sha256":"a6d044b27f1939b7b5c1177e1bf64e4441a7340d65bcc7792180cb6922ee5f1a"},"schema_version":"1.0","source":{"id":"2207.14601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.14601","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"2207.14601v1","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.14601","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"HVFG6GRTLS5N","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"pith_short_16","alias_value":"HVFG6GRTLS5NITKG","created_at":"2026-07-05T04:44:35Z"},{"alias_kind":"pith_short_8","alias_value":"HVFG6GRT","created_at":"2026-07-05T04:44:35Z"}],"graph_snapshots":[{"event_id":"sha256:ba8ab2aa5f7ddd15619e71961f68b423445d95774c27d9ea7a5c806b573baabf","target":"graph","created_at":"2026-07-05T04:44:35Z","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/2207.14601/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of finding the root vertex in large growing networks. We prove that it is possible to construct confidence sets of size independent of the number of vertices in the network that contain the root vertex with high probability in various models of random networks. The models include uniform random recursive dags and uniform Cooper-Frieze random graphs.","authors_text":"Francisco Calvillo, G\\'abor Lugosi, Simon Briend","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-07-29T10:46:55Z","title":"Archaeology of random recursive dags and Cooper-Frieze random networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.14601","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:57c78adf25ef47973af17ca1ea8c0d19688b4cec04c443c9219a174f332d05dc","target":"record","created_at":"2026-07-05T04:44:35Z","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":"67fdc0cfa2cefccc3a1f2bb698495644bb2d974bce575219ad2fb345b02dd4ca","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-07-29T10:46:55Z","title_canon_sha256":"a6d044b27f1939b7b5c1177e1bf64e4441a7340d65bcc7792180cb6922ee5f1a"},"schema_version":"1.0","source":{"id":"2207.14601","kind":"arxiv","version":1}},"canonical_sha256":"3d4a6f1a335cbad44d463146fcf8e5d965f2fcfcfd56a7b3dc65bca31e50bfd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d4a6f1a335cbad44d463146fcf8e5d965f2fcfcfd56a7b3dc65bca31e50bfd1","first_computed_at":"2026-07-05T04:44:35.973016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:44:35.973016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZF9v7RAFgyUWeC/8zSNOJPNrwPLbIqcokpkyJ+Nzpl4bV1FdtkqvL6VkfiJftN47T0FcAJ5JBMAOPMNf/CulAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:44:35.973431Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.14601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57c78adf25ef47973af17ca1ea8c0d19688b4cec04c443c9219a174f332d05dc","sha256:ba8ab2aa5f7ddd15619e71961f68b423445d95774c27d9ea7a5c806b573baabf"],"state_sha256":"315b22a29d52ee20a3d9b995507f7eda087af6a3834d9ca89ad7e16649620b8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I85uNfSQEqVcpvTHlYuJj4BTPhbNwzkDMonu48hlf/4AZ8CmLt+airyDBbptMQwbDOfo9LVd60fNNcTt87pmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:50:37.631510Z","bundle_sha256":"025012a18b764d298e0ff65fc50f1f56c27f59c2fe8dc993b6cd12dbf00c7d02"}}