{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5XUNNSO2CYVMPHXAMY6NRZPD5X","short_pith_number":"pith:5XUNNSO2","schema_version":"1.0","canonical_sha256":"ede8d6c9da162ac79ee0663cd8e5e3eddf81e8b8e657012611ad555ecd2a1474","source":{"kind":"arxiv","id":"1903.04162","version":1},"attestation_state":"computed","paper":{"title":"Minimum degree of 3-graphs without long linear paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Gao, Xinmin Hou, Yue Ma","submitted_at":"2019-03-11T08:10:40Z","abstract_excerpt":"A well known theorem in graph theory states that every graph $G$ on $n$ vertices and minimum degree at least $d$ contains a path of length at least $d$, and if $G$ is connected and $n\\ge 2d+1$ then $G$ contains a path of length at least $2d$ (Dirac, 1952). In this article, we give an extension of Dirac's result to hypergraphs. We determine asymptotic lower bounds of the minimum degrees of 3-graphs to guarantee linear paths of specific lengths, and the lower bounds are tight up to a constant."},"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":"1903.04162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T08:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"9da0a67f2de6aae54aa6cc59db7ad7807060740f0a36411c7897ad54d97d9a00","abstract_canon_sha256":"505ab87c7565745d7e4bbc99cb88e9a8560140a171676059f8f7171baf09899c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:36.323683Z","signature_b64":"B5oqgjBCillBd+RTfClOCiYZ6Iev2l76kd3p+dxR9mgKf72Zh8XAcrAsB0xo/qnIQRxeSSjHDp6Q5iwI1cktAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede8d6c9da162ac79ee0663cd8e5e3eddf81e8b8e657012611ad555ecd2a1474","last_reissued_at":"2026-05-17T23:51:36.322963Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:36.322963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree of 3-graphs without long linear paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Gao, Xinmin Hou, Yue Ma","submitted_at":"2019-03-11T08:10:40Z","abstract_excerpt":"A well known theorem in graph theory states that every graph $G$ on $n$ vertices and minimum degree at least $d$ contains a path of length at least $d$, and if $G$ is connected and $n\\ge 2d+1$ then $G$ contains a path of length at least $2d$ (Dirac, 1952). In this article, we give an extension of Dirac's result to hypergraphs. We determine asymptotic lower bounds of the minimum degrees of 3-graphs to guarantee linear paths of specific lengths, and the lower bounds are tight up to a constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04162","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":"1903.04162","created_at":"2026-05-17T23:51:36.323078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04162v1","created_at":"2026-05-17T23:51:36.323078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04162","created_at":"2026-05-17T23:51:36.323078+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XUNNSO2CYVM","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XUNNSO2CYVMPHXA","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XUNNSO2","created_at":"2026-05-18T12:33:10.108867+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/5XUNNSO2CYVMPHXAMY6NRZPD5X","json":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X.json","graph_json":"https://pith.science/api/pith-number/5XUNNSO2CYVMPHXAMY6NRZPD5X/graph.json","events_json":"https://pith.science/api/pith-number/5XUNNSO2CYVMPHXAMY6NRZPD5X/events.json","paper":"https://pith.science/paper/5XUNNSO2"},"agent_actions":{"view_html":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X","download_json":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X.json","view_paper":"https://pith.science/paper/5XUNNSO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04162&json=true","fetch_graph":"https://pith.science/api/pith-number/5XUNNSO2CYVMPHXAMY6NRZPD5X/graph.json","fetch_events":"https://pith.science/api/pith-number/5XUNNSO2CYVMPHXAMY6NRZPD5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/action/storage_attestation","attest_author":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/action/author_attestation","sign_citation":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/action/citation_signature","submit_replication":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/action/replication_record"}},"created_at":"2026-05-17T23:51:36.323078+00:00","updated_at":"2026-05-17T23:51:36.323078+00:00"}