{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XTBDFTPPZUT62RLDOABFCTFGOW","short_pith_number":"pith:XTBDFTPP","schema_version":"1.0","canonical_sha256":"bcc232cdefcd27ed45637002514ca675bdbd415374aae96da2c97a82194f18f2","source":{"kind":"arxiv","id":"1609.03934","version":2},"attestation_state":"computed","paper":{"title":"$3$-uniform hypergraphs and linear cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","submitted_at":"2016-09-13T16:55:47Z","abstract_excerpt":"Gy\\'arf\\'as, Gy\\H{o}ri and Simonovits proved that if a $3$-uniform hypergraph with $n$ vertices has no linear cycles, then its independence number $\\alpha \\ge \\frac{2n} {5}$. The hypergraph consisting of vertex disjoint copies of a complete hypergraph $K_5^3$ on five vertices, shows that equality can hold. They asked whether this bound can be improved if we exclude $K_5^3$ as a subhypergraph and whether such a hypergraph is $2$-colorable.\n  In this paper we answer these questions affirmatively. Namely, we prove that if a $3$-uniform linear-cycle-free hypergraph doesn't contain $K_5^3$ as a sub"},"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":"1609.03934","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T16:55:47Z","cross_cats_sorted":[],"title_canon_sha256":"9801b0f11ae7f17426fa7b73f08f0d211044c50c2f3c2044375ad0b4ccfb885a","abstract_canon_sha256":"ea90d046d4897e536976af946a1f6c095c8f1387a45b50e7716a1374ec87002b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.746930Z","signature_b64":"RzdTgC+VTUIdPEkOsJXKtNRWXLST56qRDMNkbDUC6MTpbjeBFHWM0egOZ6Pjht/1uk98Od0T5N9btf84sH4KDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcc232cdefcd27ed45637002514ca675bdbd415374aae96da2c97a82194f18f2","last_reissued_at":"2026-05-18T00:35:51.746307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.746307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$3$-uniform hypergraphs and linear cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","submitted_at":"2016-09-13T16:55:47Z","abstract_excerpt":"Gy\\'arf\\'as, Gy\\H{o}ri and Simonovits proved that if a $3$-uniform hypergraph with $n$ vertices has no linear cycles, then its independence number $\\alpha \\ge \\frac{2n} {5}$. The hypergraph consisting of vertex disjoint copies of a complete hypergraph $K_5^3$ on five vertices, shows that equality can hold. They asked whether this bound can be improved if we exclude $K_5^3$ as a subhypergraph and whether such a hypergraph is $2$-colorable.\n  In this paper we answer these questions affirmatively. Namely, we prove that if a $3$-uniform linear-cycle-free hypergraph doesn't contain $K_5^3$ as a sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03934","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":"1609.03934","created_at":"2026-05-18T00:35:51.746429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03934v2","created_at":"2026-05-18T00:35:51.746429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03934","created_at":"2026-05-18T00:35:51.746429+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTBDFTPPZUT6","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTBDFTPPZUT62RLD","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTBDFTPP","created_at":"2026-05-18T12:30:51.357362+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/XTBDFTPPZUT62RLDOABFCTFGOW","json":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW.json","graph_json":"https://pith.science/api/pith-number/XTBDFTPPZUT62RLDOABFCTFGOW/graph.json","events_json":"https://pith.science/api/pith-number/XTBDFTPPZUT62RLDOABFCTFGOW/events.json","paper":"https://pith.science/paper/XTBDFTPP"},"agent_actions":{"view_html":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW","download_json":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW.json","view_paper":"https://pith.science/paper/XTBDFTPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03934&json=true","fetch_graph":"https://pith.science/api/pith-number/XTBDFTPPZUT62RLDOABFCTFGOW/graph.json","fetch_events":"https://pith.science/api/pith-number/XTBDFTPPZUT62RLDOABFCTFGOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/action/storage_attestation","attest_author":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/action/author_attestation","sign_citation":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/action/citation_signature","submit_replication":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/action/replication_record"}},"created_at":"2026-05-18T00:35:51.746429+00:00","updated_at":"2026-05-18T00:35:51.746429+00:00"}