{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BFJOFX7MNROZGRAO2CG24JLDHR","short_pith_number":"pith:BFJOFX7M","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"},"canonical_sha256":"0952e2dfec6c5d93440ed08dae25633c410575c77e4be48a785a24b8e1572d6f","source":{"kind":"arxiv","id":"1708.07591","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07591","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07591v4","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07591","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"BFJOFX7MNROZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BFJOFX7MNROZGRAO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BFJOFX7M","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BFJOFX7MNROZGRAO2CG24JLDHR","target":"record","payload":{"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"},"canonical_sha256":"0952e2dfec6c5d93440ed08dae25633c410575c77e4be48a785a24b8e1572d6f","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"},"source_kind":"arxiv","source_id":"1708.07591","source_version":4,"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-18T00:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgWwTuM7+xU81rQcEx8glDms2VUC0z8ZvI9I/ccrfhoUigZEjeADpZveEyq4+8SKiwHj++QdAZPMrNZcuJpICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:25:14.240732Z"},"content_sha256":"368a1574ebf897fec15fc753c4427489d37ce8979bae472a4b232072b31ed4ed","schema_version":"1.0","event_id":"sha256:368a1574ebf897fec15fc753c4427489d37ce8979bae472a4b232072b31ed4ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BFJOFX7MNROZGRAO2CG24JLDHR","target":"graph","payload":{"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"},"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-18T00:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UF/WRGsxursy5QWB/5UxAfbtiGMV+bZ3enUNjYuk+ybc05rColjkIbGWVfjvmtPLzbiMVtQM6qE/R9eGniMeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:25:14.241089Z"},"content_sha256":"e66ba9ebaa569e6f2e50ece80247046a2b23aa028ecbab0adca1a8c7e692b2d6","schema_version":"1.0","event_id":"sha256:e66ba9ebaa569e6f2e50ece80247046a2b23aa028ecbab0adca1a8c7e692b2d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/bundle.json","state_url":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BFJOFX7MNROZGRAO2CG24JLDHR/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-01T18:25:14Z","links":{"resolver":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR","bundle":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/bundle.json","state":"https://pith.science/pith/BFJOFX7MNROZGRAO2CG24JLDHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BFJOFX7MNROZGRAO2CG24JLDHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BFJOFX7MNROZGRAO2CG24JLDHR","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":"f7f7461c003c2cdd199defdb06dcf839f54df46fe8188a85fd879cb0772dd3aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T01:09:01Z","title_canon_sha256":"e92a9d581884d5d8348696c54faddc8bb12e048a12caa07310e160eddb970867"},"schema_version":"1.0","source":{"id":"1708.07591","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07591","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07591v4","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07591","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"BFJOFX7MNROZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BFJOFX7MNROZGRAO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BFJOFX7M","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:e66ba9ebaa569e6f2e50ece80247046a2b23aa028ecbab0adca1a8c7e692b2d6","target":"graph","created_at":"2026-05-18T00:19:03Z","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":"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","authors_text":"Ohad Trabelsi, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T01:09:01Z","title":"Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07591","kind":"arxiv","version":4},"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:368a1574ebf897fec15fc753c4427489d37ce8979bae472a4b232072b31ed4ed","target":"record","created_at":"2026-05-18T00:19:03Z","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":"f7f7461c003c2cdd199defdb06dcf839f54df46fe8188a85fd879cb0772dd3aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-25T01:09:01Z","title_canon_sha256":"e92a9d581884d5d8348696c54faddc8bb12e048a12caa07310e160eddb970867"},"schema_version":"1.0","source":{"id":"1708.07591","kind":"arxiv","version":4}},"canonical_sha256":"0952e2dfec6c5d93440ed08dae25633c410575c77e4be48a785a24b8e1572d6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0952e2dfec6c5d93440ed08dae25633c410575c77e4be48a785a24b8e1572d6f","first_computed_at":"2026-05-18T00:19:03.767678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:03.767678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CVutsw7vUImwt5SYlNENE2zRGQ0/ptwcZ/7y321SlEiFad8iDsUe2NgFSE+YQe6GuzAcPH20eNWorqh1gNk4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:03.768236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07591","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:368a1574ebf897fec15fc753c4427489d37ce8979bae472a4b232072b31ed4ed","sha256:e66ba9ebaa569e6f2e50ece80247046a2b23aa028ecbab0adca1a8c7e692b2d6"],"state_sha256":"401b41b760b0f9e80e8153c40f832345b3bad661f2202df7409c6ebe8aa949de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/opU87jkmmjL1mstXitXxH4+ITPpBhgV0b8LtTHYW2dsmvyPfuSflU49LpoupE4c+hdJP3DBz5crK/udf+KYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:25:14.243143Z","bundle_sha256":"761b5ef005bb384d19a30c913658ed2333367222f4b0e7fa6930a65d82f3b2ee"}}