{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AZ624IFRVESZ67IEV3AKZVESIL","short_pith_number":"pith:AZ624IFR","canonical_record":{"source":{"id":"2410.06481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-10-09T02:15:57Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"8a4b9e273e860fe049940a4f985fac2de79af18ab14b11c95f0aab9418c3ac99","abstract_canon_sha256":"83fbc968f5384dac6a185879e225809349214b471fb05d99711e569296842c77"},"schema_version":"1.0"},"canonical_sha256":"067dae20b1a9259f7d04aec0acd49242d4c563678578e0fd0513a2f700d3a156","source":{"kind":"arxiv","id":"2410.06481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06481","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06481v1","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06481","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"AZ624IFRVESZ","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"pith_short_16","alias_value":"AZ624IFRVESZ67IE","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"pith_short_8","alias_value":"AZ624IFR","created_at":"2026-07-05T09:18:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AZ624IFRVESZ67IEV3AKZVESIL","target":"record","payload":{"canonical_record":{"source":{"id":"2410.06481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-10-09T02:15:57Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"8a4b9e273e860fe049940a4f985fac2de79af18ab14b11c95f0aab9418c3ac99","abstract_canon_sha256":"83fbc968f5384dac6a185879e225809349214b471fb05d99711e569296842c77"},"schema_version":"1.0"},"canonical_sha256":"067dae20b1a9259f7d04aec0acd49242d4c563678578e0fd0513a2f700d3a156","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:02.358350Z","signature_b64":"GNF7MqUqnT1wWo5uKhOCOzGyDVWkirQsYWDZJ7352hO9vFQQA2A5pNT6LAAQsQfgu0YghrxjF4uVBSwg37zkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"067dae20b1a9259f7d04aec0acd49242d4c563678578e0fd0513a2f700d3a156","last_reissued_at":"2026-07-05T09:18:02.357986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:02.357986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.06481","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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cH4tLCo2T74LBrzrAgwQp/8UcYSs3kckCrFCuZ71vyi9qJVrKNF/c8mogFcufYusBvxg6FkRTikmRomgzCmWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:00:23.606035Z"},"content_sha256":"1e9aa2ab0ca961ffe59a0b35e41eb75a7535f1d5527b1617c30bb48013de96c7","schema_version":"1.0","event_id":"sha256:1e9aa2ab0ca961ffe59a0b35e41eb75a7535f1d5527b1617c30bb48013de96c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AZ624IFRVESZ67IEV3AKZVESIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leaf Stripping on Uniform Attachment Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.PR","authors_text":"Anna Brandenberger, G\\'abor Lugosi, Louigi Addario-Berry, Nicolas Broutin, Simon Briend","submitted_at":"2024-10-09T02:15:57Z","abstract_excerpt":"In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with probability $1 - \\epsilon$, the set of remaining vertices contains the root and has a size only depending on $\\epsilon$ but not on the size of the tree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06481","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/2410.06481/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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAkRE39HW8lswkJDnmj0Wu/v7YuOzw6HGF903Ss7ZBvtnZQRtrtKs+0XVZCOUeL2keZG8H2PYZM8dQh2KNIBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T23:00:23.606352Z"},"content_sha256":"e93083e517e18859753e9621b32823ee48d258f034e9f8afc7eb61f705e5dbaf","schema_version":"1.0","event_id":"sha256:e93083e517e18859753e9621b32823ee48d258f034e9f8afc7eb61f705e5dbaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZ624IFRVESZ67IEV3AKZVESIL/bundle.json","state_url":"https://pith.science/pith/AZ624IFRVESZ67IEV3AKZVESIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZ624IFRVESZ67IEV3AKZVESIL/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-31T23:00:23Z","links":{"resolver":"https://pith.science/pith/AZ624IFRVESZ67IEV3AKZVESIL","bundle":"https://pith.science/pith/AZ624IFRVESZ67IEV3AKZVESIL/bundle.json","state":"https://pith.science/pith/AZ624IFRVESZ67IEV3AKZVESIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZ624IFRVESZ67IEV3AKZVESIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AZ624IFRVESZ67IEV3AKZVESIL","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":"83fbc968f5384dac6a185879e225809349214b471fb05d99711e569296842c77","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-10-09T02:15:57Z","title_canon_sha256":"8a4b9e273e860fe049940a4f985fac2de79af18ab14b11c95f0aab9418c3ac99"},"schema_version":"1.0","source":{"id":"2410.06481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06481","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06481v1","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06481","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"AZ624IFRVESZ","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"pith_short_16","alias_value":"AZ624IFRVESZ67IE","created_at":"2026-07-05T09:18:02Z"},{"alias_kind":"pith_short_8","alias_value":"AZ624IFR","created_at":"2026-07-05T09:18:02Z"}],"graph_snapshots":[{"event_id":"sha256:e93083e517e18859753e9621b32823ee48d258f034e9f8afc7eb61f705e5dbaf","target":"graph","created_at":"2026-07-05T09:18:02Z","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/2410.06481/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with probability $1 - \\epsilon$, the set of remaining vertices contains the root and has a size only depending on $\\epsilon$ but not on the size of the tree.","authors_text":"Anna Brandenberger, G\\'abor Lugosi, Louigi Addario-Berry, Nicolas Broutin, Simon Briend","cross_cats":["cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-10-09T02:15:57Z","title":"Leaf Stripping on Uniform Attachment Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06481","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:1e9aa2ab0ca961ffe59a0b35e41eb75a7535f1d5527b1617c30bb48013de96c7","target":"record","created_at":"2026-07-05T09:18:02Z","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":"83fbc968f5384dac6a185879e225809349214b471fb05d99711e569296842c77","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-10-09T02:15:57Z","title_canon_sha256":"8a4b9e273e860fe049940a4f985fac2de79af18ab14b11c95f0aab9418c3ac99"},"schema_version":"1.0","source":{"id":"2410.06481","kind":"arxiv","version":1}},"canonical_sha256":"067dae20b1a9259f7d04aec0acd49242d4c563678578e0fd0513a2f700d3a156","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"067dae20b1a9259f7d04aec0acd49242d4c563678578e0fd0513a2f700d3a156","first_computed_at":"2026-07-05T09:18:02.357986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:18:02.357986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GNF7MqUqnT1wWo5uKhOCOzGyDVWkirQsYWDZJ7352hO9vFQQA2A5pNT6LAAQsQfgu0YghrxjF4uVBSwg37zkDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:18:02.358350Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.06481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e9aa2ab0ca961ffe59a0b35e41eb75a7535f1d5527b1617c30bb48013de96c7","sha256:e93083e517e18859753e9621b32823ee48d258f034e9f8afc7eb61f705e5dbaf"],"state_sha256":"9687eb2c435915a531b5ee2c85e6cc15091d803bde0d4ac54298a828cf299934"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TJ1SHRQkz1wP4oyj/cmJ4PYqw7bNuVBeBDFmXeW463i+P8PHl/61zu8Uoc8PCRhFg9gN91CEYg8gHeo0CIkSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T23:00:23.635564Z","bundle_sha256":"1c89cb91b57600e749718157fcf662549cacecbab5a13ecef644cabd8e761dc5"}}