{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3Z3W2Q2WCCPH3SLQI2NO5LFTNR","short_pith_number":"pith:3Z3W2Q2W","schema_version":"1.0","canonical_sha256":"de776d4356109e7dc970469aeeacb36c628444d82cc73001f4c42eb9728fe20c","source":{"kind":"arxiv","id":"1803.06216","version":2},"attestation_state":"computed","paper":{"title":"Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Saeed Mehrabi, Sayan Bandyapadhyay, Subhash Suri","submitted_at":"2018-03-16T13:27:45Z","abstract_excerpt":"We consider the Minimum Dominating Set (MDS) problem on the intersection graphs of geometric objects. Even for simple and widely-used geometric objects such as rectangles, no sub-logarithmic approximation is known for the problem and (perhaps surprisingly) the problem is NP-hard even when all the rectangles are \"anchored\" at a diagonal line with slope -1 (Pandit, CCCG 2017). In this paper, we first show that for any $\\epsilon>0$, there exists a $(2+\\epsilon)$-approximation algorithm for the MDS problem on \"diagonal-anchored\" rectangles, providing the first $O(1)$-approximation for the problem "},"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":"1803.06216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-16T13:27:45Z","cross_cats_sorted":[],"title_canon_sha256":"07000672385f2df9df6cc23cd390e306c69cf5bfa292534f7cb90eeb58a2a9c1","abstract_canon_sha256":"cf8e70d21546951658f0703c687c12e49cbe144d7c69618d791832f349ef04cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:31.918922Z","signature_b64":"SRMIYpvk39Pc5E8yAX5jFiVkAfKpdEjFA9SWpVLIYXwK9ES803D8UXCgHmPFj3FiorLuuFdFmJVEkOsgE0dEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de776d4356109e7dc970469aeeacb36c628444d82cc73001f4c42eb9728fe20c","last_reissued_at":"2026-05-18T00:12:31.918339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:31.918339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Saeed Mehrabi, Sayan Bandyapadhyay, Subhash Suri","submitted_at":"2018-03-16T13:27:45Z","abstract_excerpt":"We consider the Minimum Dominating Set (MDS) problem on the intersection graphs of geometric objects. Even for simple and widely-used geometric objects such as rectangles, no sub-logarithmic approximation is known for the problem and (perhaps surprisingly) the problem is NP-hard even when all the rectangles are \"anchored\" at a diagonal line with slope -1 (Pandit, CCCG 2017). In this paper, we first show that for any $\\epsilon>0$, there exists a $(2+\\epsilon)$-approximation algorithm for the MDS problem on \"diagonal-anchored\" rectangles, providing the first $O(1)$-approximation for the problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06216","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":"1803.06216","created_at":"2026-05-18T00:12:31.918425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06216v2","created_at":"2026-05-18T00:12:31.918425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06216","created_at":"2026-05-18T00:12:31.918425+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z3W2Q2WCCPH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z3W2Q2WCCPH3SLQ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z3W2Q2W","created_at":"2026-05-18T12:32:05.422762+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/3Z3W2Q2WCCPH3SLQI2NO5LFTNR","json":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR.json","graph_json":"https://pith.science/api/pith-number/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/graph.json","events_json":"https://pith.science/api/pith-number/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/events.json","paper":"https://pith.science/paper/3Z3W2Q2W"},"agent_actions":{"view_html":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR","download_json":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR.json","view_paper":"https://pith.science/paper/3Z3W2Q2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06216&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/action/storage_attestation","attest_author":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/action/author_attestation","sign_citation":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/action/citation_signature","submit_replication":"https://pith.science/pith/3Z3W2Q2WCCPH3SLQI2NO5LFTNR/action/replication_record"}},"created_at":"2026-05-18T00:12:31.918425+00:00","updated_at":"2026-05-18T00:12:31.918425+00:00"}