{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Y3GVPD43JZEZLI4MX4GSPCHWJQ","short_pith_number":"pith:Y3GVPD43","canonical_record":{"source":{"id":"2607.14068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T17:37:24Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"9c19f19f321bb84dcd4aed48af9a64ea2909ad6444484ff24e3823ffc7cab823","abstract_canon_sha256":"823c67a6ca375d40c927dd0b60ed42866611f009a05aa4f6e84e55c3cdd6473f"},"schema_version":"1.0"},"canonical_sha256":"c6cd578f9b4e4995a38cbf0d2788f64c02a500d81fd0c9da53cd09e62367ed88","source":{"kind":"arxiv","id":"2607.14068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14068","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14068v1","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14068","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"Y3GVPD43JZEZ","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"pith_short_16","alias_value":"Y3GVPD43JZEZLI4M","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"pith_short_8","alias_value":"Y3GVPD43","created_at":"2026-07-16T01:23:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Y3GVPD43JZEZLI4MX4GSPCHWJQ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.14068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T17:37:24Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"9c19f19f321bb84dcd4aed48af9a64ea2909ad6444484ff24e3823ffc7cab823","abstract_canon_sha256":"823c67a6ca375d40c927dd0b60ed42866611f009a05aa4f6e84e55c3cdd6473f"},"schema_version":"1.0"},"canonical_sha256":"c6cd578f9b4e4995a38cbf0d2788f64c02a500d81fd0c9da53cd09e62367ed88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:23:22.952850Z","signature_b64":"ivBvDqR63dk4HRfSkAHEoMhPICg6HfRoIW0DcfdbWC/HS4o9YX6aeZqjULfr5ZsyO5x9eXk/LcpWzmxQxgDBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6cd578f9b4e4995a38cbf0d2788f64c02a500d81fd0c9da53cd09e62367ed88","last_reissued_at":"2026-07-16T01:23:22.952041Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:23:22.952041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.14068","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-16T01:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPx4HsyHG6mzFn6/Km0/HYiV4f6ns+f8PR5b5bP5bU52UXL9dGFtuF6wf+wB3I1kJdiRw5k4LJC1bgNiE/oiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:48:41.205605Z"},"content_sha256":"af675bf29887d61bbf083446f3ff6604101352f11d9edcb046e365c5801523fc","schema_version":"1.0","event_id":"sha256:af675bf29887d61bbf083446f3ff6604101352f11d9edcb046e365c5801523fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Y3GVPD43JZEZLI4MX4GSPCHWJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The even-uniform 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":"Afonso S. Bandeira, Dmitriy Kunisky, Lucas Pesenti, Petar Nizi\\'c-Nikolac, Robert Wang","submitted_at":"2026-07-15T17:37:24Z","abstract_excerpt":"The hypergraph Moore bound conjectured by Feige (2008) controls the size of the smallest even cover in a $k$-uniform hypergraph in terms of the average density of hyperedges. An even cover is a set of hyperedges covering each vertex an even number of times, generalizing the notion of a cycle in a graph, so the size of the smallest non-trivial even cover provides a notion of hypergraph girth. Recent work starting from the breakthrough result of Guruswami, Kothari, and Manohar (2022) proved the conjecture up to polylogarithmic factors, whose exponents were later gradually improved. We give a sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14068","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/2607.14068/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-16T01:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wq1zpvyJ63rgcRbUXC+y8S9LpQjlzlb08suXWxjaVoB2qEgETShH6NO3NYSTqLBh9Zg4oFaSO78LU6FPNlHLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:48:41.206082Z"},"content_sha256":"95589646392f385fb92a1a58e64ac2ba23ada114fdf099b0ce02df9a700b057e","schema_version":"1.0","event_id":"sha256:95589646392f385fb92a1a58e64ac2ba23ada114fdf099b0ce02df9a700b057e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3GVPD43JZEZLI4MX4GSPCHWJQ/bundle.json","state_url":"https://pith.science/pith/Y3GVPD43JZEZLI4MX4GSPCHWJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3GVPD43JZEZLI4MX4GSPCHWJQ/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-04T08:48:41Z","links":{"resolver":"https://pith.science/pith/Y3GVPD43JZEZLI4MX4GSPCHWJQ","bundle":"https://pith.science/pith/Y3GVPD43JZEZLI4MX4GSPCHWJQ/bundle.json","state":"https://pith.science/pith/Y3GVPD43JZEZLI4MX4GSPCHWJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3GVPD43JZEZLI4MX4GSPCHWJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Y3GVPD43JZEZLI4MX4GSPCHWJQ","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":"823c67a6ca375d40c927dd0b60ed42866611f009a05aa4f6e84e55c3cdd6473f","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T17:37:24Z","title_canon_sha256":"9c19f19f321bb84dcd4aed48af9a64ea2909ad6444484ff24e3823ffc7cab823"},"schema_version":"1.0","source":{"id":"2607.14068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14068","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14068v1","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14068","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"Y3GVPD43JZEZ","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"pith_short_16","alias_value":"Y3GVPD43JZEZLI4M","created_at":"2026-07-16T01:23:22Z"},{"alias_kind":"pith_short_8","alias_value":"Y3GVPD43","created_at":"2026-07-16T01:23:22Z"}],"graph_snapshots":[{"event_id":"sha256:95589646392f385fb92a1a58e64ac2ba23ada114fdf099b0ce02df9a700b057e","target":"graph","created_at":"2026-07-16T01:23:22Z","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/2607.14068/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The hypergraph Moore bound conjectured by Feige (2008) controls the size of the smallest even cover in a $k$-uniform hypergraph in terms of the average density of hyperedges. An even cover is a set of hyperedges covering each vertex an even number of times, generalizing the notion of a cycle in a graph, so the size of the smallest non-trivial even cover provides a notion of hypergraph girth. Recent work starting from the breakthrough result of Guruswami, Kothari, and Manohar (2022) proved the conjecture up to polylogarithmic factors, whose exponents were later gradually improved. We give a sim","authors_text":"Afonso S. Bandeira, Dmitriy Kunisky, Lucas Pesenti, Petar Nizi\\'c-Nikolac, Robert Wang","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T17:37:24Z","title":"The even-uniform hypergraph Moore bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14068","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:af675bf29887d61bbf083446f3ff6604101352f11d9edcb046e365c5801523fc","target":"record","created_at":"2026-07-16T01:23:22Z","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":"823c67a6ca375d40c927dd0b60ed42866611f009a05aa4f6e84e55c3cdd6473f","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-15T17:37:24Z","title_canon_sha256":"9c19f19f321bb84dcd4aed48af9a64ea2909ad6444484ff24e3823ffc7cab823"},"schema_version":"1.0","source":{"id":"2607.14068","kind":"arxiv","version":1}},"canonical_sha256":"c6cd578f9b4e4995a38cbf0d2788f64c02a500d81fd0c9da53cd09e62367ed88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6cd578f9b4e4995a38cbf0d2788f64c02a500d81fd0c9da53cd09e62367ed88","first_computed_at":"2026-07-16T01:23:22.952041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-16T01:23:22.952041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivBvDqR63dk4HRfSkAHEoMhPICg6HfRoIW0DcfdbWC/HS4o9YX6aeZqjULfr5ZsyO5x9eXk/LcpWzmxQxgDBDQ==","signature_status":"signed_v1","signed_at":"2026-07-16T01:23:22.952850Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af675bf29887d61bbf083446f3ff6604101352f11d9edcb046e365c5801523fc","sha256:95589646392f385fb92a1a58e64ac2ba23ada114fdf099b0ce02df9a700b057e"],"state_sha256":"3d7c107a4bf7d98540fb8596862b3dc7d5cd4111119ddbca96629a0ac05f6425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXX1fJ6lNDIOQpLIR7Fw9uhI8t5IOyuxWw+mY2H2OvQQ3M2dO4vHfJzhGOCGXu7Icsd6IsRqtGpuscYNk3z7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:48:41.210277Z","bundle_sha256":"be6b07c8bcfcad069d664233f692d24660a13fd422b4a1b19fec23da3bb191d3"}}