{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:K5EQRBSNCLO7KKPMD7K3QUSM4V","short_pith_number":"pith:K5EQRBSN","schema_version":"1.0","canonical_sha256":"574908864d12ddf529ec1fd5b8524ce5530527eeb7694104433ad1af7e6ece84","source":{"kind":"arxiv","id":"2606.04572","version":1},"attestation_state":"computed","paper":{"title":"Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Tim A. Hartmann","submitted_at":"2026-06-03T08:04:16Z","abstract_excerpt":"The distance-d variants of Independent Set and Dominating Set problems have been extensively studied from different algorithmic viewpoints. In particular, the complexity of these problems are well understood on bounded-treewidth graphs [Katsikarelis, Lampis, and Paschos, Discret. Appl. Math 2022][Borradaile and Le, IPEC 2016]: given a tree decomposition of width t, the two problems can be solved in time $d^t \\cdot n^{O(1)}$ and $(2d + 1)t \\cdot n^{O(1)}$, respectively. Furthermore, assuming the Strong Exponential-Time Hypothesis (SETH), the base constants are best possible in these running tim"},"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":"2606.04572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T08:04:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0cacf2052a381c06e00ec7b62803dbde75a1ab76071fdae8175afa6cb964f373","abstract_canon_sha256":"ed9b8a129a190e03a8033f68c855b4999951766dd31670c822e938290a19a421"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:18.732635Z","signature_b64":"xG/k46mHqAscg75Ufxjwr/icndGPTBPPXtphJja34Din8klY+ZWEFzYZQGBSYWlyINH1TmnH6iYbYRnnkDCtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"574908864d12ddf529ec1fd5b8524ce5530527eeb7694104433ad1af7e6ece84","last_reissued_at":"2026-06-04T01:09:18.731777Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:18.731777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Tim A. Hartmann","submitted_at":"2026-06-03T08:04:16Z","abstract_excerpt":"The distance-d variants of Independent Set and Dominating Set problems have been extensively studied from different algorithmic viewpoints. In particular, the complexity of these problems are well understood on bounded-treewidth graphs [Katsikarelis, Lampis, and Paschos, Discret. Appl. Math 2022][Borradaile and Le, IPEC 2016]: given a tree decomposition of width t, the two problems can be solved in time $d^t \\cdot n^{O(1)}$ and $(2d + 1)t \\cdot n^{O(1)}$, respectively. Furthermore, assuming the Strong Exponential-Time Hypothesis (SETH), the base constants are best possible in these running tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04572","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.04572/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.04572","created_at":"2026-06-04T01:09:18.731918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04572v1","created_at":"2026-06-04T01:09:18.731918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04572","created_at":"2026-06-04T01:09:18.731918+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5EQRBSNCLO7","created_at":"2026-06-04T01:09:18.731918+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5EQRBSNCLO7KKPM","created_at":"2026-06-04T01:09:18.731918+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5EQRBSN","created_at":"2026-06-04T01:09:18.731918+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/K5EQRBSNCLO7KKPMD7K3QUSM4V","json":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V.json","graph_json":"https://pith.science/api/pith-number/K5EQRBSNCLO7KKPMD7K3QUSM4V/graph.json","events_json":"https://pith.science/api/pith-number/K5EQRBSNCLO7KKPMD7K3QUSM4V/events.json","paper":"https://pith.science/paper/K5EQRBSN"},"agent_actions":{"view_html":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V","download_json":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V.json","view_paper":"https://pith.science/paper/K5EQRBSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04572&json=true","fetch_graph":"https://pith.science/api/pith-number/K5EQRBSNCLO7KKPMD7K3QUSM4V/graph.json","fetch_events":"https://pith.science/api/pith-number/K5EQRBSNCLO7KKPMD7K3QUSM4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/action/storage_attestation","attest_author":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/action/author_attestation","sign_citation":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/action/citation_signature","submit_replication":"https://pith.science/pith/K5EQRBSNCLO7KKPMD7K3QUSM4V/action/replication_record"}},"created_at":"2026-06-04T01:09:18.731918+00:00","updated_at":"2026-06-04T01:09:18.731918+00:00"}