{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W2QRY2YDLVOHTLBLA46ZH56P24","short_pith_number":"pith:W2QRY2YD","schema_version":"1.0","canonical_sha256":"b6a11c6b035d5c79ac2b073d93f7cfd715de3adcdb9d49c1b607a89781430f95","source":{"kind":"arxiv","id":"1608.03241","version":2},"attestation_state":"computed","paper":{"title":"An Erd\\H{o}s-Gallai type theorem for uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Akbar Davoodi, Casey Tompkins, Ervin Gy\\H{o}ri","submitted_at":"2016-08-10T17:48:01Z","abstract_excerpt":"A well-known theorem of Erd\\H{o}s and Gallai asserts that a graph with no path of length $k$ contains at most $\\frac{1}{2}(k-1)n$ edges. Recently Gy\\H{o}ri, Katona and Lemons gave an extension of this result to hypergraphs by determining the maximum number of hyperedges in an $r$-uniform hypergraph containing no Berge path of length $k$ for all values of $r$ and $k$ except for $k=r+1$. We settle the remaining case by proving that an $r$-uniform hypergraph with more than $n$ hyperedges must contain a Berge path of length $r+1$."},"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":"1608.03241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-10T17:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"acd990e60417180db21f24ece8987d23cdd4bb5e39f8ffad045c5102df0371d1","abstract_canon_sha256":"63539be5b10834e57ff37d8ce8094ab0b60b1866723113164b65c8430c95be22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:17.550637Z","signature_b64":"vz78+Ktfv/cM5+681+zhuOqQu0yNflmvrRhfpAUehk55tPPta8bZsxyT+zqJE3iFHcgBT7IpGLQHPQyKxQY5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6a11c6b035d5c79ac2b073d93f7cfd715de3adcdb9d49c1b607a89781430f95","last_reissued_at":"2026-05-18T00:30:17.549974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:17.549974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Erd\\H{o}s-Gallai type theorem for uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Akbar Davoodi, Casey Tompkins, Ervin Gy\\H{o}ri","submitted_at":"2016-08-10T17:48:01Z","abstract_excerpt":"A well-known theorem of Erd\\H{o}s and Gallai asserts that a graph with no path of length $k$ contains at most $\\frac{1}{2}(k-1)n$ edges. Recently Gy\\H{o}ri, Katona and Lemons gave an extension of this result to hypergraphs by determining the maximum number of hyperedges in an $r$-uniform hypergraph containing no Berge path of length $k$ for all values of $r$ and $k$ except for $k=r+1$. We settle the remaining case by proving that an $r$-uniform hypergraph with more than $n$ hyperedges must contain a Berge path of length $r+1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03241","kind":"arxiv","version":2},"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":"1608.03241","created_at":"2026-05-18T00:30:17.550066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03241v2","created_at":"2026-05-18T00:30:17.550066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03241","created_at":"2026-05-18T00:30:17.550066+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2QRY2YDLVOH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2QRY2YDLVOHTLBL","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2QRY2YD","created_at":"2026-05-18T12:30:48.956258+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/W2QRY2YDLVOHTLBLA46ZH56P24","json":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24.json","graph_json":"https://pith.science/api/pith-number/W2QRY2YDLVOHTLBLA46ZH56P24/graph.json","events_json":"https://pith.science/api/pith-number/W2QRY2YDLVOHTLBLA46ZH56P24/events.json","paper":"https://pith.science/paper/W2QRY2YD"},"agent_actions":{"view_html":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24","download_json":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24.json","view_paper":"https://pith.science/paper/W2QRY2YD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03241&json=true","fetch_graph":"https://pith.science/api/pith-number/W2QRY2YDLVOHTLBLA46ZH56P24/graph.json","fetch_events":"https://pith.science/api/pith-number/W2QRY2YDLVOHTLBLA46ZH56P24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24/action/storage_attestation","attest_author":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24/action/author_attestation","sign_citation":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24/action/citation_signature","submit_replication":"https://pith.science/pith/W2QRY2YDLVOHTLBLA46ZH56P24/action/replication_record"}},"created_at":"2026-05-18T00:30:17.550066+00:00","updated_at":"2026-05-18T00:30:17.550066+00:00"}