{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K25FRREZSSBYE2C5WG52CL2XSM","short_pith_number":"pith:K25FRREZ","schema_version":"1.0","canonical_sha256":"56ba58c499948382685db1bba12f57933f2db24efef3df1947108bdf70e909cc","source":{"kind":"arxiv","id":"1811.06799","version":1},"attestation_state":"computed","paper":{"title":"Progressive Algorithms for Domination and Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.LO"],"primary_cat":"cs.LO","authors_text":"Grzegorz Fabia\\'nski, Micha{\\l} Pilipczuk, Sebastian Siebertz, Szymon Toru\\'nczyk","submitted_at":"2018-11-16T13:33:39Z","abstract_excerpt":"We consider a generic algorithmic paradigm that we call progressive exploration, which can be used to develop simple and efficient parameterized graph algorithms. We identify two model-theoretic properties that lead to efficient progressive algorithms, namely variants of the Helly property and stability. We demonstrate our approach by giving linear-time fixed-parameter algorithms for the distance-r dominating set problem (parameterized by the solution size) in a wide variety of restricted graph classes, such as powers of nowhere dense classes, map graphs, and (for $r=1$) biclique-free graphs. "},"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":"1811.06799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T13:33:39Z","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"title_canon_sha256":"96329a705b55996c967597ee7ebd22a69c3110d61fcdd258af62515c9f40def7","abstract_canon_sha256":"2ae233b1525ef0dfcee6d16a23cbb01c82e6491204fc70bb01723a4092fe5f34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.836118Z","signature_b64":"YN3LR1QYEnsWkwfpSoGB7BjC6KN1WtIHpczeZSycArpdQk2xxWvbbOVOei3y5hcPPH0KjinlmdAhiYhLIRSODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56ba58c499948382685db1bba12f57933f2db24efef3df1947108bdf70e909cc","last_reissued_at":"2026-05-18T00:00:33.835650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.835650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Progressive Algorithms for Domination and Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.LO"],"primary_cat":"cs.LO","authors_text":"Grzegorz Fabia\\'nski, Micha{\\l} Pilipczuk, Sebastian Siebertz, Szymon Toru\\'nczyk","submitted_at":"2018-11-16T13:33:39Z","abstract_excerpt":"We consider a generic algorithmic paradigm that we call progressive exploration, which can be used to develop simple and efficient parameterized graph algorithms. We identify two model-theoretic properties that lead to efficient progressive algorithms, namely variants of the Helly property and stability. We demonstrate our approach by giving linear-time fixed-parameter algorithms for the distance-r dominating set problem (parameterized by the solution size) in a wide variety of restricted graph classes, such as powers of nowhere dense classes, map graphs, and (for $r=1$) biclique-free graphs. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06799","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":"1811.06799","created_at":"2026-05-18T00:00:33.835721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06799v1","created_at":"2026-05-18T00:00:33.835721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06799","created_at":"2026-05-18T00:00:33.835721+00:00"},{"alias_kind":"pith_short_12","alias_value":"K25FRREZSSBY","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K25FRREZSSBYE2C5","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K25FRREZ","created_at":"2026-05-18T12:32:33.847187+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/K25FRREZSSBYE2C5WG52CL2XSM","json":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM.json","graph_json":"https://pith.science/api/pith-number/K25FRREZSSBYE2C5WG52CL2XSM/graph.json","events_json":"https://pith.science/api/pith-number/K25FRREZSSBYE2C5WG52CL2XSM/events.json","paper":"https://pith.science/paper/K25FRREZ"},"agent_actions":{"view_html":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM","download_json":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM.json","view_paper":"https://pith.science/paper/K25FRREZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06799&json=true","fetch_graph":"https://pith.science/api/pith-number/K25FRREZSSBYE2C5WG52CL2XSM/graph.json","fetch_events":"https://pith.science/api/pith-number/K25FRREZSSBYE2C5WG52CL2XSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/action/storage_attestation","attest_author":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/action/author_attestation","sign_citation":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/action/citation_signature","submit_replication":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/action/replication_record"}},"created_at":"2026-05-18T00:00:33.835721+00:00","updated_at":"2026-05-18T00:00:33.835721+00:00"}