{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BVDLHUDXD2OJEKQDLQPFXP4Q7K","short_pith_number":"pith:BVDLHUDX","canonical_record":{"source":{"id":"1207.7134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-30T23:38:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cad761fc1dd15d1e7103eb82dddff8e9663dbca5ccaa559d15fb0c8d81af047c","abstract_canon_sha256":"946daa4fda2e1fedfc21a1e8c786890950026c85fc2c9c35bc8e5f2a48b32850"},"schema_version":"1.0"},"canonical_sha256":"0d46b3d0771e9c922a035c1e5bbf90fabdb6601d7ee4e1f557b14cf92d96cb47","source":{"kind":"arxiv","id":"1207.7134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7134","created_at":"2026-05-18T03:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7134v1","created_at":"2026-05-18T03:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7134","created_at":"2026-05-18T03:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"BVDLHUDXD2OJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BVDLHUDXD2OJEKQD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BVDLHUDX","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BVDLHUDXD2OJEKQDLQPFXP4Q7K","target":"record","payload":{"canonical_record":{"source":{"id":"1207.7134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-30T23:38:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cad761fc1dd15d1e7103eb82dddff8e9663dbca5ccaa559d15fb0c8d81af047c","abstract_canon_sha256":"946daa4fda2e1fedfc21a1e8c786890950026c85fc2c9c35bc8e5f2a48b32850"},"schema_version":"1.0"},"canonical_sha256":"0d46b3d0771e9c922a035c1e5bbf90fabdb6601d7ee4e1f557b14cf92d96cb47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:46.668572Z","signature_b64":"kUoT957rjIbfbmBnC6G65MEjCnYPkTQfT4JZUFcAabOTAOr2BNHcuJvl4oI1/BzP4YVM1j62mafy/kw+t+PNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d46b3d0771e9c922a035c1e5bbf90fabdb6601d7ee4e1f557b14cf92d96cb47","last_reissued_at":"2026-05-18T03:49:46.667849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:46.667849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.7134","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:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcjfN4Q9kJHDOxsrwvUjmWNyv/pgr1g7DcdKTRxo/D58Jan4AZ03r2IuFxm8D69bXh461/PxxXfevMVwWGqYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:32:42.872994Z"},"content_sha256":"741dec28d0e0f2109aac1e15c75efcda9a03698714710bca82410c1fc9a4f348","schema_version":"1.0","event_id":"sha256:741dec28d0e0f2109aac1e15c75efcda9a03698714710bca82410c1fc9a4f348"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BVDLHUDXD2OJEKQDLQPFXP4Q7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Cosmin Bonchis, Gabriel Istrate","submitted_at":"2012-07-30T23:38:52Z","abstract_excerpt":"We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased towards large sets. The algorithm is controled by the percentage of elements to which we apply the biased approach. The optimal parameter choice has a phase transition around average density $e$ and leads to improved approximation guarantees when average element frequency is less than $e$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7134","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:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W539s4YDWRsAWKlpwWTuqjTCbYWvIcyR+OOslRdK9ixYwyiSAMjK2p5h9ptGUe4yqMkEGaB8YbxdXpIySHTPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:32:42.873441Z"},"content_sha256":"ceaf8e34876bb80fab3f9f262212e8e11825ed71137fe7565c45d6df57e95375","schema_version":"1.0","event_id":"sha256:ceaf8e34876bb80fab3f9f262212e8e11825ed71137fe7565c45d6df57e95375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVDLHUDXD2OJEKQDLQPFXP4Q7K/bundle.json","state_url":"https://pith.science/pith/BVDLHUDXD2OJEKQDLQPFXP4Q7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVDLHUDXD2OJEKQDLQPFXP4Q7K/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-25T10:32:42Z","links":{"resolver":"https://pith.science/pith/BVDLHUDXD2OJEKQDLQPFXP4Q7K","bundle":"https://pith.science/pith/BVDLHUDXD2OJEKQDLQPFXP4Q7K/bundle.json","state":"https://pith.science/pith/BVDLHUDXD2OJEKQDLQPFXP4Q7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVDLHUDXD2OJEKQDLQPFXP4Q7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BVDLHUDXD2OJEKQDLQPFXP4Q7K","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":"946daa4fda2e1fedfc21a1e8c786890950026c85fc2c9c35bc8e5f2a48b32850","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-30T23:38:52Z","title_canon_sha256":"cad761fc1dd15d1e7103eb82dddff8e9663dbca5ccaa559d15fb0c8d81af047c"},"schema_version":"1.0","source":{"id":"1207.7134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7134","created_at":"2026-05-18T03:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7134v1","created_at":"2026-05-18T03:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7134","created_at":"2026-05-18T03:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"BVDLHUDXD2OJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BVDLHUDXD2OJEKQD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BVDLHUDX","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:ceaf8e34876bb80fab3f9f262212e8e11825ed71137fe7565c45d6df57e95375","target":"graph","created_at":"2026-05-18T03:49:46Z","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":"We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased towards large sets. The algorithm is controled by the percentage of elements to which we apply the biased approach. The optimal parameter choice has a phase transition around average density $e$ and leads to improved approximation guarantees when average element frequency is less than $e$.","authors_text":"Cosmin Bonchis, Gabriel Istrate","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-30T23:38:52Z","title":"Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7134","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:741dec28d0e0f2109aac1e15c75efcda9a03698714710bca82410c1fc9a4f348","target":"record","created_at":"2026-05-18T03:49:46Z","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":"946daa4fda2e1fedfc21a1e8c786890950026c85fc2c9c35bc8e5f2a48b32850","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-30T23:38:52Z","title_canon_sha256":"cad761fc1dd15d1e7103eb82dddff8e9663dbca5ccaa559d15fb0c8d81af047c"},"schema_version":"1.0","source":{"id":"1207.7134","kind":"arxiv","version":1}},"canonical_sha256":"0d46b3d0771e9c922a035c1e5bbf90fabdb6601d7ee4e1f557b14cf92d96cb47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d46b3d0771e9c922a035c1e5bbf90fabdb6601d7ee4e1f557b14cf92d96cb47","first_computed_at":"2026-05-18T03:49:46.667849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:46.667849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kUoT957rjIbfbmBnC6G65MEjCnYPkTQfT4JZUFcAabOTAOr2BNHcuJvl4oI1/BzP4YVM1j62mafy/kw+t+PNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:46.668572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.7134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:741dec28d0e0f2109aac1e15c75efcda9a03698714710bca82410c1fc9a4f348","sha256:ceaf8e34876bb80fab3f9f262212e8e11825ed71137fe7565c45d6df57e95375"],"state_sha256":"433c11ccd382d32f88f56d62a32dcf791cb7fa8e2e31e6a03b6c4b5198ad72d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5YSrSxjSayuosWLqDcLCmvW+joyzB96AonH8m1hbMqjtHFQB0QRKKoDs20G8zXzagFOe2N7vy/hdEmM3MarDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:32:42.876034Z","bundle_sha256":"35c9a985166050d2c23c89256e6bdbc903facd063c0585e0fcc8ef3aa821ced2"}}