{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PTYCFAH6TLD3TZNLL7SZJC37B5","short_pith_number":"pith:PTYCFAH6","schema_version":"1.0","canonical_sha256":"7cf02280fe9ac7b9e5ab5fe5948b7f0f58e5c250b059d0d35a00fe2572d70c19","source":{"kind":"arxiv","id":"1104.3158","version":3},"attestation_state":"computed","paper":{"title":"On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Deepak Bal, Zelealem B. Yilma","submitted_at":"2011-04-15T21:01:59Z","abstract_excerpt":"In this note, we determine the maximum number of edges of a $k$-uniform hypergraph, $k\\ge 3$, with a unique perfect matching. This settles a conjecture proposed by Snevily."},"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":"1104.3158","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-15T21:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"96aad91b4364d9a6e85acea5adb5c353dd6ab2f3e48b367f8851008194b59d06","abstract_canon_sha256":"013c3758fb36ee3fd807086eb351cb02a30445d1ebb112c55604c25154b22e8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:35.649586Z","signature_b64":"O3z4IBQ9ZoRMojuP6IKeFqrOBointCBxnG+UpjSMbG/yClSEMpE3YWrrlSRYiOj7M56A4WHZeCUUjRshMsk5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf02280fe9ac7b9e5ab5fe5948b7f0f58e5c250b059d0d35a00fe2572d70c19","last_reissued_at":"2026-05-18T04:18:35.649059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:35.649059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Deepak Bal, Zelealem B. Yilma","submitted_at":"2011-04-15T21:01:59Z","abstract_excerpt":"In this note, we determine the maximum number of edges of a $k$-uniform hypergraph, $k\\ge 3$, with a unique perfect matching. This settles a conjecture proposed by Snevily."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3158","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1104.3158","created_at":"2026-05-18T04:18:35.649142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3158v3","created_at":"2026-05-18T04:18:35.649142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3158","created_at":"2026-05-18T04:18:35.649142+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTYCFAH6TLD3","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTYCFAH6TLD3TZNL","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTYCFAH6","created_at":"2026-05-18T12:26:39.201973+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/PTYCFAH6TLD3TZNLL7SZJC37B5","json":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5.json","graph_json":"https://pith.science/api/pith-number/PTYCFAH6TLD3TZNLL7SZJC37B5/graph.json","events_json":"https://pith.science/api/pith-number/PTYCFAH6TLD3TZNLL7SZJC37B5/events.json","paper":"https://pith.science/paper/PTYCFAH6"},"agent_actions":{"view_html":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5","download_json":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5.json","view_paper":"https://pith.science/paper/PTYCFAH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3158&json=true","fetch_graph":"https://pith.science/api/pith-number/PTYCFAH6TLD3TZNLL7SZJC37B5/graph.json","fetch_events":"https://pith.science/api/pith-number/PTYCFAH6TLD3TZNLL7SZJC37B5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5/action/storage_attestation","attest_author":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5/action/author_attestation","sign_citation":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5/action/citation_signature","submit_replication":"https://pith.science/pith/PTYCFAH6TLD3TZNLL7SZJC37B5/action/replication_record"}},"created_at":"2026-05-18T04:18:35.649142+00:00","updated_at":"2026-05-18T04:18:35.649142+00:00"}