{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TGUSEI2HRM2EJEPBWO6YBYDRWS","short_pith_number":"pith:TGUSEI2H","schema_version":"1.0","canonical_sha256":"99a92223478b344491e1b3bd80e071b4a4e05df0d4c5b2bf7baaa66447fc0e80","source":{"kind":"arxiv","id":"1710.02716","version":1},"attestation_state":"computed","paper":{"title":"Adding random edges to create the square of a Hamilton cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek, Patrick Bennett","submitted_at":"2017-10-07T18:05:40Z","abstract_excerpt":"We consider how many random edges need to be added to a graph of order $n$ with minimum degree $\\alpha n$ in order that it contains the square of a Hamilton cycle w.h.p.."},"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":"1710.02716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-07T18:05:40Z","cross_cats_sorted":[],"title_canon_sha256":"63f337f2092190dc5d763a7be53827dbe1d7f2f7b35c5bbfe31118b1cb2c871a","abstract_canon_sha256":"20edb0f41824121a68543f8447758d2a722fcae1a648375f258d6c241a934202"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:29.057332Z","signature_b64":"M4LhZvXqbVfnG5K5K9/vjBWX76eGsZ1zLCpF9mnQi4MCC4hI7vTlRuu/GnMxu0/NCRu0EjmQR/Yl36waX+qbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99a92223478b344491e1b3bd80e071b4a4e05df0d4c5b2bf7baaa66447fc0e80","last_reissued_at":"2026-05-18T00:33:29.056776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:29.056776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adding random edges to create the square of a Hamilton cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek, Patrick Bennett","submitted_at":"2017-10-07T18:05:40Z","abstract_excerpt":"We consider how many random edges need to be added to a graph of order $n$ with minimum degree $\\alpha n$ in order that it contains the square of a Hamilton cycle w.h.p.."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02716","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":""},"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":"1710.02716","created_at":"2026-05-18T00:33:29.056880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02716v1","created_at":"2026-05-18T00:33:29.056880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02716","created_at":"2026-05-18T00:33:29.056880+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGUSEI2HRM2E","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGUSEI2HRM2EJEPB","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGUSEI2H","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.25250","citing_title":"Triangle packings in randomly perturbed graphs","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS","json":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS.json","graph_json":"https://pith.science/api/pith-number/TGUSEI2HRM2EJEPBWO6YBYDRWS/graph.json","events_json":"https://pith.science/api/pith-number/TGUSEI2HRM2EJEPBWO6YBYDRWS/events.json","paper":"https://pith.science/paper/TGUSEI2H"},"agent_actions":{"view_html":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS","download_json":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS.json","view_paper":"https://pith.science/paper/TGUSEI2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02716&json=true","fetch_graph":"https://pith.science/api/pith-number/TGUSEI2HRM2EJEPBWO6YBYDRWS/graph.json","fetch_events":"https://pith.science/api/pith-number/TGUSEI2HRM2EJEPBWO6YBYDRWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS/action/storage_attestation","attest_author":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS/action/author_attestation","sign_citation":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS/action/citation_signature","submit_replication":"https://pith.science/pith/TGUSEI2HRM2EJEPBWO6YBYDRWS/action/replication_record"}},"created_at":"2026-05-18T00:33:29.056880+00:00","updated_at":"2026-05-18T00:33:29.056880+00:00"}