{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CVA3D5WM4NVNTAO6CDLZAGOX5P","short_pith_number":"pith:CVA3D5WM","canonical_record":{"source":{"id":"1504.02876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-11T13:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"7e7bb8a315e89159d06c3e7428894ec93ff0e2eb0965dcacfafd51e6d9648f54","abstract_canon_sha256":"2c74a2bb8d1837ccecf2c170346145760f5acdad73636002b1c360efc20e1c9c"},"schema_version":"1.0"},"canonical_sha256":"1541b1f6cce36ad981de10d79019d7ebc8d480da542e16fb21587a6418fd6bac","source":{"kind":"arxiv","id":"1504.02876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02876","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02876v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02876","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"CVA3D5WM4NVN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CVA3D5WM4NVNTAO6","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CVA3D5WM","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CVA3D5WM4NVNTAO6CDLZAGOX5P","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-11T13:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"7e7bb8a315e89159d06c3e7428894ec93ff0e2eb0965dcacfafd51e6d9648f54","abstract_canon_sha256":"2c74a2bb8d1837ccecf2c170346145760f5acdad73636002b1c360efc20e1c9c"},"schema_version":"1.0"},"canonical_sha256":"1541b1f6cce36ad981de10d79019d7ebc8d480da542e16fb21587a6418fd6bac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:59.775126Z","signature_b64":"JFVHxFcWRi/PpoiyJWTq6QFNO4P6SErV0245VF3AYbK7evLdzX+YGiRaNZAFP8Yd2cuFxzOazRQ5ynHPIDTCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1541b1f6cce36ad981de10d79019d7ebc8d480da542e16fb21587a6418fd6bac","last_reissued_at":"2026-05-18T02:18:59.774659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:59.774659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02876","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:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbEq5rGHNsPzdWeH4hFkfXe6JcQZL3E1MM7yZGZ2zYs+eDQqP3Yixr2d8/OhA8XPUY+U+fab9It/j50I4UIbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:30:48.166398Z"},"content_sha256":"5397de9ed907b5f8bfd724bb468528b5410ca2eeb40c2f273ddd4f633284e4e3","schema_version":"1.0","event_id":"sha256:5397de9ed907b5f8bfd724bb468528b5410ca2eeb40c2f273ddd4f633284e4e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CVA3D5WM4NVNTAO6CDLZAGOX5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Hardness of Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, Jakub Pachocki, Marek Cygan","submitted_at":"2015-04-11T13:54:51Z","abstract_excerpt":"Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it generalizes problems such as Clique, $r$-Coloring, Hamiltonicity, Set Packing and Bandwidth. However, for all of the mentioned problems $2^{\\mathcal{O}(n)}$ time algorithms exist, so a natural and frequently asked question in the past was whether there exists a $2^{\\mathcal{O}(n)}$ time algorithm for Subgraph Isomorphism. In the monograph of Fomin and Kratsch [Sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02876","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:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCRnqt4kXjEdExGNTGe2FWVQXiy2QSP0mkiYIpD7FRs/s9q987RAoyZF4B9rYzL6/G0deFPJNe9nE2LKXn20DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:30:48.166884Z"},"content_sha256":"a6dece8f0afae802e348254867285ccfb6c3654176bdfb00d947c4dab00ed7cf","schema_version":"1.0","event_id":"sha256:a6dece8f0afae802e348254867285ccfb6c3654176bdfb00d947c4dab00ed7cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/bundle.json","state_url":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/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-26T19:30:48Z","links":{"resolver":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P","bundle":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/bundle.json","state":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CVA3D5WM4NVNTAO6CDLZAGOX5P","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":"2c74a2bb8d1837ccecf2c170346145760f5acdad73636002b1c360efc20e1c9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-11T13:54:51Z","title_canon_sha256":"7e7bb8a315e89159d06c3e7428894ec93ff0e2eb0965dcacfafd51e6d9648f54"},"schema_version":"1.0","source":{"id":"1504.02876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02876","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02876v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02876","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"CVA3D5WM4NVN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CVA3D5WM4NVNTAO6","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CVA3D5WM","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:a6dece8f0afae802e348254867285ccfb6c3654176bdfb00d947c4dab00ed7cf","target":"graph","created_at":"2026-05-18T02:18:59Z","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":"Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it generalizes problems such as Clique, $r$-Coloring, Hamiltonicity, Set Packing and Bandwidth. However, for all of the mentioned problems $2^{\\mathcal{O}(n)}$ time algorithms exist, so a natural and frequently asked question in the past was whether there exists a $2^{\\mathcal{O}(n)}$ time algorithm for Subgraph Isomorphism. In the monograph of Fomin and Kratsch [Sp","authors_text":"Arkadiusz Soca{\\l}a, Jakub Pachocki, Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-11T13:54:51Z","title":"The Hardness of Subgraph Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02876","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:5397de9ed907b5f8bfd724bb468528b5410ca2eeb40c2f273ddd4f633284e4e3","target":"record","created_at":"2026-05-18T02:18:59Z","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":"2c74a2bb8d1837ccecf2c170346145760f5acdad73636002b1c360efc20e1c9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-11T13:54:51Z","title_canon_sha256":"7e7bb8a315e89159d06c3e7428894ec93ff0e2eb0965dcacfafd51e6d9648f54"},"schema_version":"1.0","source":{"id":"1504.02876","kind":"arxiv","version":1}},"canonical_sha256":"1541b1f6cce36ad981de10d79019d7ebc8d480da542e16fb21587a6418fd6bac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1541b1f6cce36ad981de10d79019d7ebc8d480da542e16fb21587a6418fd6bac","first_computed_at":"2026-05-18T02:18:59.774659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:59.774659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JFVHxFcWRi/PpoiyJWTq6QFNO4P6SErV0245VF3AYbK7evLdzX+YGiRaNZAFP8Yd2cuFxzOazRQ5ynHPIDTCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:59.775126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5397de9ed907b5f8bfd724bb468528b5410ca2eeb40c2f273ddd4f633284e4e3","sha256:a6dece8f0afae802e348254867285ccfb6c3654176bdfb00d947c4dab00ed7cf"],"state_sha256":"2a51df1cbe6bf0d26c96ac4ba6dede5e18b1e9c6cb86a897566c87d874e233a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxmWYH0Ly9UHdKFMJgvmzXoRqjZl7euMyxaJ6Vww85/V912loV0UIXQ/+ParTnV1U4XoFMYv+PdToxIgFxn9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:30:48.169806Z","bundle_sha256":"0d6d33832401f9939f1f590b441f70ea05ba3d6f29027a49fd49bf00ecc22d1b"}}