{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BFJOFX7MNROZGRAO2CG24JLDHR","short_pith_number":"pith:BFJOFX7M","schema_version":"1.0","canonical_sha256":"0952e2dfec6c5d93440ed08dae25633c410575c77e4be48a785a24b8e1572d6f","source":{"kind":"arxiv","id":"1708.07591","version":4},"attestation_state":"computed","paper":{"title":"Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ohad Trabelsi, Robert Krauthgamer","submitted_at":"2017-08-25T01:09:01Z","abstract_excerpt":"The kTree problem is a special case of Subgraph Isomorphism where the pattern graph is a tree, that is, the input is an $n$-node graph $G$ and a $k$-node tree $T$, and the goal is to determine whether $G$ has a subgraph isomorphic to $T$. We provide evidence that this problem cannot be computed significantly faster than $2^{k} \\textsf{poly}(n)$, which matches the fastest algorithm known for this problem by Koutis and Williams [ICALP 2009 and TALG 2016]. Specifically, we show that if kTree can be solved in time $(2-\\varepsilon)^k \\textsf{poly}(n)$ for some constant $\\varepsilon>0$, then Set Cov"},"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":"1708.07591","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T01:09:01Z","cross_cats_sorted":[],"title_canon_sha256":"e92a9d581884d5d8348696c54faddc8bb12e048a12caa07310e160eddb970867","abstract_canon_sha256":"f7f7461c003c2cdd199defdb06dcf839f54df46fe8188a85fd879cb0772dd3aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:03.768236Z","signature_b64":"CVutsw7vUImwt5SYlNENE2zRGQ0/ptwcZ/7y321SlEiFad8iDsUe2NgFSE+YQe6GuzAcPH20eNWorqh1gNk4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0952e2dfec6c5d93440ed08dae25633c410575c77e4be48a785a24b8e1572d6f","last_reissued_at":"2026-05-18T00:19:03.767678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:03.767678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ohad Trabelsi, Robert Krauthgamer","submitted_at":"2017-08-25T01:09:01Z","abstract_excerpt":"The kTree problem is a special case of Subgraph Isomorphism where the pattern graph is a tree, that is, the input is an $n$-node graph $G$ and a $k$-node tree $T$, and the goal is to determine whether $G$ has a subgraph isomorphic to $T$. We provide evidence that this problem cannot be computed significantly faster than $2^{k} \\textsf{poly}(n)$, which matches the fastest algorithm known for this problem by Koutis and Williams [ICALP 2009 and TALG 2016]. Specifically, we show that if kTree can be solved in time $(2-\\varepsilon)^k \\textsf{poly}(n)$ for some constant $\\varepsilon>0$, then Set Cov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07591","kind":"arxiv","version":4},"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":"1708.07591","created_at":"2026-05-18T00:19:03.767769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07591v4","created_at":"2026-05-18T00:19:03.767769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07591","created_at":"2026-05-18T00:19:03.767769+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFJOFX7MNROZ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFJOFX7MNROZGRAO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFJOFX7M","created_at":"2026-05-18T12:31:08.081275+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/BFJOFX7MNROZGRAO2CG24JLDHR","json":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR.json","graph_json":"https://pith.science/api/pith-number/BFJOFX7MNROZGRAO2CG24JLDHR/graph.json","events_json":"https://pith.science/api/pith-number/BFJOFX7MNROZGRAO2CG24JLDHR/events.json","paper":"https://pith.science/paper/BFJOFX7M"},"agent_actions":{"view_html":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR","download_json":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR.json","view_paper":"https://pith.science/paper/BFJOFX7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07591&json=true","fetch_graph":"https://pith.science/api/pith-number/BFJOFX7MNROZGRAO2CG24JLDHR/graph.json","fetch_events":"https://pith.science/api/pith-number/BFJOFX7MNROZGRAO2CG24JLDHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/action/storage_attestation","attest_author":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/action/author_attestation","sign_citation":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/action/citation_signature","submit_replication":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/action/replication_record"}},"created_at":"2026-05-18T00:19:03.767769+00:00","updated_at":"2026-05-18T00:19:03.767769+00:00"}