{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GNY2262QL5XDEZMBMPN7KFE6BY","short_pith_number":"pith:GNY2262Q","schema_version":"1.0","canonical_sha256":"3371ad7b505f6e32658163dbf5149e0e2cc586f6c199de4a288a025de3937e8e","source":{"kind":"arxiv","id":"1711.10088","version":1},"attestation_state":"computed","paper":{"title":"Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahdi Belbasi, Martin F\\\"urer","submitted_at":"2017-11-28T02:35:59Z","abstract_excerpt":"An algorithm is presented that solves the Minimum Dominating Set problem exactly using polynomial space based on dynamic programming for a tree decomposition. A direct application of dynamic programming based on a tree decomposition would result in an exponential space algorithm, but we use zeta transforms to obtain a polynomial space algorithm in exchange for a moderate increase of the time. This framework was pioneered by Lokshtanov and Nederlof 2010 and adapted to a dynamic setting by F\\\"urer and Yu 2017. Our space-efficient algorithm is a parametrized algorithm based on tree-depth and tree"},"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":"1711.10088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-28T02:35:59Z","cross_cats_sorted":[],"title_canon_sha256":"d9564b1bf3efe2ddb94cff7f01bdc06695c0e87b9f703dd9cf74ca3f17ed0874","abstract_canon_sha256":"b291bd2fbf49e304ee468bb4aeff5869d18a3818a799ea7f6b4116521d18c086"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:23.445415Z","signature_b64":"iZWNFe4fB5zcAkADtgMs3PNcuv4L3pQDftQWPEYkGFeh8qFI0Pqna9n0AgJm6wXK/BrG4/DwmpE4pdf/1gmOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3371ad7b505f6e32658163dbf5149e0e2cc586f6c199de4a288a025de3937e8e","last_reissued_at":"2026-05-18T00:29:23.444684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:23.444684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahdi Belbasi, Martin F\\\"urer","submitted_at":"2017-11-28T02:35:59Z","abstract_excerpt":"An algorithm is presented that solves the Minimum Dominating Set problem exactly using polynomial space based on dynamic programming for a tree decomposition. A direct application of dynamic programming based on a tree decomposition would result in an exponential space algorithm, but we use zeta transforms to obtain a polynomial space algorithm in exchange for a moderate increase of the time. This framework was pioneered by Lokshtanov and Nederlof 2010 and adapted to a dynamic setting by F\\\"urer and Yu 2017. Our space-efficient algorithm is a parametrized algorithm based on tree-depth and tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10088","kind":"arxiv","version":1},"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":"1711.10088","created_at":"2026-05-18T00:29:23.444817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10088v1","created_at":"2026-05-18T00:29:23.444817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10088","created_at":"2026-05-18T00:29:23.444817+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNY2262QL5XD","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNY2262QL5XDEZMB","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNY2262Q","created_at":"2026-05-18T12:31:18.294218+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/GNY2262QL5XDEZMBMPN7KFE6BY","json":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY.json","graph_json":"https://pith.science/api/pith-number/GNY2262QL5XDEZMBMPN7KFE6BY/graph.json","events_json":"https://pith.science/api/pith-number/GNY2262QL5XDEZMBMPN7KFE6BY/events.json","paper":"https://pith.science/paper/GNY2262Q"},"agent_actions":{"view_html":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY","download_json":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY.json","view_paper":"https://pith.science/paper/GNY2262Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10088&json=true","fetch_graph":"https://pith.science/api/pith-number/GNY2262QL5XDEZMBMPN7KFE6BY/graph.json","fetch_events":"https://pith.science/api/pith-number/GNY2262QL5XDEZMBMPN7KFE6BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/action/storage_attestation","attest_author":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/action/author_attestation","sign_citation":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/action/citation_signature","submit_replication":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/action/replication_record"}},"created_at":"2026-05-18T00:29:23.444817+00:00","updated_at":"2026-05-18T00:29:23.444817+00:00"}