{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5GDBVIO5WQIPOPAAB4QEZDBA5C","short_pith_number":"pith:5GDBVIO5","canonical_record":{"source":{"id":"2011.03619","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-06T22:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"48c7633bfc9a05793d342b84118d27b6653bc8754c24ef443c684466ecdedeeb","abstract_canon_sha256":"fa7b4903606adf34e45567d0be9e960ddb7c73fcac1ee78d9ae72170ef51a1ea"},"schema_version":"1.0"},"canonical_sha256":"e9861aa1ddb410f73c000f204c8c20e8b99563de1be3bcff5ba3163c4ebb2d10","source":{"kind":"arxiv","id":"2011.03619","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03619","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03619v5","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03619","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"5GDBVIO5WQIP","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"pith_short_16","alias_value":"5GDBVIO5WQIPOPAA","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"pith_short_8","alias_value":"5GDBVIO5","created_at":"2026-07-05T08:07:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5GDBVIO5WQIPOPAAB4QEZDBA5C","target":"record","payload":{"canonical_record":{"source":{"id":"2011.03619","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-06T22:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"48c7633bfc9a05793d342b84118d27b6653bc8754c24ef443c684466ecdedeeb","abstract_canon_sha256":"fa7b4903606adf34e45567d0be9e960ddb7c73fcac1ee78d9ae72170ef51a1ea"},"schema_version":"1.0"},"canonical_sha256":"e9861aa1ddb410f73c000f204c8c20e8b99563de1be3bcff5ba3163c4ebb2d10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:06.981970Z","signature_b64":"jcB+MVWPMMujasWCqrsWi9MzIblKJoka7w3UXKdBTUoP0ZhqLy7naZ4CnRpmZ0tA5tySGxp10MRuaiiWhrbaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9861aa1ddb410f73c000f204c8c20e8b99563de1be3bcff5ba3163c4ebb2d10","last_reissued_at":"2026-07-05T08:07:06.981596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:06.981596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.03619","source_version":5,"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-07-05T08:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkIkiW1cT80OfumbUDlvsFX24dOOqkjFDyuOLnqhK3BlBpTtywi0vqzvz5vwlpYPdmUtBXKeaa1nLxj185vdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:30.598963Z"},"content_sha256":"5be40940fa1f090a5752b0b0829a6171c930c2e96a69aba2c6b174169e97557d","schema_version":"1.0","event_id":"sha256:5be40940fa1f090a5752b0b0829a6171c930c2e96a69aba2c6b174169e97557d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5GDBVIO5WQIPOPAAB4QEZDBA5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Extensions of Dirac's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2020-11-06T22:32:33Z","abstract_excerpt":"In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\\delta\\geq 2$ contains a cycle with at least $\\min\\{2\\delta,n\\}$ vertices. In particular, if $\\delta\\geq n/2$, then $G$ is Hamiltonian. The proof of Dirac's theorem is constructive, and it yields an algorithm computing the corresponding cycle in polynomial time. The combinatorial bound of Dirac's theorem is tight in the following sense. There are 2-connected graphs that do not contain cycles of length more than $2\\delta+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03619","kind":"arxiv","version":5},"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/2011.03619/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"},"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-07-05T08:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdcRuG87DE1uh8/lY4a7Ma0EWYeKqSwqP1t3CH5tzIzzjN28SSgfDJrqfKMeNlHp1j2jxdiO6sJ82b0T/Fy6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:30.599615Z"},"content_sha256":"45c7240dc9c8905d463820afda64e4a6ec659e47e55441f30fe2bc3355cd8438","schema_version":"1.0","event_id":"sha256:45c7240dc9c8905d463820afda64e4a6ec659e47e55441f30fe2bc3355cd8438"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/bundle.json","state_url":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/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-08-14T06:41:30Z","links":{"resolver":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C","bundle":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/bundle.json","state":"https://pith.science/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GDBVIO5WQIPOPAAB4QEZDBA5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5GDBVIO5WQIPOPAAB4QEZDBA5C","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":"fa7b4903606adf34e45567d0be9e960ddb7c73fcac1ee78d9ae72170ef51a1ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-06T22:32:33Z","title_canon_sha256":"48c7633bfc9a05793d342b84118d27b6653bc8754c24ef443c684466ecdedeeb"},"schema_version":"1.0","source":{"id":"2011.03619","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03619","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03619v5","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03619","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"5GDBVIO5WQIP","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"pith_short_16","alias_value":"5GDBVIO5WQIPOPAA","created_at":"2026-07-05T08:07:06Z"},{"alias_kind":"pith_short_8","alias_value":"5GDBVIO5","created_at":"2026-07-05T08:07:06Z"}],"graph_snapshots":[{"event_id":"sha256:45c7240dc9c8905d463820afda64e4a6ec659e47e55441f30fe2bc3355cd8438","target":"graph","created_at":"2026-07-05T08:07:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.03619/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\\delta\\geq 2$ contains a cycle with at least $\\min\\{2\\delta,n\\}$ vertices. In particular, if $\\delta\\geq n/2$, then $G$ is Hamiltonian. The proof of Dirac's theorem is constructive, and it yields an algorithm computing the corresponding cycle in polynomial time. The combinatorial bound of Dirac's theorem is tight in the following sense. There are 2-connected graphs that do not contain cycles of length more than $2\\delta+","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-06T22:32:33Z","title":"Algorithmic Extensions of Dirac's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03619","kind":"arxiv","version":5},"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:5be40940fa1f090a5752b0b0829a6171c930c2e96a69aba2c6b174169e97557d","target":"record","created_at":"2026-07-05T08:07:06Z","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":"fa7b4903606adf34e45567d0be9e960ddb7c73fcac1ee78d9ae72170ef51a1ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-06T22:32:33Z","title_canon_sha256":"48c7633bfc9a05793d342b84118d27b6653bc8754c24ef443c684466ecdedeeb"},"schema_version":"1.0","source":{"id":"2011.03619","kind":"arxiv","version":5}},"canonical_sha256":"e9861aa1ddb410f73c000f204c8c20e8b99563de1be3bcff5ba3163c4ebb2d10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9861aa1ddb410f73c000f204c8c20e8b99563de1be3bcff5ba3163c4ebb2d10","first_computed_at":"2026-07-05T08:07:06.981596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:06.981596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jcB+MVWPMMujasWCqrsWi9MzIblKJoka7w3UXKdBTUoP0ZhqLy7naZ4CnRpmZ0tA5tySGxp10MRuaiiWhrbaAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:06.981970Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.03619","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5be40940fa1f090a5752b0b0829a6171c930c2e96a69aba2c6b174169e97557d","sha256:45c7240dc9c8905d463820afda64e4a6ec659e47e55441f30fe2bc3355cd8438"],"state_sha256":"e16e257b13c313e0ea41a500dbdd909f96ba36ca325353311b3bae60818625d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDl5/1slT6VIboKmkK91Y2MPGyNdP56s8KqJXwCewswDd4q5mcjkaIUwLZu4NLbjhqu/dub4Z1yj7kws9EDJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:41:30.606284Z","bundle_sha256":"3160cbe9cf0ed0009a6ebc0d603abfdf48f57897521c6c461e8cc18314f5d055"}}