{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GDHWPXT6MFNFDOCGBR4DMU6TUN","short_pith_number":"pith:GDHWPXT6","canonical_record":{"source":{"id":"1704.05286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-18T11:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"b0ad0aaed430bb13a4b8b7eaf22ccfb185b84088c5bee545bc3e9b683579e07b","abstract_canon_sha256":"fc28b2edd05527ab99c1869dffb10e20c0135fe299e538d6b1aaf45507bf4235"},"schema_version":"1.0"},"canonical_sha256":"30cf67de7e615a51b8460c783653d3a348c2ffd9798a89d02668fba600da0ebb","source":{"kind":"arxiv","id":"1704.05286","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05286","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05286v2","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05286","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"GDHWPXT6MFNF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GDHWPXT6MFNFDOCG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GDHWPXT6","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GDHWPXT6MFNFDOCGBR4DMU6TUN","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-18T11:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"b0ad0aaed430bb13a4b8b7eaf22ccfb185b84088c5bee545bc3e9b683579e07b","abstract_canon_sha256":"fc28b2edd05527ab99c1869dffb10e20c0135fe299e538d6b1aaf45507bf4235"},"schema_version":"1.0"},"canonical_sha256":"30cf67de7e615a51b8460c783653d3a348c2ffd9798a89d02668fba600da0ebb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:12.857678Z","signature_b64":"JVJ8c9kjD3JNXzbHa78Ivg1m2Q+w7xdPy6yhQdr4XjmyyP+zH0L+GmzpBvMELOavXYB6vf/sCtkk8JTjb/XPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30cf67de7e615a51b8460c783653d3a348c2ffd9798a89d02668fba600da0ebb","last_reissued_at":"2026-05-18T00:26:12.857183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:12.857183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05286","source_version":2,"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:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jY/9Io7cde/MN0ahNK5AGrUtb095imG802MLqGbhJNit9Z54hUCv3CGqR4s3CVkdfcPFkCY9EKds3uCcOOYKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:38:16.153110Z"},"content_sha256":"d52cb596b44142df79d3fba5650bae5a045a39a646a804888ea54b4ef0f3c4e0","schema_version":"1.0","event_id":"sha256:d52cb596b44142df79d3fba5650bae5a045a39a646a804888ea54b4ef0f3c4e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GDHWPXT6MFNFDOCGBR4DMU6TUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Positive-instance driven dynamic programming for treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hisao Tamaki","submitted_at":"2017-04-18T11:58:56Z","abstract_excerpt":"Consider a dynamic programming scheme for a decision problem in which all subproblems involved are also decision problems. An implementation of such a scheme is {\\em positive-instance driven} (PID), if it generates positive subproblem instances, but not negative ones, building each on smaller positive instances.\n  We take the dynamic programming scheme due to Bouchitt\\'{e} and Todinca for treewidth computation, which is based on minimal separators and potential maximal cliques, and design a variant (for the decision version of the problem) with a natural PID implementation. The resulting algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05286","kind":"arxiv","version":2},"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:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7nK63djFl+rLznTRJDWRP70N/R+jZxKnOmaoJZPi6IumDEaeaQ4Nz+VhZR+KdNKdfuT0qeLaCCTtFB05vLPTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T20:38:16.153842Z"},"content_sha256":"ddade02708ca915f70d87445d3ad0dbdbaa1babfe20ac932d8dd6e1915a61bc9","schema_version":"1.0","event_id":"sha256:ddade02708ca915f70d87445d3ad0dbdbaa1babfe20ac932d8dd6e1915a61bc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/bundle.json","state_url":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/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-09T20:38:16Z","links":{"resolver":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN","bundle":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/bundle.json","state":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GDHWPXT6MFNFDOCGBR4DMU6TUN","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":"fc28b2edd05527ab99c1869dffb10e20c0135fe299e538d6b1aaf45507bf4235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-18T11:58:56Z","title_canon_sha256":"b0ad0aaed430bb13a4b8b7eaf22ccfb185b84088c5bee545bc3e9b683579e07b"},"schema_version":"1.0","source":{"id":"1704.05286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05286","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05286v2","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05286","created_at":"2026-05-18T00:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"GDHWPXT6MFNF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GDHWPXT6MFNFDOCG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GDHWPXT6","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:ddade02708ca915f70d87445d3ad0dbdbaa1babfe20ac932d8dd6e1915a61bc9","target":"graph","created_at":"2026-05-18T00:26:12Z","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":"Consider a dynamic programming scheme for a decision problem in which all subproblems involved are also decision problems. An implementation of such a scheme is {\\em positive-instance driven} (PID), if it generates positive subproblem instances, but not negative ones, building each on smaller positive instances.\n  We take the dynamic programming scheme due to Bouchitt\\'{e} and Todinca for treewidth computation, which is based on minimal separators and potential maximal cliques, and design a variant (for the decision version of the problem) with a natural PID implementation. The resulting algor","authors_text":"Hisao Tamaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-18T11:58:56Z","title":"Positive-instance driven dynamic programming for treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05286","kind":"arxiv","version":2},"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:d52cb596b44142df79d3fba5650bae5a045a39a646a804888ea54b4ef0f3c4e0","target":"record","created_at":"2026-05-18T00:26:12Z","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":"fc28b2edd05527ab99c1869dffb10e20c0135fe299e538d6b1aaf45507bf4235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-18T11:58:56Z","title_canon_sha256":"b0ad0aaed430bb13a4b8b7eaf22ccfb185b84088c5bee545bc3e9b683579e07b"},"schema_version":"1.0","source":{"id":"1704.05286","kind":"arxiv","version":2}},"canonical_sha256":"30cf67de7e615a51b8460c783653d3a348c2ffd9798a89d02668fba600da0ebb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30cf67de7e615a51b8460c783653d3a348c2ffd9798a89d02668fba600da0ebb","first_computed_at":"2026-05-18T00:26:12.857183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:12.857183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JVJ8c9kjD3JNXzbHa78Ivg1m2Q+w7xdPy6yhQdr4XjmyyP+zH0L+GmzpBvMELOavXYB6vf/sCtkk8JTjb/XPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:12.857678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d52cb596b44142df79d3fba5650bae5a045a39a646a804888ea54b4ef0f3c4e0","sha256:ddade02708ca915f70d87445d3ad0dbdbaa1babfe20ac932d8dd6e1915a61bc9"],"state_sha256":"a222d7d3ecfc0aca2da4ce2f50e54f77f8fefc137ba055ca14e68d3bff6f3f68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fffHD2Rc9AmrADEihZV+o1lV6fKC+S6On9ZS0YjX1dSDlfvcM5jRrBO9jgfy4nGF5AjaysIAFKpfKxrQep9FAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T20:38:16.158450Z","bundle_sha256":"f39b4f0a691ff66d35df1a0321cfe75c145c261defc3d0c335e6225675107a92"}}