{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4VUV6RZF6TLWGHDM6RV2VFWNXD","short_pith_number":"pith:4VUV6RZF","canonical_record":{"source":{"id":"1312.7217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T09:03:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5f529c2a50990e961526ed0f36ea548032017a74ce18fd9728ddf5bd6067bd35","abstract_canon_sha256":"b8ad3eb458ec63d7647252c440bb491a0603035c073bb3e82f011b3c7eee38b7"},"schema_version":"1.0"},"canonical_sha256":"e5695f4725f4d7631c6cf46baa96cdb8decd94af0adb71188f2ac12a6fa94155","source":{"kind":"arxiv","id":"1312.7217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7217","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7217v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7217","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"4VUV6RZF6TLW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4VUV6RZF6TLWGHDM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4VUV6RZF","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4VUV6RZF6TLWGHDM6RV2VFWNXD","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T09:03:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5f529c2a50990e961526ed0f36ea548032017a74ce18fd9728ddf5bd6067bd35","abstract_canon_sha256":"b8ad3eb458ec63d7647252c440bb491a0603035c073bb3e82f011b3c7eee38b7"},"schema_version":"1.0"},"canonical_sha256":"e5695f4725f4d7631c6cf46baa96cdb8decd94af0adb71188f2ac12a6fa94155","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.443599Z","signature_b64":"TpEJJnzN1hHz/uYHhz20HIqkDKHbyAfQf0yb6UFvGZ50U6yxDM74MX1O5hpR20oM0LLuRk1EElD44a0MeXBbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5695f4725f4d7631c6cf46baa96cdb8decd94af0adb71188f2ac12a6fa94155","last_reissued_at":"2026-05-18T03:03:45.442880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.442880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7217","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:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yC0kqU7H6oUD6jkQyIKLx1tBwg+1X3pksaUipnXeBD0BPlFR/7Rw9HcubIvwNDN7VKXz3Mvqa+wTm3MBkAojCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:35:55.422603Z"},"content_sha256":"d790dd9c04a3262db0c129ee595b583b00a78307c17af0ea42a119c3e083f0cf","schema_version":"1.0","event_id":"sha256:d790dd9c04a3262db0c129ee595b583b00a78307c17af0ea42a119c3e083f0cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4VUV6RZF6TLWGHDM6RV2VFWNXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anamitra R. Choudhury, Archita Agarwal, Sambuddha Roy, Venkatesan T. Chakaravarthy, Yogish Sabharwal","submitted_at":"2013-12-27T09:03:42Z","abstract_excerpt":"In this paper, we study a class of set cover problems that satisfy a special property which we call the {\\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval cover and tree cover. We design unified distributed and parallel algorithms that can handle any set cover problem falling under the above framework and yield constant factor approximations. These algorithms run in polylogarithmic communication rounds in the distributed setting and are in NC, in the parallel setting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7217","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:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5/h02bhbJ749p3cyceObdC9mZuxuXUzYbHBZSjceGByYhUoT74ndPuUFRyf7NzSPfQEINd636eIq3JJ/4CuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:35:55.423270Z"},"content_sha256":"13931cbe1ed8891a2ca145cf158ec1f87a006f77a7c62f8acff0cfd703d41e53","schema_version":"1.0","event_id":"sha256:13931cbe1ed8891a2ca145cf158ec1f87a006f77a7c62f8acff0cfd703d41e53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VUV6RZF6TLWGHDM6RV2VFWNXD/bundle.json","state_url":"https://pith.science/pith/4VUV6RZF6TLWGHDM6RV2VFWNXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VUV6RZF6TLWGHDM6RV2VFWNXD/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-26T07:35:55Z","links":{"resolver":"https://pith.science/pith/4VUV6RZF6TLWGHDM6RV2VFWNXD","bundle":"https://pith.science/pith/4VUV6RZF6TLWGHDM6RV2VFWNXD/bundle.json","state":"https://pith.science/pith/4VUV6RZF6TLWGHDM6RV2VFWNXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VUV6RZF6TLWGHDM6RV2VFWNXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4VUV6RZF6TLWGHDM6RV2VFWNXD","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":"b8ad3eb458ec63d7647252c440bb491a0603035c073bb3e82f011b3c7eee38b7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T09:03:42Z","title_canon_sha256":"5f529c2a50990e961526ed0f36ea548032017a74ce18fd9728ddf5bd6067bd35"},"schema_version":"1.0","source":{"id":"1312.7217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7217","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7217v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7217","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"4VUV6RZF6TLW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4VUV6RZF6TLWGHDM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4VUV6RZF","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:13931cbe1ed8891a2ca145cf158ec1f87a006f77a7c62f8acff0cfd703d41e53","target":"graph","created_at":"2026-05-18T03:03:45Z","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 study a class of set cover problems that satisfy a special property which we call the {\\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval cover and tree cover. We design unified distributed and parallel algorithms that can handle any set cover problem falling under the above framework and yield constant factor approximations. These algorithms run in polylogarithmic communication rounds in the distributed setting and are in NC, in the parallel setting.","authors_text":"Anamitra R. Choudhury, Archita Agarwal, Sambuddha Roy, Venkatesan T. Chakaravarthy, Yogish Sabharwal","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T09:03:42Z","title":"Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7217","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:d790dd9c04a3262db0c129ee595b583b00a78307c17af0ea42a119c3e083f0cf","target":"record","created_at":"2026-05-18T03:03:45Z","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":"b8ad3eb458ec63d7647252c440bb491a0603035c073bb3e82f011b3c7eee38b7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-27T09:03:42Z","title_canon_sha256":"5f529c2a50990e961526ed0f36ea548032017a74ce18fd9728ddf5bd6067bd35"},"schema_version":"1.0","source":{"id":"1312.7217","kind":"arxiv","version":1}},"canonical_sha256":"e5695f4725f4d7631c6cf46baa96cdb8decd94af0adb71188f2ac12a6fa94155","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5695f4725f4d7631c6cf46baa96cdb8decd94af0adb71188f2ac12a6fa94155","first_computed_at":"2026-05-18T03:03:45.442880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:45.442880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TpEJJnzN1hHz/uYHhz20HIqkDKHbyAfQf0yb6UFvGZ50U6yxDM74MX1O5hpR20oM0LLuRk1EElD44a0MeXBbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:45.443599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d790dd9c04a3262db0c129ee595b583b00a78307c17af0ea42a119c3e083f0cf","sha256:13931cbe1ed8891a2ca145cf158ec1f87a006f77a7c62f8acff0cfd703d41e53"],"state_sha256":"8a7746fabb7b290becddf698ac38c1193c5255dca72ebc66c8baf4b9ab7cf703"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNgDMrnoAfzhwqFDhyAGGitH9UwBunnd4CA8qcWlKxi5adfdbKId+G7FOJylQC1osGQapaWclY+qK/5AIkzfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:35:55.427058Z","bundle_sha256":"7bdf61c31d62051efaf2669f6f8e08b33b63ebd68d2c569b2b3cdbce5d4f9910"}}