{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S6X2R536ZNUH4HTMZWJZMTQA35","short_pith_number":"pith:S6X2R536","schema_version":"1.0","canonical_sha256":"97afa8f77ecb687e1e6ccd93964e00df47e1722a77fd628e29ee3567e6732e6d","source":{"kind":"arxiv","id":"1604.05172","version":2},"attestation_state":"computed","paper":{"title":"Online Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joan Boyar, Kim S. Larsen, Lene M. Favrholdt, Michal Kotrb\\v{c}\\'ik, Stephan J. Eidenbenz","submitted_at":"2016-04-18T14:16:19Z","abstract_excerpt":"This paper is devoted to the online dominating set problem and its variants. We believe the paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing the future, and being incremental, i.e., having to maintain solutions to all prefixes of the input. This is quantified through competitive analyses of online algorithms against two optimal algorithms, both knowing the entire input, but only one having to be incremental. We also consider the competitive ratio of the weaker of the two optimal algorithms against "},"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":"1604.05172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-18T14:16:19Z","cross_cats_sorted":[],"title_canon_sha256":"ae48ef13a6334447b8f6729b022cea7a5f3129669c272ed2c08cc2020143287e","abstract_canon_sha256":"5667ba0d46c2b0b32ed244daace2bf9ae379534271782ed1bc67f9bb06ee3fc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:51.601760Z","signature_b64":"um9ztRQfC5eRqMKU0on/U25lklzyVIRVrWN4ggPbOMIqQPwlM5FiUuqQYNbjM2fVzJhyz5LoqrZNY/1FOLWnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97afa8f77ecb687e1e6ccd93964e00df47e1722a77fd628e29ee3567e6732e6d","last_reissued_at":"2026-05-18T00:05:51.601049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:51.601049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joan Boyar, Kim S. Larsen, Lene M. Favrholdt, Michal Kotrb\\v{c}\\'ik, Stephan J. Eidenbenz","submitted_at":"2016-04-18T14:16:19Z","abstract_excerpt":"This paper is devoted to the online dominating set problem and its variants. We believe the paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing the future, and being incremental, i.e., having to maintain solutions to all prefixes of the input. This is quantified through competitive analyses of online algorithms against two optimal algorithms, both knowing the entire input, but only one having to be incremental. We also consider the competitive ratio of the weaker of the two optimal algorithms against "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05172","kind":"arxiv","version":2},"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":"1604.05172","created_at":"2026-05-18T00:05:51.601147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05172v2","created_at":"2026-05-18T00:05:51.601147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05172","created_at":"2026-05-18T00:05:51.601147+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6X2R536ZNUH","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6X2R536ZNUH4HTM","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6X2R536","created_at":"2026-05-18T12:30:44.179134+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/S6X2R536ZNUH4HTMZWJZMTQA35","json":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35.json","graph_json":"https://pith.science/api/pith-number/S6X2R536ZNUH4HTMZWJZMTQA35/graph.json","events_json":"https://pith.science/api/pith-number/S6X2R536ZNUH4HTMZWJZMTQA35/events.json","paper":"https://pith.science/paper/S6X2R536"},"agent_actions":{"view_html":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35","download_json":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35.json","view_paper":"https://pith.science/paper/S6X2R536","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05172&json=true","fetch_graph":"https://pith.science/api/pith-number/S6X2R536ZNUH4HTMZWJZMTQA35/graph.json","fetch_events":"https://pith.science/api/pith-number/S6X2R536ZNUH4HTMZWJZMTQA35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35/action/storage_attestation","attest_author":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35/action/author_attestation","sign_citation":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35/action/citation_signature","submit_replication":"https://pith.science/pith/S6X2R536ZNUH4HTMZWJZMTQA35/action/replication_record"}},"created_at":"2026-05-18T00:05:51.601147+00:00","updated_at":"2026-05-18T00:05:51.601147+00:00"}