{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z5DIP5CV5SIE3HGMFV7BF272CO","short_pith_number":"pith:Z5DIP5CV","canonical_record":{"source":{"id":"1403.0776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T13:06:00Z","cross_cats_sorted":[],"title_canon_sha256":"6c49386bbd2ae6976523ab4cc3d7eb59cb9f3e63645e7ea5c8138a69b299f0b0","abstract_canon_sha256":"c65ae0b00aa4591cc35ea78a4e4de56e0ffc46070d369be2d342e812f437b068"},"schema_version":"1.0"},"canonical_sha256":"cf4687f455ec904d9ccc2d7e12ebfa13a4f92690fd5ffc507493e561d2a8a646","source":{"kind":"arxiv","id":"1403.0776","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0776","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0776v2","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0776","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"Z5DIP5CV5SIE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z5DIP5CV5SIE3HGM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z5DIP5CV","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z5DIP5CV5SIE3HGMFV7BF272CO","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T13:06:00Z","cross_cats_sorted":[],"title_canon_sha256":"6c49386bbd2ae6976523ab4cc3d7eb59cb9f3e63645e7ea5c8138a69b299f0b0","abstract_canon_sha256":"c65ae0b00aa4591cc35ea78a4e4de56e0ffc46070d369be2d342e812f437b068"},"schema_version":"1.0"},"canonical_sha256":"cf4687f455ec904d9ccc2d7e12ebfa13a4f92690fd5ffc507493e561d2a8a646","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:53.670302Z","signature_b64":"ABKiWaynDX7TFPd6Kzb6F20PHQmrNDuuuixjsGrWgXkMQv9t4hQaFR1MEdxxZOPObvWw6khbHGsDsqDpEZdIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf4687f455ec904d9ccc2d7e12ebfa13a4f92690fd5ffc507493e561d2a8a646","last_reissued_at":"2026-05-18T02:29:53.669608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:53.669608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0776","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lmtFpHw/N09FelTbiwTN33MLCJoPPRyYgq3ZZbqQX8vheUm9wn2umHQm4qXfbkNCqu7KRleg1RahG/XJeb8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:19:20.414687Z"},"content_sha256":"63dc8dd7791a51b4276f64a7d3fb348fc66e6184f0bfec071ebf965e22ba2c2a","schema_version":"1.0","event_id":"sha256:63dc8dd7791a51b4276f64a7d3fb348fc66e6184f0bfec071ebf965e22ba2c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z5DIP5CV5SIE3HGMFV7BF272CO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ore-degree threshold for the square of a Hamiltonian cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imdadullah Khan, Louis DeBiasio, Safi Faizullah","submitted_at":"2014-03-04T13:06:00Z","abstract_excerpt":"A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian cycle. In 1960, Ore relaxed the degree condition in the Dirac's theorem by proving that every graph with $deg(u) + deg(v) \\geq n$ for every $uv \\notin E(G)$ contains a Hamiltonian cycle. Recently, Ch\\^au proved an Ore-type version of P\\'osa's conjecture for graphs on $n\\geq n_0$ vertices using the regularity--blow-up method; consequently the $n_0$ is very la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0776","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYWxOq0k1DfA6uyUNnF0UGt+eofGo+jTa1DDsNZxtEu2HIU7edVl/6PMqv72T605llriTL9OE0E3vwGWNNeNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:19:20.415044Z"},"content_sha256":"655fa9084b4a4f9f0dab59912120a3e33652aae109e5e927999b566bcbed9572","schema_version":"1.0","event_id":"sha256:655fa9084b4a4f9f0dab59912120a3e33652aae109e5e927999b566bcbed9572"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5DIP5CV5SIE3HGMFV7BF272CO/bundle.json","state_url":"https://pith.science/pith/Z5DIP5CV5SIE3HGMFV7BF272CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5DIP5CV5SIE3HGMFV7BF272CO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T23:19:20Z","links":{"resolver":"https://pith.science/pith/Z5DIP5CV5SIE3HGMFV7BF272CO","bundle":"https://pith.science/pith/Z5DIP5CV5SIE3HGMFV7BF272CO/bundle.json","state":"https://pith.science/pith/Z5DIP5CV5SIE3HGMFV7BF272CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5DIP5CV5SIE3HGMFV7BF272CO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z5DIP5CV5SIE3HGMFV7BF272CO","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":"c65ae0b00aa4591cc35ea78a4e4de56e0ffc46070d369be2d342e812f437b068","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T13:06:00Z","title_canon_sha256":"6c49386bbd2ae6976523ab4cc3d7eb59cb9f3e63645e7ea5c8138a69b299f0b0"},"schema_version":"1.0","source":{"id":"1403.0776","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0776","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0776v2","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0776","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"Z5DIP5CV5SIE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z5DIP5CV5SIE3HGM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z5DIP5CV","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:655fa9084b4a4f9f0dab59912120a3e33652aae109e5e927999b566bcbed9572","target":"graph","created_at":"2026-05-18T02:29:53Z","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"},"paper":{"abstract_excerpt":"A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian cycle. In 1960, Ore relaxed the degree condition in the Dirac's theorem by proving that every graph with $deg(u) + deg(v) \\geq n$ for every $uv \\notin E(G)$ contains a Hamiltonian cycle. Recently, Ch\\^au proved an Ore-type version of P\\'osa's conjecture for graphs on $n\\geq n_0$ vertices using the regularity--blow-up method; consequently the $n_0$ is very la","authors_text":"Imdadullah Khan, Louis DeBiasio, Safi Faizullah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T13:06:00Z","title":"Ore-degree threshold for the square of a Hamiltonian cycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0776","kind":"arxiv","version":2},"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:63dc8dd7791a51b4276f64a7d3fb348fc66e6184f0bfec071ebf965e22ba2c2a","target":"record","created_at":"2026-05-18T02:29:53Z","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":"c65ae0b00aa4591cc35ea78a4e4de56e0ffc46070d369be2d342e812f437b068","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T13:06:00Z","title_canon_sha256":"6c49386bbd2ae6976523ab4cc3d7eb59cb9f3e63645e7ea5c8138a69b299f0b0"},"schema_version":"1.0","source":{"id":"1403.0776","kind":"arxiv","version":2}},"canonical_sha256":"cf4687f455ec904d9ccc2d7e12ebfa13a4f92690fd5ffc507493e561d2a8a646","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf4687f455ec904d9ccc2d7e12ebfa13a4f92690fd5ffc507493e561d2a8a646","first_computed_at":"2026-05-18T02:29:53.669608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:53.669608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ABKiWaynDX7TFPd6Kzb6F20PHQmrNDuuuixjsGrWgXkMQv9t4hQaFR1MEdxxZOPObvWw6khbHGsDsqDpEZdIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:53.670302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0776","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63dc8dd7791a51b4276f64a7d3fb348fc66e6184f0bfec071ebf965e22ba2c2a","sha256:655fa9084b4a4f9f0dab59912120a3e33652aae109e5e927999b566bcbed9572"],"state_sha256":"ee83cb4a2bf7ed71deb5690251c4dfca99f9e2cc0b2bed23c625a4213f8c717e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hejXxgsodS2/jpx++FS/am7W2nq/+xVqDYQCRdOvZQ3r66nRCXCXosg7nCfRLi+lqkMeRq5pHZ8Mwk20HFzQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:19:20.417075Z","bundle_sha256":"95a2e35b13248ba7c09cdaedcf1bc92026ae9751d4f98d216ffcbc6dd725ca7d"}}