{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3K6VO7XOYG66W7GGEIO7MJOMA2","short_pith_number":"pith:3K6VO7XO","canonical_record":{"source":{"id":"1711.07442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-20T17:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"796502769a6716685359396b6d934d6dee8a7fbe066880c1db10c5ec9c5728ec","abstract_canon_sha256":"b85ff990a4cf77fa12e7064a2bd1548b70135bdb81d103065903fa3ebb1a1521"},"schema_version":"1.0"},"canonical_sha256":"dabd577eeec1bdeb7cc6221df625cc069d0881de6f8ccd4b6feb5e85ef837c21","source":{"kind":"arxiv","id":"1711.07442","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07442","created_at":"2026-05-18T00:28:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07442v2","created_at":"2026-05-18T00:28:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07442","created_at":"2026-05-18T00:28:10Z"},{"alias_kind":"pith_short_12","alias_value":"3K6VO7XOYG66","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3K6VO7XOYG66W7GG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3K6VO7XO","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3K6VO7XOYG66W7GGEIO7MJOMA2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-20T17:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"796502769a6716685359396b6d934d6dee8a7fbe066880c1db10c5ec9c5728ec","abstract_canon_sha256":"b85ff990a4cf77fa12e7064a2bd1548b70135bdb81d103065903fa3ebb1a1521"},"schema_version":"1.0"},"canonical_sha256":"dabd577eeec1bdeb7cc6221df625cc069d0881de6f8ccd4b6feb5e85ef837c21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:10.227712Z","signature_b64":"RnvVA2qs+U17hv6D6lt5Zg3944S0uJAJqow+TIXxPGOezQ4obuyD9VB42gzQYDincjEoZJB+XYgA64KonH33Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dabd577eeec1bdeb7cc6221df625cc069d0881de6f8ccd4b6feb5e85ef837c21","last_reissued_at":"2026-05-18T00:28:10.227042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:10.227042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07442","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:28:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTdlcF9uv9VROctppbb2TuHeifaucQXJusMb7WP72hCeQTBzAvtb+OlhU0lYQC3vfqoSYy9Q8jjU3aboZSTfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:39:37.933929Z"},"content_sha256":"cad93ddab1a8315f389edcc84e007f7e615aca41240e6df5ce9c7123e873b4a3","schema_version":"1.0","event_id":"sha256:cad93ddab1a8315f389edcc84e007f7e615aca41240e6df5ce9c7123e873b4a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3K6VO7XOYG66W7GGEIO7MJOMA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On tight cycles in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Jie Ma","submitted_at":"2017-11-20T17:57:46Z","abstract_excerpt":"A tight $k$-uniform $\\ell$-cycle, denoted by $TC_\\ell^k$, is a $k$-uniform hypergraph whose vertex set is $v_0, \\cdots, v_{\\ell-1}$, and the edges are all the $k$-tuples $\\{v_i, v_{i+1}, \\cdots, v_{i+k-1}\\}$, with subscripts modulo $\\ell$. Motivated by a classic result in graph theory that every $n$-vertex cycle-free graph has at most $n-1$ edges, S\\'os and, independently, Verstra\\\"ete asked whether for every integer $k$, a $k$-uniform $n$-vertex hypergraph without any tight $k$-uniform cycles has at most $\\binom{n-1}{k-1}$ edges. In this paper, we answer this question in negative."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07442","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:28:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6B3Jy1yRLdrNvzK7ko1+b2GHzqbEt4aicRi/PBQTK80T0dOv+E5DVgZVyFmA51VAl3tlW8M9TfwzZcYXOTcRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:39:37.934466Z"},"content_sha256":"565ae9a23b7d5474ef79d8b5977222aeabb72be859c7f5335a64b383d3d02a5a","schema_version":"1.0","event_id":"sha256:565ae9a23b7d5474ef79d8b5977222aeabb72be859c7f5335a64b383d3d02a5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3K6VO7XOYG66W7GGEIO7MJOMA2/bundle.json","state_url":"https://pith.science/pith/3K6VO7XOYG66W7GGEIO7MJOMA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3K6VO7XOYG66W7GGEIO7MJOMA2/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-05-31T09:39:37Z","links":{"resolver":"https://pith.science/pith/3K6VO7XOYG66W7GGEIO7MJOMA2","bundle":"https://pith.science/pith/3K6VO7XOYG66W7GGEIO7MJOMA2/bundle.json","state":"https://pith.science/pith/3K6VO7XOYG66W7GGEIO7MJOMA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3K6VO7XOYG66W7GGEIO7MJOMA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3K6VO7XOYG66W7GGEIO7MJOMA2","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":"b85ff990a4cf77fa12e7064a2bd1548b70135bdb81d103065903fa3ebb1a1521","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-20T17:57:46Z","title_canon_sha256":"796502769a6716685359396b6d934d6dee8a7fbe066880c1db10c5ec9c5728ec"},"schema_version":"1.0","source":{"id":"1711.07442","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07442","created_at":"2026-05-18T00:28:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07442v2","created_at":"2026-05-18T00:28:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07442","created_at":"2026-05-18T00:28:10Z"},{"alias_kind":"pith_short_12","alias_value":"3K6VO7XOYG66","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3K6VO7XOYG66W7GG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3K6VO7XO","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:565ae9a23b7d5474ef79d8b5977222aeabb72be859c7f5335a64b383d3d02a5a","target":"graph","created_at":"2026-05-18T00:28:10Z","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 tight $k$-uniform $\\ell$-cycle, denoted by $TC_\\ell^k$, is a $k$-uniform hypergraph whose vertex set is $v_0, \\cdots, v_{\\ell-1}$, and the edges are all the $k$-tuples $\\{v_i, v_{i+1}, \\cdots, v_{i+k-1}\\}$, with subscripts modulo $\\ell$. Motivated by a classic result in graph theory that every $n$-vertex cycle-free graph has at most $n-1$ edges, S\\'os and, independently, Verstra\\\"ete asked whether for every integer $k$, a $k$-uniform $n$-vertex hypergraph without any tight $k$-uniform cycles has at most $\\binom{n-1}{k-1}$ edges. In this paper, we answer this question in negative.","authors_text":"Hao Huang, Jie Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-20T17:57:46Z","title":"On tight cycles in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07442","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:cad93ddab1a8315f389edcc84e007f7e615aca41240e6df5ce9c7123e873b4a3","target":"record","created_at":"2026-05-18T00:28:10Z","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":"b85ff990a4cf77fa12e7064a2bd1548b70135bdb81d103065903fa3ebb1a1521","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-20T17:57:46Z","title_canon_sha256":"796502769a6716685359396b6d934d6dee8a7fbe066880c1db10c5ec9c5728ec"},"schema_version":"1.0","source":{"id":"1711.07442","kind":"arxiv","version":2}},"canonical_sha256":"dabd577eeec1bdeb7cc6221df625cc069d0881de6f8ccd4b6feb5e85ef837c21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dabd577eeec1bdeb7cc6221df625cc069d0881de6f8ccd4b6feb5e85ef837c21","first_computed_at":"2026-05-18T00:28:10.227042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:10.227042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RnvVA2qs+U17hv6D6lt5Zg3944S0uJAJqow+TIXxPGOezQ4obuyD9VB42gzQYDincjEoZJB+XYgA64KonH33Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:10.227712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07442","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cad93ddab1a8315f389edcc84e007f7e615aca41240e6df5ce9c7123e873b4a3","sha256:565ae9a23b7d5474ef79d8b5977222aeabb72be859c7f5335a64b383d3d02a5a"],"state_sha256":"ac83ed29283de661909ed4e62a2980c75e01049c946a75102e89394ea8e9088a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHJeempNMV7d6gyxmPxssPshAa8/AGJ9nLWF6UOUSpSVL158m2f2uejJ8pCXu1uJXVGIWAJkWmZhQIg8dg1SBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:39:37.938889Z","bundle_sha256":"91595a82e7c7af7ff71898800a6d119a7d363b603d2a6ca9c121343760b03fbb"}}