{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KEZSEQOQGFOU7E2SQ3XOULMPA2","short_pith_number":"pith:KEZSEQOQ","schema_version":"1.0","canonical_sha256":"51332241d0315d4f935286eeea2d8f06853d665ce0a2d1b92ea6dade0ae2e27b","source":{"kind":"arxiv","id":"1908.02407","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.02407","created_at":"2026-07-05T01:51:05.130502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02407v2","created_at":"2026-07-05T01:51:05.130502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02407","created_at":"2026-07-05T01:51:05.130502+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEZSEQOQGFOU","created_at":"2026-07-05T01:51:05.130502+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEZSEQOQGFOU7E2S","created_at":"2026-07-05T01:51:05.130502+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEZSEQOQ","created_at":"2026-07-05T01:51:05.130502+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/KEZSEQOQGFOU7E2SQ3XOULMPA2","json":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2.json","graph_json":"https://pith.science/api/pith-number/KEZSEQOQGFOU7E2SQ3XOULMPA2/graph.json","events_json":"https://pith.science/api/pith-number/KEZSEQOQGFOU7E2SQ3XOULMPA2/events.json","paper":"https://pith.science/paper/KEZSEQOQ"},"agent_actions":{"view_html":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2","download_json":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2.json","view_paper":"https://pith.science/paper/KEZSEQOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02407&json=true","fetch_graph":"https://pith.science/api/pith-number/KEZSEQOQGFOU7E2SQ3XOULMPA2/graph.json","fetch_events":"https://pith.science/api/pith-number/KEZSEQOQGFOU7E2SQ3XOULMPA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/action/storage_attestation","attest_author":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/action/author_attestation","sign_citation":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/action/citation_signature","submit_replication":"https://pith.science/pith/KEZSEQOQGFOU7E2SQ3XOULMPA2/action/replication_record"}},"created_at":"2026-07-05T01:51:05.130502+00:00","updated_at":"2026-07-05T01:51:05.130502+00:00"}