{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5XUNNSO2CYVMPHXAMY6NRZPD5X","short_pith_number":"pith:5XUNNSO2","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"},"canonical_sha256":"ede8d6c9da162ac79ee0663cd8e5e3eddf81e8b8e657012611ad555ecd2a1474","source":{"kind":"arxiv","id":"1903.04162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04162","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04162v1","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04162","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"5XUNNSO2CYVM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5XUNNSO2CYVMPHXA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5XUNNSO2","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5XUNNSO2CYVMPHXAMY6NRZPD5X","target":"record","payload":{"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"},"canonical_sha256":"ede8d6c9da162ac79ee0663cd8e5e3eddf81e8b8e657012611ad555ecd2a1474","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"},"source_kind":"arxiv","source_id":"1903.04162","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsw+kD+vXJMm878dJkQyKoWAXBiOHDg68554BWzShvzXlXh3a8P8pik3C0ty66fqfwVKM9JYuwY1sDFwQ9PrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:18:41.396035Z"},"content_sha256":"f902f83ecfab00c95987692d612d283229ba33dc1e617b5b6f629c1c6e49278a","schema_version":"1.0","event_id":"sha256:f902f83ecfab00c95987692d612d283229ba33dc1e617b5b6f629c1c6e49278a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5XUNNSO2CYVMPHXAMY6NRZPD5X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZMGNBQHD20nDDW2QC6yr5qdPnLNnJFeHMJHn+8Szwdi/ALdQQSOfcg0VBE70CxxA8ofm4nSu5+eKU8pgKgfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:18:41.396387Z"},"content_sha256":"edf782f640f908f02a3bed5985acc7d59f3b32ecde680d7d5c097ae80855bf6f","schema_version":"1.0","event_id":"sha256:edf782f640f908f02a3bed5985acc7d59f3b32ecde680d7d5c097ae80855bf6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/bundle.json","state_url":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:18:41Z","links":{"resolver":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X","bundle":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/bundle.json","state":"https://pith.science/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XUNNSO2CYVMPHXAMY6NRZPD5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5XUNNSO2CYVMPHXAMY6NRZPD5X","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":"505ab87c7565745d7e4bbc99cb88e9a8560140a171676059f8f7171baf09899c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T08:10:40Z","title_canon_sha256":"9da0a67f2de6aae54aa6cc59db7ad7807060740f0a36411c7897ad54d97d9a00"},"schema_version":"1.0","source":{"id":"1903.04162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04162","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04162v1","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04162","created_at":"2026-05-17T23:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"5XUNNSO2CYVM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5XUNNSO2CYVMPHXA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5XUNNSO2","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:edf782f640f908f02a3bed5985acc7d59f3b32ecde680d7d5c097ae80855bf6f","target":"graph","created_at":"2026-05-17T23:51:36Z","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"},"paper":{"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.","authors_text":"Jun Gao, Xinmin Hou, Yue Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T08:10:40Z","title":"Minimum degree of 3-graphs without long linear paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04162","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:f902f83ecfab00c95987692d612d283229ba33dc1e617b5b6f629c1c6e49278a","target":"record","created_at":"2026-05-17T23:51:36Z","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":"505ab87c7565745d7e4bbc99cb88e9a8560140a171676059f8f7171baf09899c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T08:10:40Z","title_canon_sha256":"9da0a67f2de6aae54aa6cc59db7ad7807060740f0a36411c7897ad54d97d9a00"},"schema_version":"1.0","source":{"id":"1903.04162","kind":"arxiv","version":1}},"canonical_sha256":"ede8d6c9da162ac79ee0663cd8e5e3eddf81e8b8e657012611ad555ecd2a1474","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede8d6c9da162ac79ee0663cd8e5e3eddf81e8b8e657012611ad555ecd2a1474","first_computed_at":"2026-05-17T23:51:36.322963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:36.322963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B5oqgjBCillBd+RTfClOCiYZ6Iev2l76kd3p+dxR9mgKf72Zh8XAcrAsB0xo/qnIQRxeSSjHDp6Q5iwI1cktAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:36.323683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f902f83ecfab00c95987692d612d283229ba33dc1e617b5b6f629c1c6e49278a","sha256:edf782f640f908f02a3bed5985acc7d59f3b32ecde680d7d5c097ae80855bf6f"],"state_sha256":"03335abcb716842754c6aa5925d1959291dda0c00a098df98978a5f6c466992f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65Lk++T4uohXwynu7L4tseRYrzd47YEqJKyTNN/CXt8EAAT1ZWvgqda++KjCMsx7j7uV9yZqS9ovhqXW93AgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:18:41.398437Z","bundle_sha256":"74500a67e9b88c50f3ff5197e40096f6d81a80cfebdeaefc9328e8f44927d771"}}