{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LFKL5BKSQD4MG4M3A7HWQJ3F63","short_pith_number":"pith:LFKL5BKS","schema_version":"1.0","canonical_sha256":"5954be855280f8c3719b07cf682765f6e6aa055b284842b8d07827b68b9bd2f0","source":{"kind":"arxiv","id":"1212.0640","version":1},"attestation_state":"computed","paper":{"title":"Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anirban Ghosh, Ritankar Mandal, Sasanka Roy, Subhas C. Nandy","submitted_at":"2012-12-04T08:50:27Z","abstract_excerpt":"Given a set ${\\cal R}=\\{R_1,R_2,..., R_n\\}$ of $n$ randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independent set (MIS) for the intersection graph $G({\\cal R})$ of the members in $\\cal R$ are both computationally hard \\cite{CC05}. For the MCC problem, it is proved that polynomial time constant factor approximation is impossible to obtain \\cite{PT11}. Though such a result is not proved yet for the MIS problem, no polynomial time constant factor approximation algorithm exists in the literature. We study the performance of g"},"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":"1212.0640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T08:50:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1d5cc2ad87b34e1b15355231fc01f5dbed7beb5597954623110db659bb6dc710","abstract_canon_sha256":"4a5a3e45c7a76499d68613908b4c188adc142898017d3d2c3fc17043a8326b36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:15.579029Z","signature_b64":"dqaEkcun/5I9MZj74rCiSGIzx7j3Xb4eRC5p7kivlHB3yK+b/T/0bNBqbPxKhPpITYOSETAn+M71vtP2jMH7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5954be855280f8c3719b07cf682765f6e6aa055b284842b8d07827b68b9bd2f0","last_reissued_at":"2026-05-18T03:39:15.578410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:15.578410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anirban Ghosh, Ritankar Mandal, Sasanka Roy, Subhas C. Nandy","submitted_at":"2012-12-04T08:50:27Z","abstract_excerpt":"Given a set ${\\cal R}=\\{R_1,R_2,..., R_n\\}$ of $n$ randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independent set (MIS) for the intersection graph $G({\\cal R})$ of the members in $\\cal R$ are both computationally hard \\cite{CC05}. For the MCC problem, it is proved that polynomial time constant factor approximation is impossible to obtain \\cite{PT11}. Though such a result is not proved yet for the MIS problem, no polynomial time constant factor approximation algorithm exists in the literature. We study the performance of g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0640","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":"1212.0640","created_at":"2026-05-18T03:39:15.578498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0640v1","created_at":"2026-05-18T03:39:15.578498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0640","created_at":"2026-05-18T03:39:15.578498+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFKL5BKSQD4M","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFKL5BKSQD4MG4M3","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFKL5BKS","created_at":"2026-05-18T12:27:14.488303+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/LFKL5BKSQD4MG4M3A7HWQJ3F63","json":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63.json","graph_json":"https://pith.science/api/pith-number/LFKL5BKSQD4MG4M3A7HWQJ3F63/graph.json","events_json":"https://pith.science/api/pith-number/LFKL5BKSQD4MG4M3A7HWQJ3F63/events.json","paper":"https://pith.science/paper/LFKL5BKS"},"agent_actions":{"view_html":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63","download_json":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63.json","view_paper":"https://pith.science/paper/LFKL5BKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0640&json=true","fetch_graph":"https://pith.science/api/pith-number/LFKL5BKSQD4MG4M3A7HWQJ3F63/graph.json","fetch_events":"https://pith.science/api/pith-number/LFKL5BKSQD4MG4M3A7HWQJ3F63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/action/storage_attestation","attest_author":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/action/author_attestation","sign_citation":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/action/citation_signature","submit_replication":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/action/replication_record"}},"created_at":"2026-05-18T03:39:15.578498+00:00","updated_at":"2026-05-18T03:39:15.578498+00:00"}