{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XTBDFTPPZUT62RLDOABFCTFGOW","short_pith_number":"pith:XTBDFTPP","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"},"canonical_sha256":"bcc232cdefcd27ed45637002514ca675bdbd415374aae96da2c97a82194f18f2","source":{"kind":"arxiv","id":"1609.03934","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03934","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03934v2","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03934","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"XTBDFTPPZUT6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XTBDFTPPZUT62RLD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XTBDFTPP","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XTBDFTPPZUT62RLDOABFCTFGOW","target":"record","payload":{"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"},"canonical_sha256":"bcc232cdefcd27ed45637002514ca675bdbd415374aae96da2c97a82194f18f2","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"},"source_kind":"arxiv","source_id":"1609.03934","source_version":2,"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-18T00:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSDkO6fVebdktTttrbZ9sAtezBJkd3AerRSLQEPypil3HuIAqYHH+3hdlUk/fB1dWpUJdM+yAsLgxQb2dFqvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:04:50.868829Z"},"content_sha256":"7e8d9bda862eaf46089d44b9dc692f751ae4d69592a3ba48841850840943f980","schema_version":"1.0","event_id":"sha256:7e8d9bda862eaf46089d44b9dc692f751ae4d69592a3ba48841850840943f980"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XTBDFTPPZUT62RLDOABFCTFGOW","target":"graph","payload":{"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"},"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-18T00:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ys7ffrVZiwFhB2nwUfBB8epSv5mranj+4PRHWcDhloWJZxdvoKQi/rBs2jVxOzkJPvEww2SIQy2m1vMhashHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:04:50.869170Z"},"content_sha256":"a5a02515446e6cdd45efe5001923a463ff05900232d08b8d83354701e0853606","schema_version":"1.0","event_id":"sha256:a5a02515446e6cdd45efe5001923a463ff05900232d08b8d83354701e0853606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/bundle.json","state_url":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTBDFTPPZUT62RLDOABFCTFGOW/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-26T21:04:50Z","links":{"resolver":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW","bundle":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/bundle.json","state":"https://pith.science/pith/XTBDFTPPZUT62RLDOABFCTFGOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTBDFTPPZUT62RLDOABFCTFGOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XTBDFTPPZUT62RLDOABFCTFGOW","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":"ea90d046d4897e536976af946a1f6c095c8f1387a45b50e7716a1374ec87002b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T16:55:47Z","title_canon_sha256":"9801b0f11ae7f17426fa7b73f08f0d211044c50c2f3c2044375ad0b4ccfb885a"},"schema_version":"1.0","source":{"id":"1609.03934","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03934","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03934v2","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03934","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"XTBDFTPPZUT6","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XTBDFTPPZUT62RLD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XTBDFTPP","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:a5a02515446e6cdd45efe5001923a463ff05900232d08b8d83354701e0853606","target":"graph","created_at":"2026-05-18T00:35:51Z","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":"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","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T16:55:47Z","title":"$3$-uniform hypergraphs and linear cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03934","kind":"arxiv","version":2},"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:7e8d9bda862eaf46089d44b9dc692f751ae4d69592a3ba48841850840943f980","target":"record","created_at":"2026-05-18T00:35:51Z","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":"ea90d046d4897e536976af946a1f6c095c8f1387a45b50e7716a1374ec87002b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-13T16:55:47Z","title_canon_sha256":"9801b0f11ae7f17426fa7b73f08f0d211044c50c2f3c2044375ad0b4ccfb885a"},"schema_version":"1.0","source":{"id":"1609.03934","kind":"arxiv","version":2}},"canonical_sha256":"bcc232cdefcd27ed45637002514ca675bdbd415374aae96da2c97a82194f18f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcc232cdefcd27ed45637002514ca675bdbd415374aae96da2c97a82194f18f2","first_computed_at":"2026-05-18T00:35:51.746307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:51.746307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RzdTgC+VTUIdPEkOsJXKtNRWXLST56qRDMNkbDUC6MTpbjeBFHWM0egOZ6Pjht/1uk98Od0T5N9btf84sH4KDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:51.746930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03934","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e8d9bda862eaf46089d44b9dc692f751ae4d69592a3ba48841850840943f980","sha256:a5a02515446e6cdd45efe5001923a463ff05900232d08b8d83354701e0853606"],"state_sha256":"85ce4a3797d69fa4a282078be4195a6a44187e132f57aa00b459b3caf932e0e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCN+T75FbPQXfeLV8s+1F3XCRDRYYaS3hBjvIbj01b2NLEUXog3WrL91ftW56d0nY+EUsATFVYpQnCruND6YBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T21:04:50.871444Z","bundle_sha256":"e9da136c19abb15c226c9812eac4db1e9ea3295e2ef2aac8074618e1bd03cd62"}}