{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZHL4F6WIOABMEFY5ORHOX6CMIR","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":"4e2965bf3711bfdcb0902228b77d69677c312c84a82a58d302f918c115384da7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-21T09:22:47Z","title_canon_sha256":"95504f95792725756f79c38d4843f78ddc053cc5be2dd1e80784a90b5db80b42"},"schema_version":"1.0","source":{"id":"2506.17652","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.17652","created_at":"2026-05-21T01:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"2506.17652v2","created_at":"2026-05-21T01:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17652","created_at":"2026-05-21T01:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZHL4F6WIOABM","created_at":"2026-05-21T01:04:14Z"},{"alias_kind":"pith_short_16","alias_value":"ZHL4F6WIOABMEFY5","created_at":"2026-05-21T01:04:14Z"},{"alias_kind":"pith_short_8","alias_value":"ZHL4F6WI","created_at":"2026-05-21T01:04:14Z"}],"graph_snapshots":[{"event_id":"sha256:4c0841a33a1bce16d5d3a6b70f9224f3386493b2859048d78cd220eea5fdcc3c","target":"graph","created_at":"2026-05-21T01:04:14Z","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/2506.17652/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A hypergraph is \\textit{bipartite with bipartition $(A, B)$} if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \\textit{$A$-perfect} if it saturates every vertex in $A$. We prove an upper bound on the number of $A$-perfect matchings in uniform hypergraphs with small maximum codegree. Using this result, we prove that there exist order-$n$ Latin squares with at most $(n/e^{2.117})^n$ transversals when $n$ is odd and $n \\equiv 0\\pmod 3$. We also show that $k$-uniform $D$-regular hypergraphs on $n$ vertices have at most $((1+o(1))q/e^k)^{Dn/k}$ proper $q$-edge-colo","authors_text":"Alexander Divoux, Tantan Dai, Tom Kelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-21T09:22:47Z","title":"Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17652","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:ccd45c98b3211a66cf2c8122a87f0158c0aa590689f66b7961901d88c817a0f8","target":"record","created_at":"2026-05-21T01:04:14Z","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":"4e2965bf3711bfdcb0902228b77d69677c312c84a82a58d302f918c115384da7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-21T09:22:47Z","title_canon_sha256":"95504f95792725756f79c38d4843f78ddc053cc5be2dd1e80784a90b5db80b42"},"schema_version":"1.0","source":{"id":"2506.17652","kind":"arxiv","version":2}},"canonical_sha256":"c9d7c2fac87002c2171d744eebf84c4478a9282d4782cbe81ebcf2909a685946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9d7c2fac87002c2171d744eebf84c4478a9282d4782cbe81ebcf2909a685946","first_computed_at":"2026-05-21T01:04:14.807724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:14.807724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LE8qhJ1YYBzTPTGVk9rFhaDUm6USkOrDLbLMvPlBbEb+kJ2kmrWt5JPFQ7dGiGvDHI78mdSoC7PcRYVYh2aDQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:14.808522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.17652","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccd45c98b3211a66cf2c8122a87f0158c0aa590689f66b7961901d88c817a0f8","sha256:4c0841a33a1bce16d5d3a6b70f9224f3386493b2859048d78cd220eea5fdcc3c"],"state_sha256":"4496c0dd51eb476752ce010ec7b723ee2d0ecad72c67ca283fbe123a0a0e110a"}