{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:V7MR7IDTI6B4NYUK7IDIZL6VIF","short_pith_number":"pith:V7MR7IDT","canonical_record":{"source":{"id":"1102.1006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-04T19:59:12Z","cross_cats_sorted":["cs.DM","cs.DS","q-bio.PE"],"title_canon_sha256":"5641dd08a3e971708d79a7aa4f479c1005725da2322e1ed23c3d673ad937d408","abstract_canon_sha256":"2a5d8e6fc606e82c1c015a5ae108ef5bdb1682024be95b838580df0d262eed48"},"schema_version":"1.0"},"canonical_sha256":"afd91fa0734783c6e28afa068cafd5417a3007f1d5ccb36d53774b815b521e71","source":{"kind":"arxiv","id":"1102.1006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1006","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1006v1","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1006","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"V7MR7IDTI6B4","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V7MR7IDTI6B4NYUK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V7MR7IDT","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:V7MR7IDTI6B4NYUK7IDIZL6VIF","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-04T19:59:12Z","cross_cats_sorted":["cs.DM","cs.DS","q-bio.PE"],"title_canon_sha256":"5641dd08a3e971708d79a7aa4f479c1005725da2322e1ed23c3d673ad937d408","abstract_canon_sha256":"2a5d8e6fc606e82c1c015a5ae108ef5bdb1682024be95b838580df0d262eed48"},"schema_version":"1.0"},"canonical_sha256":"afd91fa0734783c6e28afa068cafd5417a3007f1d5ccb36d53774b815b521e71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:03.260507Z","signature_b64":"mUoszfJ9WQU4XEFH/gLU72r9dL8CQWenYX6pWI9H1onpfBrifIc9q5543CoGSb6113XCmA8BTdkUuYEVOozJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd91fa0734783c6e28afa068cafd5417a3007f1d5ccb36d53774b815b521e71","last_reissued_at":"2026-05-18T04:30:03.260010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:03.260010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1006","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-18T04:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3ZmJ/v8+YESlTmbD+EGeBQwRHJrLJLVkPGqcOttrr3GMyK6uktJ+uTrrWjfPP/hYmPExGadPx74VzY0Cme/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:50:17.104081Z"},"content_sha256":"5bd3775edf25d7438b3fffe91f6296e6090c445cd7c4897f09765a48dc6f4d05","schema_version":"1.0","event_id":"sha256:5bd3775edf25d7438b3fffe91f6296e6090c445cd7c4897f09765a48dc6f4d05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:V7MR7IDTI6B4NYUK7IDIZL6VIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximating Four Covering and Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","q-bio.PE"],"primary_cat":"cs.CC","authors_text":"Bhaskar DasGupta, Mary Ashley, Ming-Yang Kao, Piotr Berman, Tanya Berger-Wolf, Wanpracha Chaovalitwongse","submitted_at":"2011-02-04T19:59:12Z","abstract_excerpt":"In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from full-sibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their approximability properties differ considerably. Our inapproximability constant for the triangle packing problem improves upon the previous results; this is done by directly transforming the inapproximabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1006","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-18T04:30:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mInJNgA8oge/HgZgcnZlam5hyb/qsbeM5cHBw/0U3ESwxqTjtWQh+K0lEqDnB345BFD62Bx/UlvcXtsqNZejBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:50:17.104710Z"},"content_sha256":"13174658fc5de11714ca13e02ad94114816419acd0e18989ae1bf93c17dc04ce","schema_version":"1.0","event_id":"sha256:13174658fc5de11714ca13e02ad94114816419acd0e18989ae1bf93c17dc04ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7MR7IDTI6B4NYUK7IDIZL6VIF/bundle.json","state_url":"https://pith.science/pith/V7MR7IDTI6B4NYUK7IDIZL6VIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7MR7IDTI6B4NYUK7IDIZL6VIF/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-05-28T19:50:17Z","links":{"resolver":"https://pith.science/pith/V7MR7IDTI6B4NYUK7IDIZL6VIF","bundle":"https://pith.science/pith/V7MR7IDTI6B4NYUK7IDIZL6VIF/bundle.json","state":"https://pith.science/pith/V7MR7IDTI6B4NYUK7IDIZL6VIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7MR7IDTI6B4NYUK7IDIZL6VIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:V7MR7IDTI6B4NYUK7IDIZL6VIF","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":"2a5d8e6fc606e82c1c015a5ae108ef5bdb1682024be95b838580df0d262eed48","cross_cats_sorted":["cs.DM","cs.DS","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-04T19:59:12Z","title_canon_sha256":"5641dd08a3e971708d79a7aa4f479c1005725da2322e1ed23c3d673ad937d408"},"schema_version":"1.0","source":{"id":"1102.1006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1006","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1006v1","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1006","created_at":"2026-05-18T04:30:03Z"},{"alias_kind":"pith_short_12","alias_value":"V7MR7IDTI6B4","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"V7MR7IDTI6B4NYUK","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"V7MR7IDT","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:13174658fc5de11714ca13e02ad94114816419acd0e18989ae1bf93c17dc04ce","target":"graph","created_at":"2026-05-18T04:30:03Z","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":"In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from full-sibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their approximability properties differ considerably. Our inapproximability constant for the triangle packing problem improves upon the previous results; this is done by directly transforming the inapproximabilit","authors_text":"Bhaskar DasGupta, Mary Ashley, Ming-Yang Kao, Piotr Berman, Tanya Berger-Wolf, Wanpracha Chaovalitwongse","cross_cats":["cs.DM","cs.DS","q-bio.PE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-04T19:59:12Z","title":"On Approximating Four Covering and Packing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1006","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:5bd3775edf25d7438b3fffe91f6296e6090c445cd7c4897f09765a48dc6f4d05","target":"record","created_at":"2026-05-18T04:30:03Z","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":"2a5d8e6fc606e82c1c015a5ae108ef5bdb1682024be95b838580df0d262eed48","cross_cats_sorted":["cs.DM","cs.DS","q-bio.PE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-04T19:59:12Z","title_canon_sha256":"5641dd08a3e971708d79a7aa4f479c1005725da2322e1ed23c3d673ad937d408"},"schema_version":"1.0","source":{"id":"1102.1006","kind":"arxiv","version":1}},"canonical_sha256":"afd91fa0734783c6e28afa068cafd5417a3007f1d5ccb36d53774b815b521e71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afd91fa0734783c6e28afa068cafd5417a3007f1d5ccb36d53774b815b521e71","first_computed_at":"2026-05-18T04:30:03.260010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:03.260010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mUoszfJ9WQU4XEFH/gLU72r9dL8CQWenYX6pWI9H1onpfBrifIc9q5543CoGSb6113XCmA8BTdkUuYEVOozJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:03.260507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bd3775edf25d7438b3fffe91f6296e6090c445cd7c4897f09765a48dc6f4d05","sha256:13174658fc5de11714ca13e02ad94114816419acd0e18989ae1bf93c17dc04ce"],"state_sha256":"d9166cd64ba7936c43971d53fa9a494368921fdc74ce7012031f33b3adbd033f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dm2sPhOzJEx3zT5JN1g8RvRPndt9Snit8nsH8baZCIbjpOAePwd3cvJaB6T4JldFIUBrqEpBwk9Sw0NjlgjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:50:17.108186Z","bundle_sha256":"4767339c59d464f0ce1779def120bae2aabd5200a6bda05363e6b992aede4978"}}