{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GDHWPXT6MFNFDOCGBR4DMU6TUN","short_pith_number":"pith:GDHWPXT6","schema_version":"1.0","canonical_sha256":"30cf67de7e615a51b8460c783653d3a348c2ffd9798a89d02668fba600da0ebb","source":{"kind":"arxiv","id":"1704.05286","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.05286","created_at":"2026-05-18T00:26:12.857262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05286v2","created_at":"2026-05-18T00:26:12.857262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05286","created_at":"2026-05-18T00:26:12.857262+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDHWPXT6MFNF","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDHWPXT6MFNFDOCG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDHWPXT6","created_at":"2026-05-18T12:31:15.632608+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/GDHWPXT6MFNFDOCGBR4DMU6TUN","json":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN.json","graph_json":"https://pith.science/api/pith-number/GDHWPXT6MFNFDOCGBR4DMU6TUN/graph.json","events_json":"https://pith.science/api/pith-number/GDHWPXT6MFNFDOCGBR4DMU6TUN/events.json","paper":"https://pith.science/paper/GDHWPXT6"},"agent_actions":{"view_html":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN","download_json":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN.json","view_paper":"https://pith.science/paper/GDHWPXT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05286&json=true","fetch_graph":"https://pith.science/api/pith-number/GDHWPXT6MFNFDOCGBR4DMU6TUN/graph.json","fetch_events":"https://pith.science/api/pith-number/GDHWPXT6MFNFDOCGBR4DMU6TUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/action/storage_attestation","attest_author":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/action/author_attestation","sign_citation":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/action/citation_signature","submit_replication":"https://pith.science/pith/GDHWPXT6MFNFDOCGBR4DMU6TUN/action/replication_record"}},"created_at":"2026-05-18T00:26:12.857262+00:00","updated_at":"2026-05-18T00:26:12.857262+00:00"}