{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RHMXRBSWLMGA3CEOZHT4DHP2IL","short_pith_number":"pith:RHMXRBSW","schema_version":"1.0","canonical_sha256":"89d97886565b0c0d888ec9e7c19dfa42da04a814374e8208f3ae33021759f68f","source":{"kind":"arxiv","id":"2207.14794","version":3},"attestation_state":"computed","paper":{"title":"Minimum degree ensuring that a hypergraph is hamiltonian-connected","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Grace McCourt, Ruth Luo","submitted_at":"2022-07-29T17:21:13Z","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"},"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":"2207.14794","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-07-29T17:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"58e011222095f2eadfce7179f5268ccb091f0d7bb78f088230e6c777e375ffca","abstract_canon_sha256":"64a22e9437ccc0f2ad463489dfdaa26bb22f3743ad06ac9ecb9e0d7f65190865"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:42.165637Z","signature_b64":"6Enu8atKq7ozr4DyGz/LGMtagmz37EUHjOFWRS1Efep/dy+lXzPYjthl6ElMIIgpCXtSNoXLtFM7QBKsUkD8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89d97886565b0c0d888ec9e7c19dfa42da04a814374e8208f3ae33021759f68f","last_reissued_at":"2026-07-05T06:30:42.165176Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:42.165176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree ensuring that a hypergraph is hamiltonian-connected","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Grace McCourt, Ruth Luo","submitted_at":"2022-07-29T17:21:13Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.14794","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/2207.14794/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":"2207.14794","created_at":"2026-07-05T06:30:42.165231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.14794v3","created_at":"2026-07-05T06:30:42.165231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.14794","created_at":"2026-07-05T06:30:42.165231+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHMXRBSWLMGA","created_at":"2026-07-05T06:30:42.165231+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHMXRBSWLMGA3CEO","created_at":"2026-07-05T06:30:42.165231+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHMXRBSW","created_at":"2026-07-05T06:30:42.165231+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/RHMXRBSWLMGA3CEOZHT4DHP2IL","json":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL.json","graph_json":"https://pith.science/api/pith-number/RHMXRBSWLMGA3CEOZHT4DHP2IL/graph.json","events_json":"https://pith.science/api/pith-number/RHMXRBSWLMGA3CEOZHT4DHP2IL/events.json","paper":"https://pith.science/paper/RHMXRBSW"},"agent_actions":{"view_html":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL","download_json":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL.json","view_paper":"https://pith.science/paper/RHMXRBSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.14794&json=true","fetch_graph":"https://pith.science/api/pith-number/RHMXRBSWLMGA3CEOZHT4DHP2IL/graph.json","fetch_events":"https://pith.science/api/pith-number/RHMXRBSWLMGA3CEOZHT4DHP2IL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL/action/storage_attestation","attest_author":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL/action/author_attestation","sign_citation":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL/action/citation_signature","submit_replication":"https://pith.science/pith/RHMXRBSWLMGA3CEOZHT4DHP2IL/action/replication_record"}},"created_at":"2026-07-05T06:30:42.165231+00:00","updated_at":"2026-07-05T06:30:42.165231+00:00"}