{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2WNGNWIV6JZ7JTOTBGU2MHXMJP","short_pith_number":"pith:2WNGNWIV","schema_version":"1.0","canonical_sha256":"d59a66d915f273f4cdd309a9a61eec4bfcac76ba9595e4386b50fc6743f675be","source":{"kind":"arxiv","id":"1410.2198","version":1},"attestation_state":"computed","paper":{"title":"Robust hamiltonicity of random directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Noever, Asaf Ferber, Nemanja \\v{S}kori\\'c, Rajko Nenadov, Ueli Peter","submitted_at":"2014-10-08T17:49:57Z","abstract_excerpt":"In his seminal paper from 1952 Dirac showed that the complete graph on $n\\geq 3$ vertices remains Hamiltonian even if we allow an adversary to remove $\\lfloor n/2\\rfloor$ edges touching each vertex. In 1960 Ghouila-Houri obtained an analogue statement for digraphs by showing that every directed graph on $n\\geq 3$ vertices with minimum in- and out-degree at least $n/2$ contains a directed Hamilton cycle. Both statements quantify the robustness of complete graphs (digraphs) with respect to the property of containing a Hamilton cycle.\n  A natural way to generalize such results to arbitrary graphs"},"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":"1410.2198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-08T17:49:57Z","cross_cats_sorted":[],"title_canon_sha256":"d163d0d12565f4766830d7ce4e00a1f9fbd75be0d1cb8f5111e3639cc14839c8","abstract_canon_sha256":"c48768e59b58baf2324ead326dcc06673543827145fff16d0db19d8e43805b0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:47.992827Z","signature_b64":"utBPozxHba60llJZRRoKTKCZYNl3BCRwkfu5CegEHyAZ5z6BGusjrIwnwWUDGOaNNacwkJZ9BWzjRpHhxh16Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d59a66d915f273f4cdd309a9a61eec4bfcac76ba9595e4386b50fc6743f675be","last_reissued_at":"2026-05-18T02:40:47.992247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:47.992247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust hamiltonicity of random directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Noever, Asaf Ferber, Nemanja \\v{S}kori\\'c, Rajko Nenadov, Ueli Peter","submitted_at":"2014-10-08T17:49:57Z","abstract_excerpt":"In his seminal paper from 1952 Dirac showed that the complete graph on $n\\geq 3$ vertices remains Hamiltonian even if we allow an adversary to remove $\\lfloor n/2\\rfloor$ edges touching each vertex. In 1960 Ghouila-Houri obtained an analogue statement for digraphs by showing that every directed graph on $n\\geq 3$ vertices with minimum in- and out-degree at least $n/2$ contains a directed Hamilton cycle. Both statements quantify the robustness of complete graphs (digraphs) with respect to the property of containing a Hamilton cycle.\n  A natural way to generalize such results to arbitrary graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2198","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":"1410.2198","created_at":"2026-05-18T02:40:47.992334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2198v1","created_at":"2026-05-18T02:40:47.992334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2198","created_at":"2026-05-18T02:40:47.992334+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WNGNWIV6JZ7","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WNGNWIV6JZ7JTOT","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WNGNWIV","created_at":"2026-05-18T12:28:11.866339+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/2WNGNWIV6JZ7JTOTBGU2MHXMJP","json":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP.json","graph_json":"https://pith.science/api/pith-number/2WNGNWIV6JZ7JTOTBGU2MHXMJP/graph.json","events_json":"https://pith.science/api/pith-number/2WNGNWIV6JZ7JTOTBGU2MHXMJP/events.json","paper":"https://pith.science/paper/2WNGNWIV"},"agent_actions":{"view_html":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP","download_json":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP.json","view_paper":"https://pith.science/paper/2WNGNWIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2198&json=true","fetch_graph":"https://pith.science/api/pith-number/2WNGNWIV6JZ7JTOTBGU2MHXMJP/graph.json","fetch_events":"https://pith.science/api/pith-number/2WNGNWIV6JZ7JTOTBGU2MHXMJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP/action/storage_attestation","attest_author":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP/action/author_attestation","sign_citation":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP/action/citation_signature","submit_replication":"https://pith.science/pith/2WNGNWIV6JZ7JTOTBGU2MHXMJP/action/replication_record"}},"created_at":"2026-05-18T02:40:47.992334+00:00","updated_at":"2026-05-18T02:40:47.992334+00:00"}