{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GNY2262QL5XDEZMBMPN7KFE6BY","short_pith_number":"pith:GNY2262Q","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"},"canonical_sha256":"3371ad7b505f6e32658163dbf5149e0e2cc586f6c199de4a288a025de3937e8e","source":{"kind":"arxiv","id":"1711.10088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10088","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10088v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10088","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"GNY2262QL5XD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GNY2262QL5XDEZMB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GNY2262Q","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GNY2262QL5XDEZMBMPN7KFE6BY","target":"record","payload":{"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"},"canonical_sha256":"3371ad7b505f6e32658163dbf5149e0e2cc586f6c199de4a288a025de3937e8e","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"},"source_kind":"arxiv","source_id":"1711.10088","source_version":1,"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:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8rXegN0L0rxZAEedw2U1WFb2k7E2BWpQXXgn++YuDSEmvr0obSzqGMDvUMsHQPHeXHSDY+UN2yJ5WLNsoKUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:48:40.188002Z"},"content_sha256":"a7094e04a72837e4c352ba39ed57f4a124faeb7b9f7d7efba281e68cecc1d4ac","schema_version":"1.0","event_id":"sha256:a7094e04a72837e4c352ba39ed57f4a124faeb7b9f7d7efba281e68cecc1d4ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GNY2262QL5XDEZMBMPN7KFE6BY","target":"graph","payload":{"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"},"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:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eInAjeDePtkP1DyzlXL9j2KU+3OoBemwvAlpfiyHnLWfabVMsGY/zf+lwwLnshGcAPLQ9OY++dl1nRsBgOgMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:48:40.188363Z"},"content_sha256":"cbcbbe6f00e2ce51f9a8fb9b1de9db6ccaba88acb7b32c776447a2e25022fa12","schema_version":"1.0","event_id":"sha256:cbcbbe6f00e2ce51f9a8fb9b1de9db6ccaba88acb7b32c776447a2e25022fa12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/bundle.json","state_url":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNY2262QL5XDEZMBMPN7KFE6BY/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-07-01T11:48:40Z","links":{"resolver":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY","bundle":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/bundle.json","state":"https://pith.science/pith/GNY2262QL5XDEZMBMPN7KFE6BY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNY2262QL5XDEZMBMPN7KFE6BY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GNY2262QL5XDEZMBMPN7KFE6BY","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":"b291bd2fbf49e304ee468bb4aeff5869d18a3818a799ea7f6b4116521d18c086","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-28T02:35:59Z","title_canon_sha256":"d9564b1bf3efe2ddb94cff7f01bdc06695c0e87b9f703dd9cf74ca3f17ed0874"},"schema_version":"1.0","source":{"id":"1711.10088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10088","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10088v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10088","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"GNY2262QL5XD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GNY2262QL5XDEZMB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GNY2262Q","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:cbcbbe6f00e2ce51f9a8fb9b1de9db6ccaba88acb7b32c776447a2e25022fa12","target":"graph","created_at":"2026-05-18T00:29:23Z","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":"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","authors_text":"Mahdi Belbasi, Martin F\\\"urer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-28T02:35:59Z","title":"Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10088","kind":"arxiv","version":1},"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:a7094e04a72837e4c352ba39ed57f4a124faeb7b9f7d7efba281e68cecc1d4ac","target":"record","created_at":"2026-05-18T00:29:23Z","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":"b291bd2fbf49e304ee468bb4aeff5869d18a3818a799ea7f6b4116521d18c086","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-28T02:35:59Z","title_canon_sha256":"d9564b1bf3efe2ddb94cff7f01bdc06695c0e87b9f703dd9cf74ca3f17ed0874"},"schema_version":"1.0","source":{"id":"1711.10088","kind":"arxiv","version":1}},"canonical_sha256":"3371ad7b505f6e32658163dbf5149e0e2cc586f6c199de4a288a025de3937e8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3371ad7b505f6e32658163dbf5149e0e2cc586f6c199de4a288a025de3937e8e","first_computed_at":"2026-05-18T00:29:23.444684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:23.444684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iZWNFe4fB5zcAkADtgMs3PNcuv4L3pQDftQWPEYkGFeh8qFI0Pqna9n0AgJm6wXK/BrG4/DwmpE4pdf/1gmOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:23.445415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7094e04a72837e4c352ba39ed57f4a124faeb7b9f7d7efba281e68cecc1d4ac","sha256:cbcbbe6f00e2ce51f9a8fb9b1de9db6ccaba88acb7b32c776447a2e25022fa12"],"state_sha256":"fc8d20cc38b55c1394a62c8bc4e753fc635d28114e331d5d04ea3b244bc1182f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QrDqXf1Hui+KvU/MB212lVupTMHPm1FNBi9GnbY2bEaONA7H+G2qjs6e693lNchkGkUHR6pSKfW6KfyMnqwcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T11:48:40.190269Z","bundle_sha256":"c76e4351f798466ca50725d15d472e1ab515a39f3a5f580b0b7d8e24f90ca911"}}