{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CVA3D5WM4NVNTAO6CDLZAGOX5P","short_pith_number":"pith:CVA3D5WM","schema_version":"1.0","canonical_sha256":"1541b1f6cce36ad981de10d79019d7ebc8d480da542e16fb21587a6418fd6bac","source":{"kind":"arxiv","id":"1504.02876","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.02876","created_at":"2026-05-18T02:18:59.774733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02876v1","created_at":"2026-05-18T02:18:59.774733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02876","created_at":"2026-05-18T02:18:59.774733+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVA3D5WM4NVN","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVA3D5WM4NVNTAO6","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVA3D5WM","created_at":"2026-05-18T12:29:17.054201+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/CVA3D5WM4NVNTAO6CDLZAGOX5P","json":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P.json","graph_json":"https://pith.science/api/pith-number/CVA3D5WM4NVNTAO6CDLZAGOX5P/graph.json","events_json":"https://pith.science/api/pith-number/CVA3D5WM4NVNTAO6CDLZAGOX5P/events.json","paper":"https://pith.science/paper/CVA3D5WM"},"agent_actions":{"view_html":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P","download_json":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P.json","view_paper":"https://pith.science/paper/CVA3D5WM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02876&json=true","fetch_graph":"https://pith.science/api/pith-number/CVA3D5WM4NVNTAO6CDLZAGOX5P/graph.json","fetch_events":"https://pith.science/api/pith-number/CVA3D5WM4NVNTAO6CDLZAGOX5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/action/storage_attestation","attest_author":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/action/author_attestation","sign_citation":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/action/citation_signature","submit_replication":"https://pith.science/pith/CVA3D5WM4NVNTAO6CDLZAGOX5P/action/replication_record"}},"created_at":"2026-05-18T02:18:59.774733+00:00","updated_at":"2026-05-18T02:18:59.774733+00:00"}