{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K25FRREZSSBYE2C5WG52CL2XSM","short_pith_number":"pith:K25FRREZ","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"},"canonical_sha256":"56ba58c499948382685db1bba12f57933f2db24efef3df1947108bdf70e909cc","source":{"kind":"arxiv","id":"1811.06799","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06799","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06799v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06799","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"K25FRREZSSBY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K25FRREZSSBYE2C5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K25FRREZ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K25FRREZSSBYE2C5WG52CL2XSM","target":"record","payload":{"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"},"canonical_sha256":"56ba58c499948382685db1bba12f57933f2db24efef3df1947108bdf70e909cc","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"},"source_kind":"arxiv","source_id":"1811.06799","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:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OBTamb9zlZ60fAGtAuBm7fnQSbTy+26DzhxaExZ143rumYn7z+5nhc91cR5CaTTlzgHRDuNXri9Zcrz4gOUvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:41:46.083399Z"},"content_sha256":"be86250003b859e5b1238bc190f73b0f54ceb08fcbb9950cb82b8360ad3ad26e","schema_version":"1.0","event_id":"sha256:be86250003b859e5b1238bc190f73b0f54ceb08fcbb9950cb82b8360ad3ad26e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K25FRREZSSBYE2C5WG52CL2XSM","target":"graph","payload":{"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"},"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:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQ6Lc8R6mLs1/44W+ABvZPwqegSlxTxtZNEjVuNqg4Mo+3wa9MOWCazOHXQ4wRIwg+EeDP00sbcL8eD1OiYdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:41:46.084060Z"},"content_sha256":"e233d72d68c08c39e021f459e198c356a2c6c804bfc1ede5806706e80b94f71e","schema_version":"1.0","event_id":"sha256:e233d72d68c08c39e021f459e198c356a2c6c804bfc1ede5806706e80b94f71e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/bundle.json","state_url":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K25FRREZSSBYE2C5WG52CL2XSM/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-05-26T23:41:46Z","links":{"resolver":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM","bundle":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/bundle.json","state":"https://pith.science/pith/K25FRREZSSBYE2C5WG52CL2XSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K25FRREZSSBYE2C5WG52CL2XSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K25FRREZSSBYE2C5WG52CL2XSM","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":"2ae233b1525ef0dfcee6d16a23cbb01c82e6491204fc70bb01723a4092fe5f34","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T13:33:39Z","title_canon_sha256":"96329a705b55996c967597ee7ebd22a69c3110d61fcdd258af62515c9f40def7"},"schema_version":"1.0","source":{"id":"1811.06799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06799","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06799v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06799","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"K25FRREZSSBY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K25FRREZSSBYE2C5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K25FRREZ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:e233d72d68c08c39e021f459e198c356a2c6c804bfc1ede5806706e80b94f71e","target":"graph","created_at":"2026-05-18T00:00:33Z","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":"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. ","authors_text":"Grzegorz Fabia\\'nski, Micha{\\l} Pilipczuk, Sebastian Siebertz, Szymon Toru\\'nczyk","cross_cats":["cs.DM","math.CO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T13:33:39Z","title":"Progressive Algorithms for Domination and Independence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06799","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:be86250003b859e5b1238bc190f73b0f54ceb08fcbb9950cb82b8360ad3ad26e","target":"record","created_at":"2026-05-18T00:00:33Z","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":"2ae233b1525ef0dfcee6d16a23cbb01c82e6491204fc70bb01723a4092fe5f34","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T13:33:39Z","title_canon_sha256":"96329a705b55996c967597ee7ebd22a69c3110d61fcdd258af62515c9f40def7"},"schema_version":"1.0","source":{"id":"1811.06799","kind":"arxiv","version":1}},"canonical_sha256":"56ba58c499948382685db1bba12f57933f2db24efef3df1947108bdf70e909cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56ba58c499948382685db1bba12f57933f2db24efef3df1947108bdf70e909cc","first_computed_at":"2026-05-18T00:00:33.835650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.835650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YN3LR1QYEnsWkwfpSoGB7BjC6KN1WtIHpczeZSycArpdQk2xxWvbbOVOei3y5hcPPH0KjinlmdAhiYhLIRSODg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.836118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be86250003b859e5b1238bc190f73b0f54ceb08fcbb9950cb82b8360ad3ad26e","sha256:e233d72d68c08c39e021f459e198c356a2c6c804bfc1ede5806706e80b94f71e"],"state_sha256":"c7c82465344992f972ae479513126de66b377867f00ccaf5d0e477d4157e517c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bX4c76BQNR5LoZ6L8U7K3053ERlctB3OGMmx88SAJbWjXz8nwhcb7dwZC2M5h4V8n/tw7R7pzkxw4PUtpBH5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:41:46.087424Z","bundle_sha256":"f16937113526c4334779985126e7cfa96ae063747fc396b28b2ae73e1a762448"}}