{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:H33PPWP7KMUMZ2ZAKIX5WSGV5S","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":"9dec9b1f8f96c1c918ac3278f701f5c2fd212a8576bf475399268041977b3ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-17T15:00:12Z","title_canon_sha256":"2481f1beb1f27436bd3411d9fb1bac71247dc6940584190616ca6c62355e7db7"},"schema_version":"1.0","source":{"id":"2004.08291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08291","created_at":"2026-07-05T00:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08291v1","created_at":"2026-07-05T00:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08291","created_at":"2026-07-05T00:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"H33PPWP7KMUM","created_at":"2026-07-05T00:55:51Z"},{"alias_kind":"pith_short_16","alias_value":"H33PPWP7KMUMZ2ZA","created_at":"2026-07-05T00:55:51Z"},{"alias_kind":"pith_short_8","alias_value":"H33PPWP7","created_at":"2026-07-05T00:55:51Z"}],"graph_snapshots":[{"event_id":"sha256:f9af6ebdb1b4453e44a62939463c3216fd18a1515cb1ff739b2690120dfadaa9","target":"graph","created_at":"2026-07-05T00:55:51Z","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/2004.08291/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every $3$-connected hypergraph $H$ with $ \\delta(H)\\geq \\max\\{|V(H)|, \\frac{|E(H)|+10}{4}\\}$ has a hamiltonian Berge cycle.\n  This is sharp and refines a conjecture by Jackson from 1981 (in the language of bipartite graphs). Our proofs are in the language of bipartite graphs, since the incidence graph of each hypergraph is bipartite.","authors_text":"Alexandr Kostochka, Dara Zirlin, Mikhail Lavrov, Ruth Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-17T15:00:12Z","title":"Longest cycles in 3-connected hypergraphs and bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08291","kind":"arxiv","version":1},"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:f6a847f3ee8c02cbd077bd35c525136e86f239d625799fa77d5cb3db665a2bea","target":"record","created_at":"2026-07-05T00:55:51Z","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":"9dec9b1f8f96c1c918ac3278f701f5c2fd212a8576bf475399268041977b3ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-17T15:00:12Z","title_canon_sha256":"2481f1beb1f27436bd3411d9fb1bac71247dc6940584190616ca6c62355e7db7"},"schema_version":"1.0","source":{"id":"2004.08291","kind":"arxiv","version":1}},"canonical_sha256":"3ef6f7d9ff5328cceb20522fdb48d5ec88cb4b118560f93cdc392afe8ea5e0b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ef6f7d9ff5328cceb20522fdb48d5ec88cb4b118560f93cdc392afe8ea5e0b9","first_computed_at":"2026-07-05T00:55:51.875763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:51.875763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"26d0PtH8DsD44pWWLhSgx6j6mhv/t5/jey9mOj0RFGXMlTn7oaRNBJwPup0gCC7hXd+ghDjNDs7CgVnQRTp5DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:51.876258Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.08291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6a847f3ee8c02cbd077bd35c525136e86f239d625799fa77d5cb3db665a2bea","sha256:f9af6ebdb1b4453e44a62939463c3216fd18a1515cb1ff739b2690120dfadaa9"],"state_sha256":"fbf588299f1588a1507b33ebcb15dd647e9886b326fbf333fb7f197771d10e97"}