{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WK2APFZUYIEXAFW4REF5TM5ZGD","short_pith_number":"pith:WK2APFZU","schema_version":"1.0","canonical_sha256":"b2b4079734c2097016dc890bd9b3b930cf912c144568897bca1977b7a1d36082","source":{"kind":"arxiv","id":"2109.12637","version":3},"attestation_state":"computed","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$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2109.12637","created_at":"2026-07-05T05:13:18.206055+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.12637v3","created_at":"2026-07-05T05:13:18.206055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12637","created_at":"2026-07-05T05:13:18.206055+00:00"},{"alias_kind":"pith_short_12","alias_value":"WK2APFZUYIEX","created_at":"2026-07-05T05:13:18.206055+00:00"},{"alias_kind":"pith_short_16","alias_value":"WK2APFZUYIEXAFW4","created_at":"2026-07-05T05:13:18.206055+00:00"},{"alias_kind":"pith_short_8","alias_value":"WK2APFZU","created_at":"2026-07-05T05:13:18.206055+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD","json":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD.json","graph_json":"https://pith.science/api/pith-number/WK2APFZUYIEXAFW4REF5TM5ZGD/graph.json","events_json":"https://pith.science/api/pith-number/WK2APFZUYIEXAFW4REF5TM5ZGD/events.json","paper":"https://pith.science/paper/WK2APFZU"},"agent_actions":{"view_html":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD","download_json":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD.json","view_paper":"https://pith.science/paper/WK2APFZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.12637&json=true","fetch_graph":"https://pith.science/api/pith-number/WK2APFZUYIEXAFW4REF5TM5ZGD/graph.json","fetch_events":"https://pith.science/api/pith-number/WK2APFZUYIEXAFW4REF5TM5ZGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/action/storage_attestation","attest_author":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/action/author_attestation","sign_citation":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/action/citation_signature","submit_replication":"https://pith.science/pith/WK2APFZUYIEXAFW4REF5TM5ZGD/action/replication_record"}},"created_at":"2026-07-05T05:13:18.206055+00:00","updated_at":"2026-07-05T05:13:18.206055+00:00"}