{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WK2APFZUYIEXAFW4REF5TM5ZGD","short_pith_number":"pith:WK2APFZU","canonical_record":{"source":{"id":"2109.12637","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-26T15:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"638f9b19afd8f232cebf4690ac1c158dff7d060f030c7acf563075c8b8e39cb9","abstract_canon_sha256":"6ced735b3913a45c468718ccd47004008a8f5d8520ec0562673451a640e34bdd"},"schema_version":"1.0"},"canonical_sha256":"b2b4079734c2097016dc890bd9b3b930cf912c144568897bca1977b7a1d36082","source":{"kind":"arxiv","id":"2109.12637","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12637","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12637v3","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12637","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"pith_short_12","alias_value":"WK2APFZUYIEX","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"pith_short_16","alias_value":"WK2APFZUYIEXAFW4","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"pith_short_8","alias_value":"WK2APFZU","created_at":"2026-07-05T05:13:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WK2APFZUYIEXAFW4REF5TM5ZGD","target":"record","payload":{"canonical_record":{"source":{"id":"2109.12637","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-26T15:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"638f9b19afd8f232cebf4690ac1c158dff7d060f030c7acf563075c8b8e39cb9","abstract_canon_sha256":"6ced735b3913a45c468718ccd47004008a8f5d8520ec0562673451a640e34bdd"},"schema_version":"1.0"},"canonical_sha256":"b2b4079734c2097016dc890bd9b3b930cf912c144568897bca1977b7a1d36082","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:18.206390Z","signature_b64":"zb8sDGGXNoOOcYm2Mb9kZ5j8KkLj8c5GRwl9hJKtUppRRuYpD0FtOVx2747srggbe1MDSr+yMdcB4jBluptSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2b4079734c2097016dc890bd9b3b930cf912c144568897bca1977b7a1d36082","last_reissued_at":"2026-07-05T05:13:18.205999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:18.205999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.12637","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-05T05:13:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++/NMU1ft8uukV0ScsR90y+nDe6zLzBIi0xzcW7lU/RayP3oiZMuXiDHbaUItg8sBg+it4/lPhZZx+0avYR5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:53:11.860435Z"},"content_sha256":"3b1f62b2f62db14927095fd27df2ba0af48486739ccf296cbeee36cb1a195370","schema_version":"1.0","event_id":"sha256:3b1f62b2f62db14927095fd27df2ba0af48486739ccf296cbeee36cb1a195370"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WK2APFZUYIEXAFW4REF5TM5ZGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs","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":"2021-09-26T15:48:04Z","abstract_excerpt":"The famous Dirac's Theorem gives an exact bound on the minimum degree of an $n$-vertex graph guaranteeing the existence of a hamiltonian cycle. We prove exact bounds of similar type for hamiltonian Berge cycles in $r$-uniform, $n$-vertex hypergraphs for all $3\\leq r< n$. The bounds are different for $r<n/2$ and $r\\geq n/2$. We also give bounds on the minimum degree guaranteeing existence of Berge cycles of length at least $k$ in such hypergraphs; the bounds are exact for all $k\\geq n/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12637","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/2109.12637/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-05T05:13:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bthPL04MMWJMNjscCic6OtjpuPNdikyvxqyC1JZb4UuPnmDW83uyRlRSd537q03yZRfRwUobn134Q4Rbsi8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:53:11.860806Z"},"content_sha256":"2585186e5cf94fb7c958bf9b278a32c7ca8383ebda8738743bd99eb89095adb2","schema_version":"1.0","event_id":"sha256:2585186e5cf94fb7c958bf9b278a32c7ca8383ebda8738743bd99eb89095adb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/bundle.json","state_url":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/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-06T12:53:11Z","links":{"resolver":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD","bundle":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/bundle.json","state":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WK2APFZUYIEXAFW4REF5TM5ZGD","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":"6ced735b3913a45c468718ccd47004008a8f5d8520ec0562673451a640e34bdd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-26T15:48:04Z","title_canon_sha256":"638f9b19afd8f232cebf4690ac1c158dff7d060f030c7acf563075c8b8e39cb9"},"schema_version":"1.0","source":{"id":"2109.12637","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12637","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12637v3","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12637","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"pith_short_12","alias_value":"WK2APFZUYIEX","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"pith_short_16","alias_value":"WK2APFZUYIEXAFW4","created_at":"2026-07-05T05:13:18Z"},{"alias_kind":"pith_short_8","alias_value":"WK2APFZU","created_at":"2026-07-05T05:13:18Z"}],"graph_snapshots":[{"event_id":"sha256:2585186e5cf94fb7c958bf9b278a32c7ca8383ebda8738743bd99eb89095adb2","target":"graph","created_at":"2026-07-05T05:13: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/2109.12637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The famous Dirac's Theorem gives an exact bound on the minimum degree of an $n$-vertex graph guaranteeing the existence of a hamiltonian cycle. We prove exact bounds of similar type for hamiltonian Berge cycles in $r$-uniform, $n$-vertex hypergraphs for all $3\\leq r< n$. The bounds are different for $r<n/2$ and $r\\geq n/2$. We also give bounds on the minimum degree guaranteeing existence of Berge cycles of length at least $k$ in such hypergraphs; the bounds are exact for all $k\\geq n/2$.","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":"2021-09-26T15:48:04Z","title":"Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12637","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:3b1f62b2f62db14927095fd27df2ba0af48486739ccf296cbeee36cb1a195370","target":"record","created_at":"2026-07-05T05:13: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":"6ced735b3913a45c468718ccd47004008a8f5d8520ec0562673451a640e34bdd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-26T15:48:04Z","title_canon_sha256":"638f9b19afd8f232cebf4690ac1c158dff7d060f030c7acf563075c8b8e39cb9"},"schema_version":"1.0","source":{"id":"2109.12637","kind":"arxiv","version":3}},"canonical_sha256":"b2b4079734c2097016dc890bd9b3b930cf912c144568897bca1977b7a1d36082","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2b4079734c2097016dc890bd9b3b930cf912c144568897bca1977b7a1d36082","first_computed_at":"2026-07-05T05:13:18.205999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:13:18.205999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zb8sDGGXNoOOcYm2Mb9kZ5j8KkLj8c5GRwl9hJKtUppRRuYpD0FtOVx2747srggbe1MDSr+yMdcB4jBluptSAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:13:18.206390Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.12637","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b1f62b2f62db14927095fd27df2ba0af48486739ccf296cbeee36cb1a195370","sha256:2585186e5cf94fb7c958bf9b278a32c7ca8383ebda8738743bd99eb89095adb2"],"state_sha256":"eb06eee880ed1f52a1f57ee0d041b46b38d81db0e5a5abbe418f861e0c0f3853"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTYKcZLt2msBS52QnRhKF0zbYMmZP8+jDhCJUiuwsx2hWfWei3pAeyQxkC9hX4k4D4dGccbiu09droRAhz1VBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T12:53:11.862753Z","bundle_sha256":"1f613a4308d31f08e68858c3baa85b738fdc8853720525afde9e21abfc262926"}}