{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RHMXRBSWLMGA3CEOZHT4DHP2IL","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":"64a22e9437ccc0f2ad463489dfdaa26bb22f3743ad06ac9ecb9e0d7f65190865","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-29T17:21:13Z","title_canon_sha256":"58e011222095f2eadfce7179f5268ccb091f0d7bb78f088230e6c777e375ffca"},"schema_version":"1.0","source":{"id":"2207.14794","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.14794","created_at":"2026-07-05T06:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"2207.14794v3","created_at":"2026-07-05T06:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.14794","created_at":"2026-07-05T06:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"RHMXRBSWLMGA","created_at":"2026-07-05T06:30:42Z"},{"alias_kind":"pith_short_16","alias_value":"RHMXRBSWLMGA3CEO","created_at":"2026-07-05T06:30:42Z"},{"alias_kind":"pith_short_8","alias_value":"RHMXRBSW","created_at":"2026-07-05T06:30:42Z"}],"graph_snapshots":[{"event_id":"sha256:266e1c8ff8b614abb84cd3c56dcb370b6a58f32f264e6ec8ffccfe359c7ac770","target":"graph","created_at":"2026-07-05T06:30:42Z","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/2207.14794/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A hypergraph $H$ is hamiltonian-connected if for any distinct vertices $x$ and $y$, $H$ contains a hamiltonian Berge path from $x$ to $y$. We find for all $3\\leq r<n$, exact lower bounds on minimum degree $\\delta(n,r)$ of an $n$-vertex $r$-uniform hypergraph $H$ guaranteeing that $H$ is hamiltonian-connected. It turns out that for $3\\leq n/2<r<n$, $\\delta(n,r)$ is 1 less than the degree bound guaranteeing the existence of a hamiltonian Berge cycle. Moreover, unlike for graphs, for each $r \\geq 3$ there exists an $r$-uniform hypergraph that is hamiltonian-connected but does not contain a hamilt","authors_text":"Alexandr Kostochka, Grace McCourt, Ruth Luo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-29T17:21:13Z","title":"Minimum degree ensuring that a hypergraph is hamiltonian-connected"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.14794","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:9f353531146a6064fd9ed336b96b486c345ff26c8a366731eaec8d5bb218d95f","target":"record","created_at":"2026-07-05T06:30:42Z","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":"64a22e9437ccc0f2ad463489dfdaa26bb22f3743ad06ac9ecb9e0d7f65190865","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-29T17:21:13Z","title_canon_sha256":"58e011222095f2eadfce7179f5268ccb091f0d7bb78f088230e6c777e375ffca"},"schema_version":"1.0","source":{"id":"2207.14794","kind":"arxiv","version":3}},"canonical_sha256":"89d97886565b0c0d888ec9e7c19dfa42da04a814374e8208f3ae33021759f68f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89d97886565b0c0d888ec9e7c19dfa42da04a814374e8208f3ae33021759f68f","first_computed_at":"2026-07-05T06:30:42.165176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:30:42.165176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Enu8atKq7ozr4DyGz/LGMtagmz37EUHjOFWRS1Efep/dy+lXzPYjthl6ElMIIgpCXtSNoXLtFM7QBKsUkD8Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:30:42.165637Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.14794","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f353531146a6064fd9ed336b96b486c345ff26c8a366731eaec8d5bb218d95f","sha256:266e1c8ff8b614abb84cd3c56dcb370b6a58f32f264e6ec8ffccfe359c7ac770"],"state_sha256":"fdd29e032751f24420b98dcd5bdc176ac546e706e3aff02c4c470058d961ce64"}