{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:55I2TKB5WDBJUUURWAZ7BKIZSK","short_pith_number":"pith:55I2TKB5","schema_version":"1.0","canonical_sha256":"ef51a9a83db0c29a5291b033f0a919929e8b668c475b4ef512a570ab9a31ef51","source":{"kind":"arxiv","id":"2607.22384","version":1},"attestation_state":"computed","paper":{"title":"Dynamic domination and independence in sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Bart{\\l}omiej Bosek, Micha{\\l} Pilipczuk, Wojciech Nadara","submitted_at":"2026-07-24T15:10:32Z","abstract_excerpt":"Let $\\mathscr{C}$ be a class of graphs of bounded expansion and $r,k\\in \\mathbb{N}$ be fixed. We give a dynamic data structure that for a given dynamic graph $G$, updated by edge insertions and deletions subject to the promise that $G\\in \\mathscr{C}$ at all times, maintains the answer to the following two queries: (a) Does $G$ contain a distance-$r$ dominating set of size $k$? (b) Does $G$ contain a distance-$r$ independent set of size $k$? The data structure is randomized with error probability bounded by $\\varepsilon$, for a parameter $\\varepsilon>0$ fixed upon the initialization. The amorti"},"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":"2607.22384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-24T15:10:32Z","cross_cats_sorted":[],"title_canon_sha256":"45a78d344d0b880ad780b3c4330ec36bea203ce248ec72c5aaf110f88aa2b968","abstract_canon_sha256":"a043c20d571131f9af73ea5faf1c703d8a242a638cfb792611b081ae576705c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-27T01:21:17.706111Z","signature_b64":"9wmMlJORDCTXbQSCHhaaEPUJVQ1Uk1sBdPNSrmRtQLB2Iuka1zdLtGNxILgcqunQgm2NIcByWRvBfL3Ke+/qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef51a9a83db0c29a5291b033f0a919929e8b668c475b4ef512a570ab9a31ef51","last_reissued_at":"2026-07-27T01:21:17.705268Z","signature_status":"signed_v1","first_computed_at":"2026-07-27T01:21:17.705268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic domination and independence in sparse graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Bart{\\l}omiej Bosek, Micha{\\l} Pilipczuk, Wojciech Nadara","submitted_at":"2026-07-24T15:10:32Z","abstract_excerpt":"Let $\\mathscr{C}$ be a class of graphs of bounded expansion and $r,k\\in \\mathbb{N}$ be fixed. We give a dynamic data structure that for a given dynamic graph $G$, updated by edge insertions and deletions subject to the promise that $G\\in \\mathscr{C}$ at all times, maintains the answer to the following two queries: (a) Does $G$ contain a distance-$r$ dominating set of size $k$? (b) Does $G$ contain a distance-$r$ independent set of size $k$? The data structure is randomized with error probability bounded by $\\varepsilon$, for a parameter $\\varepsilon>0$ fixed upon the initialization. The amorti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22384","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/2607.22384/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":"2607.22384","created_at":"2026-07-27T01:21:17.705713+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.22384v1","created_at":"2026-07-27T01:21:17.705713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22384","created_at":"2026-07-27T01:21:17.705713+00:00"},{"alias_kind":"pith_short_12","alias_value":"55I2TKB5WDBJ","created_at":"2026-07-27T01:21:17.705713+00:00"},{"alias_kind":"pith_short_16","alias_value":"55I2TKB5WDBJUUUR","created_at":"2026-07-27T01:21:17.705713+00:00"},{"alias_kind":"pith_short_8","alias_value":"55I2TKB5","created_at":"2026-07-27T01:21:17.705713+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/55I2TKB5WDBJUUURWAZ7BKIZSK","json":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK.json","graph_json":"https://pith.science/api/pith-number/55I2TKB5WDBJUUURWAZ7BKIZSK/graph.json","events_json":"https://pith.science/api/pith-number/55I2TKB5WDBJUUURWAZ7BKIZSK/events.json","paper":"https://pith.science/paper/55I2TKB5"},"agent_actions":{"view_html":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK","download_json":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK.json","view_paper":"https://pith.science/paper/55I2TKB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.22384&json=true","fetch_graph":"https://pith.science/api/pith-number/55I2TKB5WDBJUUURWAZ7BKIZSK/graph.json","fetch_events":"https://pith.science/api/pith-number/55I2TKB5WDBJUUURWAZ7BKIZSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK/action/storage_attestation","attest_author":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK/action/author_attestation","sign_citation":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK/action/citation_signature","submit_replication":"https://pith.science/pith/55I2TKB5WDBJUUURWAZ7BKIZSK/action/replication_record"}},"created_at":"2026-07-27T01:21:17.705713+00:00","updated_at":"2026-07-27T01:21:17.705713+00:00"}