{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:XPI3CJ4NSIJF3OP7LK4BNQUV3K","short_pith_number":"pith:XPI3CJ4N","canonical_record":{"source":{"id":"2212.14516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-30T02:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"e208b0758d27af09ae017b8827275e84bc710199066432568d6e4304fcba372f","abstract_canon_sha256":"244c329c316291ab007f4caff4487e2e0c7b6e7bd3932a295b94de56955f3c45"},"schema_version":"1.0"},"canonical_sha256":"bbd1b1278d92125db9ff5ab816c295da8cd7efd1274ed2b01c7f34c1ac1af4ab","source":{"kind":"arxiv","id":"2212.14516","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.14516","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"2212.14516v3","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.14516","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"XPI3CJ4NSIJF","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"pith_short_16","alias_value":"XPI3CJ4NSIJF3OP7","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"pith_short_8","alias_value":"XPI3CJ4N","created_at":"2026-07-05T07:50:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:XPI3CJ4NSIJF3OP7LK4BNQUV3K","target":"record","payload":{"canonical_record":{"source":{"id":"2212.14516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-30T02:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"e208b0758d27af09ae017b8827275e84bc710199066432568d6e4304fcba372f","abstract_canon_sha256":"244c329c316291ab007f4caff4487e2e0c7b6e7bd3932a295b94de56955f3c45"},"schema_version":"1.0"},"canonical_sha256":"bbd1b1278d92125db9ff5ab816c295da8cd7efd1274ed2b01c7f34c1ac1af4ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:18.681842Z","signature_b64":"0bacsw2f2YJEmgRUmJuwdW71NUHXOXaUyoPOwHb4Fn6DCnHpMNh1MLc9N1pdfv/142qVIkrJwlnTsenrLqCBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd1b1278d92125db9ff5ab816c295da8cd7efd1274ed2b01c7f34c1ac1af4ab","last_reissued_at":"2026-07-05T07:50:18.681259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:18.681259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.14516","source_version":3,"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-05T07:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wSAxDpoRyje7a5DHoJV+kyylDeE/n2Pr/1DXYE3kEmGx+AzcCq9ThyDu/uKUXRLO9ZWsIJzoqMZdeyNbmMsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:03:13.564118Z"},"content_sha256":"e038ba273d1ea63ad4cd85a04beeaeb95a6b3562dbf1dbd4016fbac4c3718c98","schema_version":"1.0","event_id":"sha256:e038ba273d1ea63ad4cd85a04beeaeb95a6b3562dbf1dbd4016fbac4c3718c98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:XPI3CJ4NSIJF3OP7LK4BNQUV3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Grace McCourt, Ruth Luo","submitted_at":"2022-12-30T02:05:08Z","abstract_excerpt":"Dirac proved that each $n$-vertex $2$-connected graph with minimum degree at least $k$ contains a cycle of length at least $\\min\\{2k, n\\}$. We consider a hypergraph version of this result. A Berge cycle in a hypergraph is an alternating sequence of distinct vertices and edges $v_1,e_2,v_2, \\ldots, e_c, v_1$ such that $\\{v_i,v_{i+1}\\} \\subseteq e_i$ for all $i$ (with indices taken modulo $c$). We prove that for $n \\geq k \\geq r+2 \\geq 5$, every $2$-connected $r$-uniform $n$-vertex hypergraph with minimum degree at least ${k-1 \\choose r-1} + 1$ has a Berge cycle of length at least $\\min\\{2k, n\\}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.14516","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.14516/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-05T07:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9Itw4hlqDB2DsiBI1WMkOfUlL5CFyc48jydrdZWO98EONH8KCdgDJTz84F9bNUZaXJOsZTsMAxMHFlRz7K5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:03:13.564508Z"},"content_sha256":"084d031ab94c1445a4785129d688734448fd1a86dbd3e6cf938fc3a064f13780","schema_version":"1.0","event_id":"sha256:084d031ab94c1445a4785129d688734448fd1a86dbd3e6cf938fc3a064f13780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPI3CJ4NSIJF3OP7LK4BNQUV3K/bundle.json","state_url":"https://pith.science/pith/XPI3CJ4NSIJF3OP7LK4BNQUV3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPI3CJ4NSIJF3OP7LK4BNQUV3K/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-07T10:03:13Z","links":{"resolver":"https://pith.science/pith/XPI3CJ4NSIJF3OP7LK4BNQUV3K","bundle":"https://pith.science/pith/XPI3CJ4NSIJF3OP7LK4BNQUV3K/bundle.json","state":"https://pith.science/pith/XPI3CJ4NSIJF3OP7LK4BNQUV3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPI3CJ4NSIJF3OP7LK4BNQUV3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XPI3CJ4NSIJF3OP7LK4BNQUV3K","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":"244c329c316291ab007f4caff4487e2e0c7b6e7bd3932a295b94de56955f3c45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-30T02:05:08Z","title_canon_sha256":"e208b0758d27af09ae017b8827275e84bc710199066432568d6e4304fcba372f"},"schema_version":"1.0","source":{"id":"2212.14516","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.14516","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"2212.14516v3","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.14516","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"XPI3CJ4NSIJF","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"pith_short_16","alias_value":"XPI3CJ4NSIJF3OP7","created_at":"2026-07-05T07:50:18Z"},{"alias_kind":"pith_short_8","alias_value":"XPI3CJ4N","created_at":"2026-07-05T07:50:18Z"}],"graph_snapshots":[{"event_id":"sha256:084d031ab94c1445a4785129d688734448fd1a86dbd3e6cf938fc3a064f13780","target":"graph","created_at":"2026-07-05T07:50:18Z","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.14516/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dirac proved that each $n$-vertex $2$-connected graph with minimum degree at least $k$ contains a cycle of length at least $\\min\\{2k, n\\}$. We consider a hypergraph version of this result. A Berge cycle in a hypergraph is an alternating sequence of distinct vertices and edges $v_1,e_2,v_2, \\ldots, e_c, v_1$ such that $\\{v_i,v_{i+1}\\} \\subseteq e_i$ for all $i$ (with indices taken modulo $c$). We prove that for $n \\geq k \\geq r+2 \\geq 5$, every $2$-connected $r$-uniform $n$-vertex hypergraph with minimum degree at least ${k-1 \\choose r-1} + 1$ has a Berge cycle of length at least $\\min\\{2k, n\\}","authors_text":"Alexandr Kostochka, Grace McCourt, Ruth Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-30T02:05:08Z","title":"A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.14516","kind":"arxiv","version":3},"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:e038ba273d1ea63ad4cd85a04beeaeb95a6b3562dbf1dbd4016fbac4c3718c98","target":"record","created_at":"2026-07-05T07:50:18Z","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":"244c329c316291ab007f4caff4487e2e0c7b6e7bd3932a295b94de56955f3c45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-12-30T02:05:08Z","title_canon_sha256":"e208b0758d27af09ae017b8827275e84bc710199066432568d6e4304fcba372f"},"schema_version":"1.0","source":{"id":"2212.14516","kind":"arxiv","version":3}},"canonical_sha256":"bbd1b1278d92125db9ff5ab816c295da8cd7efd1274ed2b01c7f34c1ac1af4ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbd1b1278d92125db9ff5ab816c295da8cd7efd1274ed2b01c7f34c1ac1af4ab","first_computed_at":"2026-07-05T07:50:18.681259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:18.681259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0bacsw2f2YJEmgRUmJuwdW71NUHXOXaUyoPOwHb4Fn6DCnHpMNh1MLc9N1pdfv/142qVIkrJwlnTsenrLqCBAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:18.681842Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.14516","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e038ba273d1ea63ad4cd85a04beeaeb95a6b3562dbf1dbd4016fbac4c3718c98","sha256:084d031ab94c1445a4785129d688734448fd1a86dbd3e6cf938fc3a064f13780"],"state_sha256":"6e33e5500e0059d4095836031ccb7d9047c3f654623e3bdd5070136a19d23d56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z29URwtjx7k1XWUo0YRpk3fAC6TrAfKGq7NMZIrwwyoRe38BTczEOtoxq+wxE+WgEFRQ7aymEiIfnowM3kEtCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:03:13.566544Z","bundle_sha256":"12d47b6976fb0c8ba68f5686091ea91b5d456f50b6d17c70fba55ce1eff4c3ce"}}