{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZHL4F6WIOABMEFY5ORHOX6CMIR","short_pith_number":"pith:ZHL4F6WI","schema_version":"1.0","canonical_sha256":"c9d7c2fac87002c2171d744eebf84c4478a9282d4782cbe81ebcf2909a685946","source":{"kind":"arxiv","id":"2506.17652","version":2},"attestation_state":"computed","paper":{"title":"Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Divoux, Tantan Dai, Tom Kelly","submitted_at":"2025-06-21T09:22:47Z","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"},"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":"2506.17652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-21T09:22:47Z","cross_cats_sorted":[],"title_canon_sha256":"95504f95792725756f79c38d4843f78ddc053cc5be2dd1e80784a90b5db80b42","abstract_canon_sha256":"4e2965bf3711bfdcb0902228b77d69677c312c84a82a58d302f918c115384da7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:14.808522Z","signature_b64":"6LE8qhJ1YYBzTPTGVk9rFhaDUm6USkOrDLbLMvPlBbEb+kJ2kmrWt5JPFQ7dGiGvDHI78mdSoC7PcRYVYh2aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9d7c2fac87002c2171d744eebf84c4478a9282d4782cbe81ebcf2909a685946","last_reissued_at":"2026-05-21T01:04:14.807724Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:14.807724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Divoux, Tantan Dai, Tom Kelly","submitted_at":"2025-06-21T09:22:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17652","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.17652/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":"2506.17652","created_at":"2026-05-21T01:04:14.807848+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.17652v2","created_at":"2026-05-21T01:04:14.807848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17652","created_at":"2026-05-21T01:04:14.807848+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHL4F6WIOABM","created_at":"2026-05-21T01:04:14.807848+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHL4F6WIOABMEFY5","created_at":"2026-05-21T01:04:14.807848+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHL4F6WI","created_at":"2026-05-21T01:04:14.807848+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR","json":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR.json","graph_json":"https://pith.science/api/pith-number/ZHL4F6WIOABMEFY5ORHOX6CMIR/graph.json","events_json":"https://pith.science/api/pith-number/ZHL4F6WIOABMEFY5ORHOX6CMIR/events.json","paper":"https://pith.science/paper/ZHL4F6WI"},"agent_actions":{"view_html":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR","download_json":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR.json","view_paper":"https://pith.science/paper/ZHL4F6WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.17652&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHL4F6WIOABMEFY5ORHOX6CMIR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHL4F6WIOABMEFY5ORHOX6CMIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR/action/storage_attestation","attest_author":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR/action/author_attestation","sign_citation":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR/action/citation_signature","submit_replication":"https://pith.science/pith/ZHL4F6WIOABMEFY5ORHOX6CMIR/action/replication_record"}},"created_at":"2026-05-21T01:04:14.807848+00:00","updated_at":"2026-05-21T01:04:14.807848+00:00"}