{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3A3I5MZD2SPZB452NO52E24XPA","short_pith_number":"pith:3A3I5MZD","schema_version":"1.0","canonical_sha256":"d8368eb323d49f90f3ba6bbba26b977832da0afe33ef0fe03d1f3d6eb190e865","source":{"kind":"arxiv","id":"2207.10850","version":1},"attestation_state":"computed","paper":{"title":"A simple and sharper proof of the hypergraph Moore bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty","submitted_at":"2022-07-22T02:55:56Z","abstract_excerpt":"The hypergraph Moore bound is an elegant statement that characterizes the extremal trade-off between the girth - the number of hyperedges in the smallest cycle or even cover (a subhypergraph with all degrees even) and size - the number of hyperedges in a hypergraph. For graphs (i.e., $2$-uniform hypergraphs), a bound tight up to the leading constant was proven in a classical work of Alon, Hoory and Linial [AHL02]. For hypergraphs of uniformity $k>2$, an appropriate generalization was conjectured by Feige [Fei08]. The conjecture was settled up to an additional $\\log^{4k+1} n$ factor in the size"},"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":"2207.10850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-22T02:55:56Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"873952730acc6e28e1e89dfd99c71b10667a3d84dbeb717ef32806d25b47347b","abstract_canon_sha256":"897c5b53435c7e08e0b4fa8f88f8742fdb2757667f921e0598a23647384f1f3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:42:40.213661Z","signature_b64":"jQPAW/uCfCdehh0Wblgib+ju+wTwNeWoGagi8lUWsJI4BaqXtr0aSo39SGteKdVMrJM2jV4fqcdFxap/UgemAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8368eb323d49f90f3ba6bbba26b977832da0afe33ef0fe03d1f3d6eb190e865","last_reissued_at":"2026-07-05T04:42:40.213261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:42:40.213261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple and sharper proof of the hypergraph Moore bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty","submitted_at":"2022-07-22T02:55:56Z","abstract_excerpt":"The hypergraph Moore bound is an elegant statement that characterizes the extremal trade-off between the girth - the number of hyperedges in the smallest cycle or even cover (a subhypergraph with all degrees even) and size - the number of hyperedges in a hypergraph. For graphs (i.e., $2$-uniform hypergraphs), a bound tight up to the leading constant was proven in a classical work of Alon, Hoory and Linial [AHL02]. For hypergraphs of uniformity $k>2$, an appropriate generalization was conjectured by Feige [Fei08]. The conjecture was settled up to an additional $\\log^{4k+1} n$ factor in the size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.10850","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.10850/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2207.10850","created_at":"2026-07-05T04:42:40.213320+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.10850v1","created_at":"2026-07-05T04:42:40.213320+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.10850","created_at":"2026-07-05T04:42:40.213320+00:00"},{"alias_kind":"pith_short_12","alias_value":"3A3I5MZD2SPZ","created_at":"2026-07-05T04:42:40.213320+00:00"},{"alias_kind":"pith_short_16","alias_value":"3A3I5MZD2SPZB452","created_at":"2026-07-05T04:42:40.213320+00:00"},{"alias_kind":"pith_short_8","alias_value":"3A3I5MZD","created_at":"2026-07-05T04:42:40.213320+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05331","citing_title":"On the Approximability of Boolean Max-$k$-CSP","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA","json":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA.json","graph_json":"https://pith.science/api/pith-number/3A3I5MZD2SPZB452NO52E24XPA/graph.json","events_json":"https://pith.science/api/pith-number/3A3I5MZD2SPZB452NO52E24XPA/events.json","paper":"https://pith.science/paper/3A3I5MZD"},"agent_actions":{"view_html":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA","download_json":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA.json","view_paper":"https://pith.science/paper/3A3I5MZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.10850&json=true","fetch_graph":"https://pith.science/api/pith-number/3A3I5MZD2SPZB452NO52E24XPA/graph.json","fetch_events":"https://pith.science/api/pith-number/3A3I5MZD2SPZB452NO52E24XPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/action/storage_attestation","attest_author":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/action/author_attestation","sign_citation":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/action/citation_signature","submit_replication":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/action/replication_record"}},"created_at":"2026-07-05T04:42:40.213320+00:00","updated_at":"2026-07-05T04:42:40.213320+00:00"}