{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:347MW536EX2HJFNEYOTY234MZY","short_pith_number":"pith:347MW536","schema_version":"1.0","canonical_sha256":"df3ecb777e25f47495a4c3a78d6f8cce354408c7a2a956c260366d1085706ed7","source":{"kind":"arxiv","id":"1604.04664","version":1},"attestation_state":"computed","paper":{"title":"Capacitated Dominating Set on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amariah Becker","submitted_at":"2016-04-15T23:44:38Z","abstract_excerpt":"Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph's demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacities, where the capacity and cost of a vertex can contribute to the solution at most once. Previous complexity results suggest that this problem cannot be solved (or even closely approximated) efficiently"},"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.04664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-15T23:44:38Z","cross_cats_sorted":[],"title_canon_sha256":"b412f06e4a90edd6ca095bd4c24c4e13dc467b6a22d5b04d147fe9985026dfd7","abstract_canon_sha256":"4c3702191f26ebd4ecbba705586e22339f0e320f303286751e0ea310e1d2bc0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:59.055381Z","signature_b64":"trcCCChRUWwyHnuqWmbvG3KJF2rMzbFddlXLPMA2IJ+SkGGkoBuSvCgooYRFA1wSwI9k+0s5AqyhwdCKm1QNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df3ecb777e25f47495a4c3a78d6f8cce354408c7a2a956c260366d1085706ed7","last_reissued_at":"2026-05-18T01:16:59.054809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:59.054809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacitated Dominating Set on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amariah Becker","submitted_at":"2016-04-15T23:44:38Z","abstract_excerpt":"Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph's demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacities, where the capacity and cost of a vertex can contribute to the solution at most once. Previous complexity results suggest that this problem cannot be solved (or even closely approximated) efficiently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04664","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":"1604.04664","created_at":"2026-05-18T01:16:59.054891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04664v1","created_at":"2026-05-18T01:16:59.054891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04664","created_at":"2026-05-18T01:16:59.054891+00:00"},{"alias_kind":"pith_short_12","alias_value":"347MW536EX2H","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"347MW536EX2HJFNE","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"347MW536","created_at":"2026-05-18T12:29:55.572404+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/347MW536EX2HJFNEYOTY234MZY","json":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY.json","graph_json":"https://pith.science/api/pith-number/347MW536EX2HJFNEYOTY234MZY/graph.json","events_json":"https://pith.science/api/pith-number/347MW536EX2HJFNEYOTY234MZY/events.json","paper":"https://pith.science/paper/347MW536"},"agent_actions":{"view_html":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY","download_json":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY.json","view_paper":"https://pith.science/paper/347MW536","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04664&json=true","fetch_graph":"https://pith.science/api/pith-number/347MW536EX2HJFNEYOTY234MZY/graph.json","fetch_events":"https://pith.science/api/pith-number/347MW536EX2HJFNEYOTY234MZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY/action/storage_attestation","attest_author":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY/action/author_attestation","sign_citation":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY/action/citation_signature","submit_replication":"https://pith.science/pith/347MW536EX2HJFNEYOTY234MZY/action/replication_record"}},"created_at":"2026-05-18T01:16:59.054891+00:00","updated_at":"2026-05-18T01:16:59.054891+00:00"}