{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KHGDTQKDFQD6SOKYJNONQDR3G4","short_pith_number":"pith:KHGDTQKD","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"},"canonical_sha256":"51cc39c1432c07e939584b5cd80e3b371ad66d4a929ee585cd9db4cd475d7058","source":{"kind":"arxiv","id":"1609.06147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06147","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06147v1","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06147","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"KHGDTQKDFQD6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KHGDTQKDFQD6SOKY","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KHGDTQKD","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KHGDTQKDFQD6SOKYJNONQDR3G4","target":"record","payload":{"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"},"canonical_sha256":"51cc39c1432c07e939584b5cd80e3b371ad66d4a929ee585cd9db4cd475d7058","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"},"source_kind":"arxiv","source_id":"1609.06147","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"np4WgXyBjPIhnZ4ZVdrRxgtTYk/aXYg3vJmJ4KKnR473hOI1UysCcA3OGslL76YOrwO6JpNl4gagbWTkZZI8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:23:45.723598Z"},"content_sha256":"81ae4e75e759b755d15175792f2da3338d43fe653a013bf1e53bbe56031c7147","schema_version":"1.0","event_id":"sha256:81ae4e75e759b755d15175792f2da3338d43fe653a013bf1e53bbe56031c7147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KHGDTQKDFQD6SOKYJNONQDR3G4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+fwjIWg/fhJ20dED9OLIUvqSYf4J/R9CD6wRFUHNjJz4kGYZoKnjn3Qni1Mn9bnINkiD+0t8/b+54DHu5eSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:23:45.724274Z"},"content_sha256":"ffc1d1d8cf3aefb035014b955f93046c45b55dd57a53df1b6eeb23280ca125ca","schema_version":"1.0","event_id":"sha256:ffc1d1d8cf3aefb035014b955f93046c45b55dd57a53df1b6eeb23280ca125ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/bundle.json","state_url":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T01:23:45Z","links":{"resolver":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4","bundle":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/bundle.json","state":"https://pith.science/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHGDTQKDFQD6SOKYJNONQDR3G4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KHGDTQKDFQD6SOKYJNONQDR3G4","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":"5516281df66e461849e871209f2f0d821e83dc75b96e16294eb27586b865cd12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T13:11:10Z","title_canon_sha256":"6d592190f6c20198afdb397919d6d8054fd3b2a682afd1d7bce081cfeee1d028"},"schema_version":"1.0","source":{"id":"1609.06147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06147","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06147v1","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06147","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"KHGDTQKDFQD6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KHGDTQKDFQD6SOKY","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KHGDTQKD","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:ffc1d1d8cf3aefb035014b955f93046c45b55dd57a53df1b6eeb23280ca125ca","target":"graph","created_at":"2026-05-18T01:04:16Z","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"},"paper":{"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","authors_text":"Andrew Treglown, Jie Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T13:11:10Z","title":"The complexity of perfect matchings and packings in dense hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06147","kind":"arxiv","version":1},"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:81ae4e75e759b755d15175792f2da3338d43fe653a013bf1e53bbe56031c7147","target":"record","created_at":"2026-05-18T01:04:16Z","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":"5516281df66e461849e871209f2f0d821e83dc75b96e16294eb27586b865cd12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T13:11:10Z","title_canon_sha256":"6d592190f6c20198afdb397919d6d8054fd3b2a682afd1d7bce081cfeee1d028"},"schema_version":"1.0","source":{"id":"1609.06147","kind":"arxiv","version":1}},"canonical_sha256":"51cc39c1432c07e939584b5cd80e3b371ad66d4a929ee585cd9db4cd475d7058","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51cc39c1432c07e939584b5cd80e3b371ad66d4a929ee585cd9db4cd475d7058","first_computed_at":"2026-05-18T01:04:16.519926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:16.519926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TO8bPm3qa3e+BGvJEwxGcU4mPwBPP1uYs16PuOpPTwWJyXj8CGoRhCb6yk5cxEglxK5iASii+n+0OIKuRU5tAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:16.520350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81ae4e75e759b755d15175792f2da3338d43fe653a013bf1e53bbe56031c7147","sha256:ffc1d1d8cf3aefb035014b955f93046c45b55dd57a53df1b6eeb23280ca125ca"],"state_sha256":"dc5338245eda5252f3554ff41782ec3f485018077a1d181615349f730b7accb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmnPbpHX/CwwX31gXC15aNwaXPiSagZMEcz0WC/FKGKK758EuVGWpHMduWuMrUotV0ESWKv74KPNOK11fiyLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:23:45.727949Z","bundle_sha256":"4730cfd672294041ab2c8ae8a79a9d13136bdcd5bcee18f72c36c776758c0f71"}}