{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FSEDSFLIRXDDPT2DYMZS3AWGSN","short_pith_number":"pith:FSEDSFLI","canonical_record":{"source":{"id":"1711.08041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T21:22:31Z","cross_cats_sorted":[],"title_canon_sha256":"0f8f2db0c6877a3b1783fc0dc646b92fc7a21a9ae5a9a40599f60b0352878be1","abstract_canon_sha256":"ec03e9fb647486ae320c54b02562e2f301ad51a5477f2c7ee165d7e147150054"},"schema_version":"1.0"},"canonical_sha256":"2c883915688dc637cf43c3332d82c6937ab4246a67a7dbfa9bfe9e0fb233e71b","source":{"kind":"arxiv","id":"1711.08041","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08041","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08041v3","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08041","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"FSEDSFLIRXDD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FSEDSFLIRXDDPT2D","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FSEDSFLI","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FSEDSFLIRXDDPT2DYMZS3AWGSN","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T21:22:31Z","cross_cats_sorted":[],"title_canon_sha256":"0f8f2db0c6877a3b1783fc0dc646b92fc7a21a9ae5a9a40599f60b0352878be1","abstract_canon_sha256":"ec03e9fb647486ae320c54b02562e2f301ad51a5477f2c7ee165d7e147150054"},"schema_version":"1.0"},"canonical_sha256":"2c883915688dc637cf43c3332d82c6937ab4246a67a7dbfa9bfe9e0fb233e71b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:10.403962Z","signature_b64":"GQ9Fx6LnghoykLXYHbyodMj/98S+M4bU38P9mFfbYCBm0rbRDsjddOZEMq7Uq3JQdfSqe7AK37D4BZa2idNSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c883915688dc637cf43c3332d82c6937ab4246a67a7dbfa9bfe9e0fb233e71b","last_reissued_at":"2026-05-17T23:56:10.403399Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:10.403399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08041","source_version":3,"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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+ZGbsLDmoP6WcUCn2Zv2iNQnbuokNuXjxr26CgLOZvn/S2c37eX730QVH0KzgOO/LU1U6xYVXeLrGm68cb8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:24:02.369812Z"},"content_sha256":"82577482bbb2f0fd879df7de4e14cd59e1ac838f5f7b158d23265ae8ea4d8ef9","schema_version":"1.0","event_id":"sha256:82577482bbb2f0fd879df7de4e14cd59e1ac838f5f7b158d23265ae8ea4d8ef9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FSEDSFLIRXDDPT2DYMZS3AWGSN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Set Cover Conjecture and 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-11-21T21:22:31Z","abstract_excerpt":"In the Set Cover problem, the input is a ground set of $n$ elements and a collection of $m$ sets, and the goal is to find the smallest sub-collection of sets whose union is the entire ground set. The fastest algorithm known runs in time $O(mn2^n)$ [Fomin et al., WG 2004], and the Set Cover Conjecture (SeCoCo) [Cygan et al., TALG 2016] asserts that for every fixed $\\varepsilon>0$, no algorithm can solve Set Cover in time $2^{(1-\\varepsilon)n}poly(m)$, even if set sizes are bounded by $\\Delta=\\Delta(\\varepsilon)$. We show strong connections between this problem and kTree, a special case of Subgr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08041","kind":"arxiv","version":3},"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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KN7SaEP2IOJK4B8XqkyLYI/YrI0Nuq+LhQi0zd8DEcX83rJlN1jujvCHWIMV/9ykTjQRSC6LWl/yyZTEw3gAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:24:02.370150Z"},"content_sha256":"edb567d4a7b9165cbda1c89953550a4ebe339051095a0adc21783945530a4b4b","schema_version":"1.0","event_id":"sha256:edb567d4a7b9165cbda1c89953550a4ebe339051095a0adc21783945530a4b4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSEDSFLIRXDDPT2DYMZS3AWGSN/bundle.json","state_url":"https://pith.science/pith/FSEDSFLIRXDDPT2DYMZS3AWGSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSEDSFLIRXDDPT2DYMZS3AWGSN/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-02T08:24:02Z","links":{"resolver":"https://pith.science/pith/FSEDSFLIRXDDPT2DYMZS3AWGSN","bundle":"https://pith.science/pith/FSEDSFLIRXDDPT2DYMZS3AWGSN/bundle.json","state":"https://pith.science/pith/FSEDSFLIRXDDPT2DYMZS3AWGSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSEDSFLIRXDDPT2DYMZS3AWGSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FSEDSFLIRXDDPT2DYMZS3AWGSN","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":"ec03e9fb647486ae320c54b02562e2f301ad51a5477f2c7ee165d7e147150054","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T21:22:31Z","title_canon_sha256":"0f8f2db0c6877a3b1783fc0dc646b92fc7a21a9ae5a9a40599f60b0352878be1"},"schema_version":"1.0","source":{"id":"1711.08041","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08041","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08041v3","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08041","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"FSEDSFLIRXDD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FSEDSFLIRXDDPT2D","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FSEDSFLI","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:edb567d4a7b9165cbda1c89953550a4ebe339051095a0adc21783945530a4b4b","target":"graph","created_at":"2026-05-17T23:56:10Z","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":"In the Set Cover problem, the input is a ground set of $n$ elements and a collection of $m$ sets, and the goal is to find the smallest sub-collection of sets whose union is the entire ground set. The fastest algorithm known runs in time $O(mn2^n)$ [Fomin et al., WG 2004], and the Set Cover Conjecture (SeCoCo) [Cygan et al., TALG 2016] asserts that for every fixed $\\varepsilon>0$, no algorithm can solve Set Cover in time $2^{(1-\\varepsilon)n}poly(m)$, even if set sizes are bounded by $\\Delta=\\Delta(\\varepsilon)$. We show strong connections between this problem and kTree, a special case of Subgr","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-11-21T21:22:31Z","title":"The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08041","kind":"arxiv","version":3},"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:82577482bbb2f0fd879df7de4e14cd59e1ac838f5f7b158d23265ae8ea4d8ef9","target":"record","created_at":"2026-05-17T23:56:10Z","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":"ec03e9fb647486ae320c54b02562e2f301ad51a5477f2c7ee165d7e147150054","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T21:22:31Z","title_canon_sha256":"0f8f2db0c6877a3b1783fc0dc646b92fc7a21a9ae5a9a40599f60b0352878be1"},"schema_version":"1.0","source":{"id":"1711.08041","kind":"arxiv","version":3}},"canonical_sha256":"2c883915688dc637cf43c3332d82c6937ab4246a67a7dbfa9bfe9e0fb233e71b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c883915688dc637cf43c3332d82c6937ab4246a67a7dbfa9bfe9e0fb233e71b","first_computed_at":"2026-05-17T23:56:10.403399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:10.403399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQ9Fx6LnghoykLXYHbyodMj/98S+M4bU38P9mFfbYCBm0rbRDsjddOZEMq7Uq3JQdfSqe7AK37D4BZa2idNSCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:10.403962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08041","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82577482bbb2f0fd879df7de4e14cd59e1ac838f5f7b158d23265ae8ea4d8ef9","sha256:edb567d4a7b9165cbda1c89953550a4ebe339051095a0adc21783945530a4b4b"],"state_sha256":"293f08311c0f5b89d2cc9c5055953b0ae253511478d57deea2cf2da488a2cf05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaXKsMAr2Bnv44g5iunjGJA0F5SuezU0Lhe8k7pobhBiIlUzZsmqU+akEGhwpv1X5x9P5yI18wqT5utoNXDkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:24:02.372111Z","bundle_sha256":"d39232ddcefc130f27cf34de43a8c69d1241c5dcbfecdd6b019134c7f3b42f94"}}