{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RTAJF6X4X3UPG6S3FGL27MP3FI","short_pith_number":"pith:RTAJF6X4","canonical_record":{"source":{"id":"2212.06897","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-13T20:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"840f96f1294888622afd585799ac188dbe332be86a9a5dee8f47fa060ca4acff","abstract_canon_sha256":"dc39162d96247bf605a188e604d2e8d242126a9fbe2cbbc963f6760c9a4cd511"},"schema_version":"1.0"},"canonical_sha256":"8cc092fafcbee8f37a5b2997afb1fb2a08a065a148c2352decf31d5920edf948","source":{"kind":"arxiv","id":"2212.06897","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.06897","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"2212.06897v2","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06897","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"RTAJF6X4X3UP","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"pith_short_16","alias_value":"RTAJF6X4X3UPG6S3","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"pith_short_8","alias_value":"RTAJF6X4","created_at":"2026-07-05T06:44:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RTAJF6X4X3UPG6S3FGL27MP3FI","target":"record","payload":{"canonical_record":{"source":{"id":"2212.06897","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-13T20:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"840f96f1294888622afd585799ac188dbe332be86a9a5dee8f47fa060ca4acff","abstract_canon_sha256":"dc39162d96247bf605a188e604d2e8d242126a9fbe2cbbc963f6760c9a4cd511"},"schema_version":"1.0"},"canonical_sha256":"8cc092fafcbee8f37a5b2997afb1fb2a08a065a148c2352decf31d5920edf948","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:05.628117Z","signature_b64":"k73mtVVBeAR4sbH+TTOAm3qKNXFO/p3nkBifsb6M9kMk/BHkGBF5q8A2asTMKBywOvm4jgBK1dmV2fWZaSiPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cc092fafcbee8f37a5b2997afb1fb2a08a065a148c2352decf31d5920edf948","last_reissued_at":"2026-07-05T06:44:05.627663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:05.627663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.06897","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-07-05T06:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzpVauSZHxfhxol5+AuDfKKlpMs/PII25dDZqj5XPonVYnUXv2NZz1WmW14ndkfXR/P4c+xLorFob3dxGm8fAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:56:08.707810Z"},"content_sha256":"667a6950f8acc8a1ebe5741d7b4b934cebfd83c20b150ee79d98f72c313fc073","schema_version":"1.0","event_id":"sha256:667a6950f8acc8a1ebe5741d7b4b934cebfd83c20b150ee79d98f72c313fc073"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RTAJF6X4X3UPG6S3FGL27MP3FI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a property of $2$-connected graphs and Dirac's Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Grace McCourt, Ruth Luo","submitted_at":"2022-12-13T20:49:58Z","abstract_excerpt":"We refine a property of $2$-connected graphs described in the classical paper of Dirac from 1952 and use the refined property to somewhat shorten Dirac's proof of the fact that each $2$-connected $n$-vertex graph with minimum degree at least $k$ has a cycle of length at least $\\min\\{n,2k\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06897","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/2212.06897/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-05T06:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mbhv7WLISrYKeLkT30QtNINGH/orH8himo/1zDUikPqeoEBi/5UZidQyG1fALo/krjEhNr0TH8KaOU6NzfBTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:56:08.708184Z"},"content_sha256":"9e433d575e9f3ce769d138c63af0defbc48cc77b9391a354cb5f06f2c9a4962c","schema_version":"1.0","event_id":"sha256:9e433d575e9f3ce769d138c63af0defbc48cc77b9391a354cb5f06f2c9a4962c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTAJF6X4X3UPG6S3FGL27MP3FI/bundle.json","state_url":"https://pith.science/pith/RTAJF6X4X3UPG6S3FGL27MP3FI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTAJF6X4X3UPG6S3FGL27MP3FI/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-07-07T03:56:08Z","links":{"resolver":"https://pith.science/pith/RTAJF6X4X3UPG6S3FGL27MP3FI","bundle":"https://pith.science/pith/RTAJF6X4X3UPG6S3FGL27MP3FI/bundle.json","state":"https://pith.science/pith/RTAJF6X4X3UPG6S3FGL27MP3FI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTAJF6X4X3UPG6S3FGL27MP3FI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RTAJF6X4X3UPG6S3FGL27MP3FI","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":"dc39162d96247bf605a188e604d2e8d242126a9fbe2cbbc963f6760c9a4cd511","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-13T20:49:58Z","title_canon_sha256":"840f96f1294888622afd585799ac188dbe332be86a9a5dee8f47fa060ca4acff"},"schema_version":"1.0","source":{"id":"2212.06897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.06897","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"2212.06897v2","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.06897","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"RTAJF6X4X3UP","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"pith_short_16","alias_value":"RTAJF6X4X3UPG6S3","created_at":"2026-07-05T06:44:05Z"},{"alias_kind":"pith_short_8","alias_value":"RTAJF6X4","created_at":"2026-07-05T06:44:05Z"}],"graph_snapshots":[{"event_id":"sha256:9e433d575e9f3ce769d138c63af0defbc48cc77b9391a354cb5f06f2c9a4962c","target":"graph","created_at":"2026-07-05T06:44:05Z","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/2212.06897/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We refine a property of $2$-connected graphs described in the classical paper of Dirac from 1952 and use the refined property to somewhat shorten Dirac's proof of the fact that each $2$-connected $n$-vertex graph with minimum degree at least $k$ has a cycle of length at least $\\min\\{n,2k\\}$.","authors_text":"Alexandr Kostochka, Grace McCourt, Ruth Luo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-13T20:49:58Z","title":"On a property of $2$-connected graphs and Dirac's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.06897","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:667a6950f8acc8a1ebe5741d7b4b934cebfd83c20b150ee79d98f72c313fc073","target":"record","created_at":"2026-07-05T06:44:05Z","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":"dc39162d96247bf605a188e604d2e8d242126a9fbe2cbbc963f6760c9a4cd511","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-13T20:49:58Z","title_canon_sha256":"840f96f1294888622afd585799ac188dbe332be86a9a5dee8f47fa060ca4acff"},"schema_version":"1.0","source":{"id":"2212.06897","kind":"arxiv","version":2}},"canonical_sha256":"8cc092fafcbee8f37a5b2997afb1fb2a08a065a148c2352decf31d5920edf948","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cc092fafcbee8f37a5b2997afb1fb2a08a065a148c2352decf31d5920edf948","first_computed_at":"2026-07-05T06:44:05.627663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:44:05.627663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k73mtVVBeAR4sbH+TTOAm3qKNXFO/p3nkBifsb6M9kMk/BHkGBF5q8A2asTMKBywOvm4jgBK1dmV2fWZaSiPBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:44:05.628117Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.06897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:667a6950f8acc8a1ebe5741d7b4b934cebfd83c20b150ee79d98f72c313fc073","sha256:9e433d575e9f3ce769d138c63af0defbc48cc77b9391a354cb5f06f2c9a4962c"],"state_sha256":"b21e4884a1d9aa15d462626161cb9c16d48c7706d37c9b7f7732ceda693f6947"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnuUkoAzHs8/e8X8a1tz79yOFSoF7dLWYydbsU0x5nt1GGCuP4m9b2oTaMy+U//J5r2QeNjO68WaY76A1142AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:56:08.710178Z","bundle_sha256":"d5e12659890d38f72e59350de06d16dca25986af94e7e7102aca710ee950567c"}}