{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JOFAUNLEDM34UGWMXCKCBQKF3G","short_pith_number":"pith:JOFAUNLE","schema_version":"1.0","canonical_sha256":"4b8a0a35641b37ca1accb89420c145d99b073f0d2e934960054709c184e43413","source":{"kind":"arxiv","id":"2203.07148","version":2},"attestation_state":"computed","paper":{"title":"Oriented discrepancy of Hamilton cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lior Gishboliner, Michael Krivelevich, Peleg Michaeli","submitted_at":"2022-03-14T14:44:45Z","abstract_excerpt":"We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\\ge 3$ vertices and minimum degree $\\delta(G)\\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\\delta(G)$ edges oriented in the same direction. We prove an approximate version of this conjecture, showing that minimum degree $n/2 + O(k)$ guarantees a Hamilton cycle with at least $(n+k)/2$ edges oriented in the same direction. We also study the analogous problem for random graphs, showing that if the edge probability $p = p(n)$ is above the Hamiltonicity threshold, then, with"},"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":"2203.07148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-03-14T14:44:45Z","cross_cats_sorted":[],"title_canon_sha256":"970156d3a1647d4c209ef27345daabb79ce158d2845564f0468a3ede42aec9bf","abstract_canon_sha256":"d689bfbd36111d197f260407273a8b88988d15d17a9b61a6cae34ae6baa2b122"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:53.098468Z","signature_b64":"jWunjDROMIdIvRUrQs/ERm5yYvx4glKPo78u8Xwcm7plJzGmLr0qAmeYYZ2+wgzw3nkE24/AvAIGuXvqyxcFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b8a0a35641b37ca1accb89420c145d99b073f0d2e934960054709c184e43413","last_reissued_at":"2026-07-05T05:49:53.098079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:53.098079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oriented discrepancy of Hamilton cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lior Gishboliner, Michael Krivelevich, Peleg Michaeli","submitted_at":"2022-03-14T14:44:45Z","abstract_excerpt":"We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\\ge 3$ vertices and minimum degree $\\delta(G)\\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\\delta(G)$ edges oriented in the same direction. We prove an approximate version of this conjecture, showing that minimum degree $n/2 + O(k)$ guarantees a Hamilton cycle with at least $(n+k)/2$ edges oriented in the same direction. We also study the analogous problem for random graphs, showing that if the edge probability $p = p(n)$ is above the Hamiltonicity threshold, then, with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.07148","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/2203.07148/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":"2203.07148","created_at":"2026-07-05T05:49:53.098142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.07148v2","created_at":"2026-07-05T05:49:53.098142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07148","created_at":"2026-07-05T05:49:53.098142+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOFAUNLEDM34","created_at":"2026-07-05T05:49:53.098142+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOFAUNLEDM34UGWM","created_at":"2026-07-05T05:49:53.098142+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOFAUNLE","created_at":"2026-07-05T05:49:53.098142+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/JOFAUNLEDM34UGWMXCKCBQKF3G","json":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G.json","graph_json":"https://pith.science/api/pith-number/JOFAUNLEDM34UGWMXCKCBQKF3G/graph.json","events_json":"https://pith.science/api/pith-number/JOFAUNLEDM34UGWMXCKCBQKF3G/events.json","paper":"https://pith.science/paper/JOFAUNLE"},"agent_actions":{"view_html":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G","download_json":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G.json","view_paper":"https://pith.science/paper/JOFAUNLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.07148&json=true","fetch_graph":"https://pith.science/api/pith-number/JOFAUNLEDM34UGWMXCKCBQKF3G/graph.json","fetch_events":"https://pith.science/api/pith-number/JOFAUNLEDM34UGWMXCKCBQKF3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G/action/storage_attestation","attest_author":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G/action/author_attestation","sign_citation":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G/action/citation_signature","submit_replication":"https://pith.science/pith/JOFAUNLEDM34UGWMXCKCBQKF3G/action/replication_record"}},"created_at":"2026-07-05T05:49:53.098142+00:00","updated_at":"2026-07-05T05:49:53.098142+00:00"}