{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KHGDTQKDFQD6SOKYJNONQDR3G4","short_pith_number":"pith:KHGDTQKD","schema_version":"1.0","canonical_sha256":"51cc39c1432c07e939584b5cd80e3b371ad66d4a929ee585cd9db4cd475d7058","source":{"kind":"arxiv","id":"1609.06147","version":1},"attestation_state":"computed","paper":{"title":"The complexity of perfect matchings and packings in dense hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Jie Han","submitted_at":"2016-09-20T13:11:10Z","abstract_excerpt":"Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case when $F$ is a single edge, a perfect $F$-packing is simply a perfect matching. For a given fixed $F$, it is often the case that the decision problem whether an $n$-vertex $k$-graph $H$ contains a perfect $F$-packing is NP-complete. Indeed, if $k \\geq 3$, the corresponding problem for perfect matchings is NP-complete whilst if $k=2$ the problem is NP-complete in the case when $F$ has a component consisting of at least $3"},"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":"1609.06147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T13:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"6d592190f6c20198afdb397919d6d8054fd3b2a682afd1d7bce081cfeee1d028","abstract_canon_sha256":"5516281df66e461849e871209f2f0d821e83dc75b96e16294eb27586b865cd12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:16.520350Z","signature_b64":"TO8bPm3qa3e+BGvJEwxGcU4mPwBPP1uYs16PuOpPTwWJyXj8CGoRhCb6yk5cxEglxK5iASii+n+0OIKuRU5tAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51cc39c1432c07e939584b5cd80e3b371ad66d4a929ee585cd9db4cd475d7058","last_reissued_at":"2026-05-18T01:04:16.519926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:16.519926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of perfect matchings and packings in dense hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Treglown, Jie Han","submitted_at":"2016-09-20T13:11:10Z","abstract_excerpt":"Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case when $F$ is a single edge, a perfect $F$-packing is simply a perfect matching. For a given fixed $F$, it is often the case that the decision problem whether an $n$-vertex $k$-graph $H$ contains a perfect $F$-packing is NP-complete. Indeed, if $k \\geq 3$, the corresponding problem for perfect matchings is NP-complete whilst if $k=2$ the problem is NP-complete in the case when $F$ has a component consisting of at least $3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06147","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":"1609.06147","created_at":"2026-05-18T01:04:16.519990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06147v1","created_at":"2026-05-18T01:04:16.519990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06147","created_at":"2026-05-18T01:04:16.519990+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHGDTQKDFQD6","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHGDTQKDFQD6SOKY","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHGDTQKD","created_at":"2026-05-18T12:30:25.849896+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/KHGDTQKDFQD6SOKYJNONQDR3G4","json":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4.json","graph_json":"https://pith.science/api/pith-number/KHGDTQKDFQD6SOKYJNONQDR3G4/graph.json","events_json":"https://pith.science/api/pith-number/KHGDTQKDFQD6SOKYJNONQDR3G4/events.json","paper":"https://pith.science/paper/KHGDTQKD"},"agent_actions":{"view_html":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4","download_json":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4.json","view_paper":"https://pith.science/paper/KHGDTQKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06147&json=true","fetch_graph":"https://pith.science/api/pith-number/KHGDTQKDFQD6SOKYJNONQDR3G4/graph.json","fetch_events":"https://pith.science/api/pith-number/KHGDTQKDFQD6SOKYJNONQDR3G4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/action/storage_attestation","attest_author":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/action/author_attestation","sign_citation":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/action/citation_signature","submit_replication":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/action/replication_record"}},"created_at":"2026-05-18T01:04:16.519990+00:00","updated_at":"2026-05-18T01:04:16.519990+00:00"}