{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:E23CMEYU7BDJQRL5WW6PKSRVZI","short_pith_number":"pith:E23CMEYU","schema_version":"1.0","canonical_sha256":"26b6261314f84698457db5bcf54a35ca011f84d8b018c26b7d347079b1e6e273","source":{"kind":"arxiv","id":"0801.0394","version":3},"attestation_state":"computed","paper":{"title":"An exact minimum degree condition for Hamilton cycles in oriented graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Peter Keevash","submitted_at":"2008-01-02T14:22:05Z","abstract_excerpt":"We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979."},"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":"0801.0394","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2008-01-02T14:22:05Z","cross_cats_sorted":[],"title_canon_sha256":"c8d96fedd1d9969dc0867f3a124acf037238e570f2e023cdf7c9bf862211ebd9","abstract_canon_sha256":"3ae14c4692dca0a738694c54ae018c66efbdc36692f2f1467710e45fde939b59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:11.923780Z","signature_b64":"3Xzh12Hefh+HtoMFGxofKKPFWqttVjFCFDDcTOYArSqp1TZjRJCJRIGXIe1aGjmf/af1EIHGaW9URZSDl13VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26b6261314f84698457db5bcf54a35ca011f84d8b018c26b7d347079b1e6e273","last_reissued_at":"2026-05-18T02:58:11.922951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:11.922951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exact minimum degree condition for Hamilton cycles in oriented graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Peter Keevash","submitted_at":"2008-01-02T14:22:05Z","abstract_excerpt":"We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0394","kind":"arxiv","version":3},"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":"0801.0394","created_at":"2026-05-18T02:58:11.923079+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.0394v3","created_at":"2026-05-18T02:58:11.923079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0394","created_at":"2026-05-18T02:58:11.923079+00:00"},{"alias_kind":"pith_short_12","alias_value":"E23CMEYU7BDJ","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"E23CMEYU7BDJQRL5","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"E23CMEYU","created_at":"2026-05-18T12:25:57.157939+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/E23CMEYU7BDJQRL5WW6PKSRVZI","json":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI.json","graph_json":"https://pith.science/api/pith-number/E23CMEYU7BDJQRL5WW6PKSRVZI/graph.json","events_json":"https://pith.science/api/pith-number/E23CMEYU7BDJQRL5WW6PKSRVZI/events.json","paper":"https://pith.science/paper/E23CMEYU"},"agent_actions":{"view_html":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI","download_json":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI.json","view_paper":"https://pith.science/paper/E23CMEYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.0394&json=true","fetch_graph":"https://pith.science/api/pith-number/E23CMEYU7BDJQRL5WW6PKSRVZI/graph.json","fetch_events":"https://pith.science/api/pith-number/E23CMEYU7BDJQRL5WW6PKSRVZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI/action/storage_attestation","attest_author":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI/action/author_attestation","sign_citation":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI/action/citation_signature","submit_replication":"https://pith.science/pith/E23CMEYU7BDJQRL5WW6PKSRVZI/action/replication_record"}},"created_at":"2026-05-18T02:58:11.923079+00:00","updated_at":"2026-05-18T02:58:11.923079+00:00"}