{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RI7LDKWRH74E2TG7LFC6EZ5QN7","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":"314050b35107fd4053143472155688196ed9698ba6d9c5d1501c2eef45a23145","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-10T01:14:08Z","title_canon_sha256":"2cde875d2265143176ca8d7775c14cb24b41eac8f14c2c454d1a6b84c4a728fc"},"schema_version":"1.0","source":{"id":"1908.03659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03659","created_at":"2026-07-04T23:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03659v1","created_at":"2026-07-04T23:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03659","created_at":"2026-07-04T23:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"RI7LDKWRH74E","created_at":"2026-07-04T23:52:43Z"},{"alias_kind":"pith_short_16","alias_value":"RI7LDKWRH74E2TG7","created_at":"2026-07-04T23:52:43Z"},{"alias_kind":"pith_short_8","alias_value":"RI7LDKWR","created_at":"2026-07-04T23:52:43Z"}],"graph_snapshots":[{"event_id":"sha256:706b83fc3d9f8009fce533fbe741967b3fc2dcba20fa72d3d2b60e5a286f2e45","target":"graph","created_at":"2026-07-04T23:52:43Z","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.03659/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study Hamilton cycles and perfect matchings in a uniform attachment graph. In this random graph, vertices are added sequentially, and when a vertex $t$ is created, it makes $k$ independent and uniform choices from $\\{1,\\dots,t-1\\}$ and attaches itself to these vertices. Improving the results of Frieze, P\\'erez-Gim\\'enez, Pra\\l{}at and Reiniger (2019), we show that, with probability approaching 1 as $n$ tends to infinity, a uniform attachment graph on $n$ vertices has a perfect matching for $k \\ge 5$ and a Hamilton cycle for $k\\ge 13$. One of the ingredients in our proofs is the identificati","authors_text":"Huseyin Acan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03659","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:9c3513c1b2fa48941ffa18b3b35adcd8dbe9f5a631fea35ed90d4ef6bd65bf51","target":"record","created_at":"2026-07-04T23:52:43Z","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":"314050b35107fd4053143472155688196ed9698ba6d9c5d1501c2eef45a23145","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-10T01:14:08Z","title_canon_sha256":"2cde875d2265143176ca8d7775c14cb24b41eac8f14c2c454d1a6b84c4a728fc"},"schema_version":"1.0","source":{"id":"1908.03659","kind":"arxiv","version":1}},"canonical_sha256":"8a3eb1aad13ff84d4cdf5945e267b06ffc5706ebb6c95bff087fb34048713b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a3eb1aad13ff84d4cdf5945e267b06ffc5706ebb6c95bff087fb34048713b1a","first_computed_at":"2026-07-04T23:52:43.382474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:43.382474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cVrwKHma7nVr0NxOTorwzMJs8mqeDXfANVbtTCtWYhpcQaiGrI82WUobCxsxOXApgjg9xyQTgDH/ccbsBu5tAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:43.382823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c3513c1b2fa48941ffa18b3b35adcd8dbe9f5a631fea35ed90d4ef6bd65bf51","sha256:706b83fc3d9f8009fce533fbe741967b3fc2dcba20fa72d3d2b60e5a286f2e45"],"state_sha256":"317e1cc27d77e6114944d3f861ea6dc2b0d241a896b331a6e1b456c510fe4746"}