{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:43QM3OEOKK3PXNEWZZJADU6RZT","short_pith_number":"pith:43QM3OEO","canonical_record":{"source":{"id":"1410.0855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T14:04:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b1efb4505530683c2a6d692540d9a005759222bdde1b989c91684a1e1fac55e9","abstract_canon_sha256":"79b930c27d566aa0afb02b32d90e4a4b06b872985236cb32e2839474cd0b6a04"},"schema_version":"1.0"},"canonical_sha256":"e6e0cdb88e52b6fbb496ce5201d3d1ccf5a83bea2e1c854942ec134b63770fed","source":{"kind":"arxiv","id":"1410.0855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0855","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0855v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0855","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"43QM3OEOKK3P","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"43QM3OEOKK3PXNEW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"43QM3OEO","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:43QM3OEOKK3PXNEWZZJADU6RZT","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T14:04:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b1efb4505530683c2a6d692540d9a005759222bdde1b989c91684a1e1fac55e9","abstract_canon_sha256":"79b930c27d566aa0afb02b32d90e4a4b06b872985236cb32e2839474cd0b6a04"},"schema_version":"1.0"},"canonical_sha256":"e6e0cdb88e52b6fbb496ce5201d3d1ccf5a83bea2e1c854942ec134b63770fed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.596343Z","signature_b64":"mtJ1ua4U0FeSx1lXFKgmWc5v3acRm2RPJlfM5s8e/jKME+KjaBW1A+xet1YBrZXlctczwVMnDTkZoCBGaqFJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e0cdb88e52b6fbb496ce5201d3d1ccf5a83bea2e1c854942ec134b63770fed","last_reissued_at":"2026-05-18T02:41:09.595978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.595978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0855","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0s7rc05BsJuHinPMj4i5Fk4INyAPxYOtkxggIgck9xRsxnGQW/Bh6eKHJFn/mxxFuXh/YJ7ouk5sOGwlMzMFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:01:48.762096Z"},"content_sha256":"732f76d0ba58f075f07d4375d9ee2ae191bcf6da0d6a92dcdf700d497d0c831b","schema_version":"1.0","event_id":"sha256:732f76d0ba58f075f07d4375d9ee2ae191bcf6da0d6a92dcdf700d497d0c831b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:43QM3OEOKK3PXNEWZZJADU6RZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, D\\'aniel Marx","submitted_at":"2014-10-03T14:04:19Z","abstract_excerpt":"We study two fundamental problems related to finding subgraphs: (1) given graphs G and H, Subgraph Test asks if H is isomorphic to a subgraph of G, (2) given graphs G, H, and an integer t, Packing asks if G contains t vertex-disjoint subgraphs isomorphic to H. For every graph class F, let F-Subgraph Test and F-Packing be the special cases of the two problems where H is restricted to be in F. Our goal is to study which classes F make the two problems tractable in one of the following senses:\n  * (randomized) polynomial-time solvable,\n  * admits a polynomial (many-one) kernel, or\n  * admits a po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0855","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOL4pOmpNCsfA1nD8F9i/gaf2+skFMq06Rb6YFBgbaOJSejXBP5WwkDmy2DUEBJcfQVvBurN7y2foVwd28eCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:01:48.762664Z"},"content_sha256":"6787d08638a7073523516d8886a5a0a660b21a38415bbbd178962809a72b8382","schema_version":"1.0","event_id":"sha256:6787d08638a7073523516d8886a5a0a660b21a38415bbbd178962809a72b8382"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43QM3OEOKK3PXNEWZZJADU6RZT/bundle.json","state_url":"https://pith.science/pith/43QM3OEOKK3PXNEWZZJADU6RZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43QM3OEOKK3PXNEWZZJADU6RZT/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-05-26T13:01:48Z","links":{"resolver":"https://pith.science/pith/43QM3OEOKK3PXNEWZZJADU6RZT","bundle":"https://pith.science/pith/43QM3OEOKK3PXNEWZZJADU6RZT/bundle.json","state":"https://pith.science/pith/43QM3OEOKK3PXNEWZZJADU6RZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43QM3OEOKK3PXNEWZZJADU6RZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:43QM3OEOKK3PXNEWZZJADU6RZT","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":"79b930c27d566aa0afb02b32d90e4a4b06b872985236cb32e2839474cd0b6a04","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T14:04:19Z","title_canon_sha256":"b1efb4505530683c2a6d692540d9a005759222bdde1b989c91684a1e1fac55e9"},"schema_version":"1.0","source":{"id":"1410.0855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0855","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0855v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0855","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"43QM3OEOKK3P","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"43QM3OEOKK3PXNEW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"43QM3OEO","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:6787d08638a7073523516d8886a5a0a660b21a38415bbbd178962809a72b8382","target":"graph","created_at":"2026-05-18T02:41:09Z","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":"We study two fundamental problems related to finding subgraphs: (1) given graphs G and H, Subgraph Test asks if H is isomorphic to a subgraph of G, (2) given graphs G, H, and an integer t, Packing asks if G contains t vertex-disjoint subgraphs isomorphic to H. For every graph class F, let F-Subgraph Test and F-Packing be the special cases of the two problems where H is restricted to be in F. Our goal is to study which classes F make the two problems tractable in one of the following senses:\n  * (randomized) polynomial-time solvable,\n  * admits a polynomial (many-one) kernel, or\n  * admits a po","authors_text":"Bart M. P. Jansen, D\\'aniel Marx","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T14:04:19Z","title":"Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0855","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:732f76d0ba58f075f07d4375d9ee2ae191bcf6da0d6a92dcdf700d497d0c831b","target":"record","created_at":"2026-05-18T02:41:09Z","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":"79b930c27d566aa0afb02b32d90e4a4b06b872985236cb32e2839474cd0b6a04","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T14:04:19Z","title_canon_sha256":"b1efb4505530683c2a6d692540d9a005759222bdde1b989c91684a1e1fac55e9"},"schema_version":"1.0","source":{"id":"1410.0855","kind":"arxiv","version":1}},"canonical_sha256":"e6e0cdb88e52b6fbb496ce5201d3d1ccf5a83bea2e1c854942ec134b63770fed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6e0cdb88e52b6fbb496ce5201d3d1ccf5a83bea2e1c854942ec134b63770fed","first_computed_at":"2026-05-18T02:41:09.595978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:09.595978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtJ1ua4U0FeSx1lXFKgmWc5v3acRm2RPJlfM5s8e/jKME+KjaBW1A+xet1YBrZXlctczwVMnDTkZoCBGaqFJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:09.596343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:732f76d0ba58f075f07d4375d9ee2ae191bcf6da0d6a92dcdf700d497d0c831b","sha256:6787d08638a7073523516d8886a5a0a660b21a38415bbbd178962809a72b8382"],"state_sha256":"2a6a1011bfd9fb20618eb33cc66252933ecea9df99556815503966f46c08f936"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3t9ROzU7pj0uwElne4EQUM5f2pzDfsrYACuenmpWxrVckv3CTjjMf4f1MJKafyzuMS9dzhNlU270dF5iikhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:01:48.765987Z","bundle_sha256":"5ab088f651c99befebd1e7a22e2aaee2ef4dc8301d4ae5da91ddc0cc50d4361b"}}