{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KEZSEQOQGFOU7E2SQ3XOULMPA2","short_pith_number":"pith:KEZSEQOQ","canonical_record":{"source":{"id":"1908.02407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T00:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"c50b955cebcc9fdb45fe3c3e723688b6e6255a1af87702585374949383598cbf","abstract_canon_sha256":"caf082352ce55157986fb9e18134864373f8995973f9d1679900433d2a851ff8"},"schema_version":"1.0"},"canonical_sha256":"51332241d0315d4f935286eeea2d8f06853d665ce0a2d1b92ea6dade0ae2e27b","source":{"kind":"arxiv","id":"1908.02407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02407","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02407v2","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02407","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"KEZSEQOQGFOU","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"pith_short_16","alias_value":"KEZSEQOQGFOU7E2S","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"pith_short_8","alias_value":"KEZSEQOQ","created_at":"2026-07-05T01:51:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KEZSEQOQGFOU7E2SQ3XOULMPA2","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T00:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"c50b955cebcc9fdb45fe3c3e723688b6e6255a1af87702585374949383598cbf","abstract_canon_sha256":"caf082352ce55157986fb9e18134864373f8995973f9d1679900433d2a851ff8"},"schema_version":"1.0"},"canonical_sha256":"51332241d0315d4f935286eeea2d8f06853d665ce0a2d1b92ea6dade0ae2e27b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:05.130889Z","signature_b64":"Dx4Vl7qHNJFS7UWvTya0NUknmOZgJc/BWYyxpl88C7Csg8HsSiEVSOfq7rHLT9Xz/Il8/QxZclrwKQwilE/fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51332241d0315d4f935286eeea2d8f06853d665ce0a2d1b92ea6dade0ae2e27b","last_reissued_at":"2026-07-05T01:51:05.130446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:05.130446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02407","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-07-05T01:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8p1P/gTscqUwxYB2u+jHXXtpJtoPNg+8n81zymwWV/hiaxnCnZJhOjePNizc9UzrwccqJ9qMb+ODv8FXq/GTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:51.586291Z"},"content_sha256":"e1c8cb7116821f1c80603d08c79d465e895ffaef43ac8d52f85f562efd4229cf","schema_version":"1.0","event_id":"sha256:e1c8cb7116821f1c80603d08c79d465e895ffaef43ac8d52f85f562efd4229cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KEZSEQOQGFOU7E2SQ3XOULMPA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Boris Pittel, Huseyin Acan","submitted_at":"2019-08-07T00:24:15Z","abstract_excerpt":"We study two models of an age-biased graph process: the $\\delta$-version of the preferential attachment graph model (PAM) and the uniform attachment graph model (UAM), with $m$ attachments for each of incoming vertices. We show that almost surely the scaled size of a breadth-first (descendant) tree rooted at a fixed vertex converges, for $m=1$, to a limit whose distribution is a mixture of two beta-distributions and a single beta-distribution respectively, and that for $m>1$ the limit is $1$. We also analyze the likely performance of two greedy (online) algorithms, for a large matching set and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02407","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02407/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-05T01:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87fPGcbu73s2kx5SI1EB9vKS8fbIh8zp14cbZAXVNBTOlSY+4KCXblDMjXUU7dlC8bYtzBuu3Ai/p7h34YH3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:51.586814Z"},"content_sha256":"c6d3a7262dc553260ebde4e1030891f8a0f0cf100b3e3e88775edfbd4122acdf","schema_version":"1.0","event_id":"sha256:c6d3a7262dc553260ebde4e1030891f8a0f0cf100b3e3e88775edfbd4122acdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/bundle.json","state_url":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/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-08-16T05:23:51Z","links":{"resolver":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2","bundle":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/bundle.json","state":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KEZSEQOQGFOU7E2SQ3XOULMPA2","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":"caf082352ce55157986fb9e18134864373f8995973f9d1679900433d2a851ff8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T00:24:15Z","title_canon_sha256":"c50b955cebcc9fdb45fe3c3e723688b6e6255a1af87702585374949383598cbf"},"schema_version":"1.0","source":{"id":"1908.02407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02407","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02407v2","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02407","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"KEZSEQOQGFOU","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"pith_short_16","alias_value":"KEZSEQOQGFOU7E2S","created_at":"2026-07-05T01:51:05Z"},{"alias_kind":"pith_short_8","alias_value":"KEZSEQOQ","created_at":"2026-07-05T01:51:05Z"}],"graph_snapshots":[{"event_id":"sha256:c6d3a7262dc553260ebde4e1030891f8a0f0cf100b3e3e88775edfbd4122acdf","target":"graph","created_at":"2026-07-05T01:51:05Z","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/1908.02407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study two models of an age-biased graph process: the $\\delta$-version of the preferential attachment graph model (PAM) and the uniform attachment graph model (UAM), with $m$ attachments for each of incoming vertices. We show that almost surely the scaled size of a breadth-first (descendant) tree rooted at a fixed vertex converges, for $m=1$, to a limit whose distribution is a mixture of two beta-distributions and a single beta-distribution respectively, and that for $m>1$ the limit is $1$. We also analyze the likely performance of two greedy (online) algorithms, for a large matching set and","authors_text":"Alan Frieze, Boris Pittel, Huseyin Acan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02407","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:e1c8cb7116821f1c80603d08c79d465e895ffaef43ac8d52f85f562efd4229cf","target":"record","created_at":"2026-07-05T01:51:05Z","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":"caf082352ce55157986fb9e18134864373f8995973f9d1679900433d2a851ff8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T00:24:15Z","title_canon_sha256":"c50b955cebcc9fdb45fe3c3e723688b6e6255a1af87702585374949383598cbf"},"schema_version":"1.0","source":{"id":"1908.02407","kind":"arxiv","version":2}},"canonical_sha256":"51332241d0315d4f935286eeea2d8f06853d665ce0a2d1b92ea6dade0ae2e27b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51332241d0315d4f935286eeea2d8f06853d665ce0a2d1b92ea6dade0ae2e27b","first_computed_at":"2026-07-05T01:51:05.130446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:05.130446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dx4Vl7qHNJFS7UWvTya0NUknmOZgJc/BWYyxpl88C7Csg8HsSiEVSOfq7rHLT9Xz/Il8/QxZclrwKQwilE/fBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:05.130889Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1c8cb7116821f1c80603d08c79d465e895ffaef43ac8d52f85f562efd4229cf","sha256:c6d3a7262dc553260ebde4e1030891f8a0f0cf100b3e3e88775edfbd4122acdf"],"state_sha256":"6d4006705f6c866bebee1dc9bdd1a964c7aa3ce8b95b7fbe4a9a70bb182ef29b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMC9PxFPGIZLF9OXJy/L1SppPInH4wzp8ojIimV8/Lj6MCr7Vl2U5PCS7OwgFjuEdy6bjAp/7UOO1jDLdvClBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:23:51.590714Z","bundle_sha256":"58a0776d013e9c824c861cc1c206b773431621910a55902aeb225c7a89e8e77c"}}