{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3A3I5MZD2SPZB452NO52E24XPA","short_pith_number":"pith:3A3I5MZD","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"},"canonical_sha256":"d8368eb323d49f90f3ba6bbba26b977832da0afe33ef0fe03d1f3d6eb190e865","source":{"kind":"arxiv","id":"2207.10850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.10850","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"2207.10850v1","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.10850","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"3A3I5MZD2SPZ","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"pith_short_16","alias_value":"3A3I5MZD2SPZB452","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"pith_short_8","alias_value":"3A3I5MZD","created_at":"2026-07-05T04:42:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3A3I5MZD2SPZB452NO52E24XPA","target":"record","payload":{"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"},"canonical_sha256":"d8368eb323d49f90f3ba6bbba26b977832da0afe33ef0fe03d1f3d6eb190e865","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"},"source_kind":"arxiv","source_id":"2207.10850","source_version":1,"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-07-05T04:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36fUQwHlKAJTNEBVgDjbPoFud7Ux6cDq2cTi1gOJaeevHjt2vKKYJH+NG0/oPAsJfyt9Bws+Nfq6afRL2CWrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:09:34.498812Z"},"content_sha256":"434cf05f23679f54e91c5d6ec8c83ca3dda50e86c95042907d65ab1df859cec6","schema_version":"1.0","event_id":"sha256:434cf05f23679f54e91c5d6ec8c83ca3dda50e86c95042907d65ab1df859cec6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3A3I5MZD2SPZB452NO52E24XPA","target":"graph","payload":{"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"},"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-07-05T04:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywOxMuO8wfdFrAEQb+ZgSWqYMsZU4vdw3m9r/8pOsV772QXda9sGbg5ONXl7zGmGfaiI3LRCAXDsSgZImFkqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:09:34.499303Z"},"content_sha256":"2cdfeb6ee7e790b82c0eeb6deb960ade6f2a62d0a86ebe9235480fb36fe3c6a7","schema_version":"1.0","event_id":"sha256:2cdfeb6ee7e790b82c0eeb6deb960ade6f2a62d0a86ebe9235480fb36fe3c6a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/bundle.json","state_url":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3A3I5MZD2SPZB452NO52E24XPA/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-08-09T09:09:34Z","links":{"resolver":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA","bundle":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/bundle.json","state":"https://pith.science/pith/3A3I5MZD2SPZB452NO52E24XPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3A3I5MZD2SPZB452NO52E24XPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3A3I5MZD2SPZB452NO52E24XPA","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":"897c5b53435c7e08e0b4fa8f88f8742fdb2757667f921e0598a23647384f1f3a","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-22T02:55:56Z","title_canon_sha256":"873952730acc6e28e1e89dfd99c71b10667a3d84dbeb717ef32806d25b47347b"},"schema_version":"1.0","source":{"id":"2207.10850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.10850","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"2207.10850v1","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.10850","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"3A3I5MZD2SPZ","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"pith_short_16","alias_value":"3A3I5MZD2SPZB452","created_at":"2026-07-05T04:42:40Z"},{"alias_kind":"pith_short_8","alias_value":"3A3I5MZD","created_at":"2026-07-05T04:42:40Z"}],"graph_snapshots":[{"event_id":"sha256:2cdfeb6ee7e790b82c0eeb6deb960ade6f2a62d0a86ebe9235480fb36fe3c6a7","target":"graph","created_at":"2026-07-05T04:42:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.10850/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-22T02:55:56Z","title":"A simple and sharper proof of the hypergraph Moore bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.10850","kind":"arxiv","version":1},"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:434cf05f23679f54e91c5d6ec8c83ca3dda50e86c95042907d65ab1df859cec6","target":"record","created_at":"2026-07-05T04:42:40Z","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":"897c5b53435c7e08e0b4fa8f88f8742fdb2757667f921e0598a23647384f1f3a","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-07-22T02:55:56Z","title_canon_sha256":"873952730acc6e28e1e89dfd99c71b10667a3d84dbeb717ef32806d25b47347b"},"schema_version":"1.0","source":{"id":"2207.10850","kind":"arxiv","version":1}},"canonical_sha256":"d8368eb323d49f90f3ba6bbba26b977832da0afe33ef0fe03d1f3d6eb190e865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8368eb323d49f90f3ba6bbba26b977832da0afe33ef0fe03d1f3d6eb190e865","first_computed_at":"2026-07-05T04:42:40.213261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:42:40.213261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jQPAW/uCfCdehh0Wblgib+ju+wTwNeWoGagi8lUWsJI4BaqXtr0aSo39SGteKdVMrJM2jV4fqcdFxap/UgemAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:42:40.213661Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.10850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:434cf05f23679f54e91c5d6ec8c83ca3dda50e86c95042907d65ab1df859cec6","sha256:2cdfeb6ee7e790b82c0eeb6deb960ade6f2a62d0a86ebe9235480fb36fe3c6a7"],"state_sha256":"453fea7d29c244911cbd6012cf1e7b008665e3ccd0d338d84d08e41af4960849"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAjGqz0m4wrdAAlpJXwe30deGY+8bTyJb2LEUS6wTHidPYz8t4BjuKfVtyFnAwOlR/M0xrxUH8ibUxEwwufSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T09:09:34.502617Z","bundle_sha256":"b4a3d6789e337c94638531115b352b60a2e218aafd60485033e9accde1b2e0af"}}