{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LFKL5BKSQD4MG4M3A7HWQJ3F63","short_pith_number":"pith:LFKL5BKS","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"},"canonical_sha256":"5954be855280f8c3719b07cf682765f6e6aa055b284842b8d07827b68b9bd2f0","source":{"kind":"arxiv","id":"1212.0640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0640","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0640v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0640","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"LFKL5BKSQD4M","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LFKL5BKSQD4MG4M3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LFKL5BKS","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LFKL5BKSQD4MG4M3A7HWQJ3F63","target":"record","payload":{"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"},"canonical_sha256":"5954be855280f8c3719b07cf682765f6e6aa055b284842b8d07827b68b9bd2f0","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"},"source_kind":"arxiv","source_id":"1212.0640","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Av2ZwsVrxGsdTKupXhBpJCTGOM2xrzpJZgTsJhe/GIUpEeEYHRIgKA8oAsltMgBWvMqE7CR2kFfOl4Y19+FJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:26:28.104874Z"},"content_sha256":"33f597ba888c80a879da65f590ac556bf43971b878c83e2a48b8f080385a91a9","schema_version":"1.0","event_id":"sha256:33f597ba888c80a879da65f590ac556bf43971b878c83e2a48b8f080385a91a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LFKL5BKSQD4MG4M3A7HWQJ3F63","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFboW1qlp/HWbI2j7pX+7jNNNKZhpZ705z9t3Y8w+M1Tsa+IcfsyyoLq2gi6ZDBu4flUgoS/9RKLrMM/AkO5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:26:28.105603Z"},"content_sha256":"f6c0004a1624c2b7f393cdda55fbbf4c2338198900abd11267dadb1cd6c7e40b","schema_version":"1.0","event_id":"sha256:f6c0004a1624c2b7f393cdda55fbbf4c2338198900abd11267dadb1cd6c7e40b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/bundle.json","state_url":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T21:26:28Z","links":{"resolver":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63","bundle":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/bundle.json","state":"https://pith.science/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFKL5BKSQD4MG4M3A7HWQJ3F63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LFKL5BKSQD4MG4M3A7HWQJ3F63","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a5a3e45c7a76499d68613908b4c188adc142898017d3d2c3fc17043a8326b36","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T08:50:27Z","title_canon_sha256":"1d5cc2ad87b34e1b15355231fc01f5dbed7beb5597954623110db659bb6dc710"},"schema_version":"1.0","source":{"id":"1212.0640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0640","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0640v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0640","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"LFKL5BKSQD4M","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LFKL5BKSQD4MG4M3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LFKL5BKS","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:f6c0004a1624c2b7f393cdda55fbbf4c2338198900abd11267dadb1cd6c7e40b","target":"graph","created_at":"2026-05-18T03:39:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anirban Ghosh, Ritankar Mandal, Sasanka Roy, Subhas C. Nandy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T08:50:27Z","title":"Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0640","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:33f597ba888c80a879da65f590ac556bf43971b878c83e2a48b8f080385a91a9","target":"record","created_at":"2026-05-18T03:39:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4a5a3e45c7a76499d68613908b4c188adc142898017d3d2c3fc17043a8326b36","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-12-04T08:50:27Z","title_canon_sha256":"1d5cc2ad87b34e1b15355231fc01f5dbed7beb5597954623110db659bb6dc710"},"schema_version":"1.0","source":{"id":"1212.0640","kind":"arxiv","version":1}},"canonical_sha256":"5954be855280f8c3719b07cf682765f6e6aa055b284842b8d07827b68b9bd2f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5954be855280f8c3719b07cf682765f6e6aa055b284842b8d07827b68b9bd2f0","first_computed_at":"2026-05-18T03:39:15.578410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:15.578410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dqaEkcun/5I9MZj74rCiSGIzx7j3Xb4eRC5p7kivlHB3yK+b/T/0bNBqbPxKhPpITYOSETAn+M71vtP2jMH7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:15.579029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33f597ba888c80a879da65f590ac556bf43971b878c83e2a48b8f080385a91a9","sha256:f6c0004a1624c2b7f393cdda55fbbf4c2338198900abd11267dadb1cd6c7e40b"],"state_sha256":"b23e5da01ac01dbf8b3b1bbc8fbf5a03c4718b1d08eb7855923e4a8b1898a39d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4a0kohxEcIs/vaYOi76ANUgY2b1fLymNJ8ZDl4mwbXBXAdYjoUwF6MpN5W4we+g54Snl/WzcQeedbq52hP8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:26:28.109207Z","bundle_sha256":"38f3f090fddbd1f4f6fc6f6bbfaff5fe36aca70922d4e97945b09a40d94587da"}}