{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AH4UWSSDV7NJD2T7WQNGXGHDNK","short_pith_number":"pith:AH4UWSSD","schema_version":"1.0","canonical_sha256":"01f94b4a43afda91ea7fb41a6b98e36a979ccb0d8e7cd6f31d8ef907b86e54a8","source":{"kind":"arxiv","id":"1905.03758","version":1},"attestation_state":"computed","paper":{"title":"Super-pancyclic hypergraphs and bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dara Zirlin, Ruth Luo","submitted_at":"2019-05-09T17:15:18Z","abstract_excerpt":"We find Dirac-type sufficient conditions for a hypergraph $\\mathcal H$ with few edges to be hamiltonian. We also show that these conditions provide that $\\mathcal H$ is {\\em super-pancyclic}, i.e., for each $A \\subseteq V(\\mathcal H)$ with $|A| \\geq 3$, $\\mathcal H$ contains a Berge cycle with vertex set $A$.\n  We mostly use the language of bipartite graphs, because every bipartite graph is the incidence graph of a multihypergraph. In particular, we extend some results of Jackson on the existence of long cycles in bipartite graphs where the vertices in one part have high minimum degree. Furthe"},"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":"1905.03758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-09T17:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"c309b2669a6aaae025e0fb334e9c254fc02074a6e7db19930142d3f1767419c6","abstract_canon_sha256":"c957cedb817c8b193d097a2abad36250a1aab9233aeca26cb09f6a9334251690"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:36.761376Z","signature_b64":"V7vOkI4ntk5fLFp6Z6lLRzyw/uW32zvrKg1AoffAPGVH4JZnF9pEQLtnIC0Dz9C3QMpeyGOcO2RUvQeo6NbSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f94b4a43afda91ea7fb41a6b98e36a979ccb0d8e7cd6f31d8ef907b86e54a8","last_reissued_at":"2026-05-17T23:46:36.760944Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:36.760944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-pancyclic hypergraphs and bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dara Zirlin, Ruth Luo","submitted_at":"2019-05-09T17:15:18Z","abstract_excerpt":"We find Dirac-type sufficient conditions for a hypergraph $\\mathcal H$ with few edges to be hamiltonian. We also show that these conditions provide that $\\mathcal H$ is {\\em super-pancyclic}, i.e., for each $A \\subseteq V(\\mathcal H)$ with $|A| \\geq 3$, $\\mathcal H$ contains a Berge cycle with vertex set $A$.\n  We mostly use the language of bipartite graphs, because every bipartite graph is the incidence graph of a multihypergraph. In particular, we extend some results of Jackson on the existence of long cycles in bipartite graphs where the vertices in one part have high minimum degree. Furthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03758","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1905.03758","created_at":"2026-05-17T23:46:36.761000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03758v1","created_at":"2026-05-17T23:46:36.761000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03758","created_at":"2026-05-17T23:46:36.761000+00:00"},{"alias_kind":"pith_short_12","alias_value":"AH4UWSSDV7NJ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AH4UWSSDV7NJD2T7","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AH4UWSSD","created_at":"2026-05-18T12:33:12.712433+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/AH4UWSSDV7NJD2T7WQNGXGHDNK","json":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK.json","graph_json":"https://pith.science/api/pith-number/AH4UWSSDV7NJD2T7WQNGXGHDNK/graph.json","events_json":"https://pith.science/api/pith-number/AH4UWSSDV7NJD2T7WQNGXGHDNK/events.json","paper":"https://pith.science/paper/AH4UWSSD"},"agent_actions":{"view_html":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK","download_json":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK.json","view_paper":"https://pith.science/paper/AH4UWSSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03758&json=true","fetch_graph":"https://pith.science/api/pith-number/AH4UWSSDV7NJD2T7WQNGXGHDNK/graph.json","fetch_events":"https://pith.science/api/pith-number/AH4UWSSDV7NJD2T7WQNGXGHDNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK/action/storage_attestation","attest_author":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK/action/author_attestation","sign_citation":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK/action/citation_signature","submit_replication":"https://pith.science/pith/AH4UWSSDV7NJD2T7WQNGXGHDNK/action/replication_record"}},"created_at":"2026-05-17T23:46:36.761000+00:00","updated_at":"2026-05-17T23:46:36.761000+00:00"}