{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JSCLLTGPPDVGBCU2W7CTA6LEDL","short_pith_number":"pith:JSCLLTGP","schema_version":"1.0","canonical_sha256":"4c84b5cccf78ea608a9ab7c53079641aceaa53203859053e487e68e8a8dba785","source":{"kind":"arxiv","id":"1807.05752","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph matchings and designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Keevash","submitted_at":"2018-07-16T09:26:00Z","abstract_excerpt":"We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs."},"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":"1807.05752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-16T09:26:00Z","cross_cats_sorted":[],"title_canon_sha256":"f91e2187a2a40c0b99b32d191b0fbbce0e9963398afed36bb19aa8addfdac243","abstract_canon_sha256":"feb03e36e4524f1093368a8bdcaae40f1bf44d2ecae48b96b24a912dc365c81b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:42.654621Z","signature_b64":"geBH6wyEO2ghMjx+QshtEbsbRdsM1wScGgGqulnvUpy7aPp/A0v7Vihu4/UGObpDlLlPbA2bIn0D0eOrOJRLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c84b5cccf78ea608a9ab7c53079641aceaa53203859053e487e68e8a8dba785","last_reissued_at":"2026-05-18T00:10:42.654025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:42.654025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph matchings and designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Keevash","submitted_at":"2018-07-16T09:26:00Z","abstract_excerpt":"We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05752","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":""},"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":"1807.05752","created_at":"2026-05-18T00:10:42.654108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05752v1","created_at":"2026-05-18T00:10:42.654108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05752","created_at":"2026-05-18T00:10:42.654108+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSCLLTGPPDVG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSCLLTGPPDVGBCU2","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSCLLTGP","created_at":"2026-05-18T12:32:31.084164+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/JSCLLTGPPDVGBCU2W7CTA6LEDL","json":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL.json","graph_json":"https://pith.science/api/pith-number/JSCLLTGPPDVGBCU2W7CTA6LEDL/graph.json","events_json":"https://pith.science/api/pith-number/JSCLLTGPPDVGBCU2W7CTA6LEDL/events.json","paper":"https://pith.science/paper/JSCLLTGP"},"agent_actions":{"view_html":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL","download_json":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL.json","view_paper":"https://pith.science/paper/JSCLLTGP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05752&json=true","fetch_graph":"https://pith.science/api/pith-number/JSCLLTGPPDVGBCU2W7CTA6LEDL/graph.json","fetch_events":"https://pith.science/api/pith-number/JSCLLTGPPDVGBCU2W7CTA6LEDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL/action/storage_attestation","attest_author":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL/action/author_attestation","sign_citation":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL/action/citation_signature","submit_replication":"https://pith.science/pith/JSCLLTGPPDVGBCU2W7CTA6LEDL/action/replication_record"}},"created_at":"2026-05-18T00:10:42.654108+00:00","updated_at":"2026-05-18T00:10:42.654108+00:00"}