{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:K6B4IKAM7YCINQCGUI7R6BCDZZ","short_pith_number":"pith:K6B4IKAM","canonical_record":{"source":{"id":"1901.07928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-01-23T14:49:36Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"699ff5a88f7063bd4ff60af9e10e21821af59a7d3c539cc08239445c29b55381","abstract_canon_sha256":"853525247b46c2ebb3c86674a8a8ce6f2c5f5cccc0b6932025e3f08728ae7257"},"schema_version":"1.0"},"canonical_sha256":"5783c4280cfe0486c046a23f1f0443ce420d1a862abfc4a73d74d4e85ed45ab9","source":{"kind":"arxiv","id":"1901.07928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07928","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07928v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07928","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"K6B4IKAM7YCI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K6B4IKAM7YCINQCG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K6B4IKAM","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:K6B4IKAM7YCINQCGUI7R6BCDZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-01-23T14:49:36Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"699ff5a88f7063bd4ff60af9e10e21821af59a7d3c539cc08239445c29b55381","abstract_canon_sha256":"853525247b46c2ebb3c86674a8a8ce6f2c5f5cccc0b6932025e3f08728ae7257"},"schema_version":"1.0"},"canonical_sha256":"5783c4280cfe0486c046a23f1f0443ce420d1a862abfc4a73d74d4e85ed45ab9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.464936Z","signature_b64":"bcGCTFfjIIvaAGV4JJnsMjFGsnW6CZinxCe7+qQSSPDoLuJOlUKSn+4UYIIrYwhe6Q51c4oMQdsXeu+Yw5OBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5783c4280cfe0486c046a23f1f0443ce420d1a862abfc4a73d74d4e85ed45ab9","last_reissued_at":"2026-05-17T23:55:39.464557Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.464557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07928","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjdEJaDGa7ahsRJWw3PR9hxkaqTq0XGw7ljik0Od7ZpNjbkTJucKaUeShuhhK5tOVOw8EmMBv5O4Xs+/t3vEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:16:35.484289Z"},"content_sha256":"82af0708d06eec68b7cd3a2a9522552f713074f61f58e574c16f1f40b754e4c8","schema_version":"1.0","event_id":"sha256:82af0708d06eec68b7cd3a2a9522552f713074f61f58e574c16f1f40b754e4c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:K6B4IKAM7YCINQCGUI7R6BCDZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hung Nguyen, My Thai, Phuc Thai, Tam Vu, Thang Dinh","submitted_at":"2019-01-23T14:49:36Z","abstract_excerpt":"Given a weighted hypergraph $\\mathcal{H}(V, \\mathcal{E} \\subseteq 2^V, w)$, the approximate $k$-cover problem seeks for a size-$k$ subset of $V$ that has the maximum weighted coverage by \\emph{sampling only a few hyperedges} in $\\mathcal{E}$. The problem has emerged from several network analysis applications including viral marketing, centrality maximization, and landmark selection. Despite many efforts, even the best approaches require $O(k n \\log n)$ space complexities, thus, cannot scale to, nowadays, humongous networks without sacrificing formal guarantees. In this paper, we propose BCA, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07928","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXirrOqT0Scr9wD92VzGPveciwIZEj7baFN5/foohBE+BmyUUjwP59uR6HLrUa4pgfv6b7XFAevQdtlrGM3mBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:16:35.484665Z"},"content_sha256":"35508909b71c5d8c53e0f1d1f2c84fa94fadaa405cd4e02d33fa5f01d79e628c","schema_version":"1.0","event_id":"sha256:35508909b71c5d8c53e0f1d1f2c84fa94fadaa405cd4e02d33fa5f01d79e628c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/bundle.json","state_url":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/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-22T11:16:35Z","links":{"resolver":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ","bundle":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/bundle.json","state":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:K6B4IKAM7YCINQCGUI7R6BCDZZ","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":"853525247b46c2ebb3c86674a8a8ce6f2c5f5cccc0b6932025e3f08728ae7257","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-01-23T14:49:36Z","title_canon_sha256":"699ff5a88f7063bd4ff60af9e10e21821af59a7d3c539cc08239445c29b55381"},"schema_version":"1.0","source":{"id":"1901.07928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07928","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07928v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07928","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"K6B4IKAM7YCI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K6B4IKAM7YCINQCG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K6B4IKAM","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:35508909b71c5d8c53e0f1d1f2c84fa94fadaa405cd4e02d33fa5f01d79e628c","target":"graph","created_at":"2026-05-17T23:55:39Z","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 weighted hypergraph $\\mathcal{H}(V, \\mathcal{E} \\subseteq 2^V, w)$, the approximate $k$-cover problem seeks for a size-$k$ subset of $V$ that has the maximum weighted coverage by \\emph{sampling only a few hyperedges} in $\\mathcal{E}$. The problem has emerged from several network analysis applications including viral marketing, centrality maximization, and landmark selection. Despite many efforts, even the best approaches require $O(k n \\log n)$ space complexities, thus, cannot scale to, nowadays, humongous networks without sacrificing formal guarantees. In this paper, we propose BCA, a","authors_text":"Hung Nguyen, My Thai, Phuc Thai, Tam Vu, Thang Dinh","cross_cats":["cs.DS","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-01-23T14:49:36Z","title":"Approximate k-Cover in Hypergraphs: Efficient Algorithms, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07928","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:82af0708d06eec68b7cd3a2a9522552f713074f61f58e574c16f1f40b754e4c8","target":"record","created_at":"2026-05-17T23:55:39Z","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":"853525247b46c2ebb3c86674a8a8ce6f2c5f5cccc0b6932025e3f08728ae7257","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-01-23T14:49:36Z","title_canon_sha256":"699ff5a88f7063bd4ff60af9e10e21821af59a7d3c539cc08239445c29b55381"},"schema_version":"1.0","source":{"id":"1901.07928","kind":"arxiv","version":1}},"canonical_sha256":"5783c4280cfe0486c046a23f1f0443ce420d1a862abfc4a73d74d4e85ed45ab9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5783c4280cfe0486c046a23f1f0443ce420d1a862abfc4a73d74d4e85ed45ab9","first_computed_at":"2026-05-17T23:55:39.464557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:39.464557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bcGCTFfjIIvaAGV4JJnsMjFGsnW6CZinxCe7+qQSSPDoLuJOlUKSn+4UYIIrYwhe6Q51c4oMQdsXeu+Yw5OBCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:39.464936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82af0708d06eec68b7cd3a2a9522552f713074f61f58e574c16f1f40b754e4c8","sha256:35508909b71c5d8c53e0f1d1f2c84fa94fadaa405cd4e02d33fa5f01d79e628c"],"state_sha256":"a25f5e16f5ea53cdba28393909812914c5f6bb45810a1a392a7ccd28f843d7ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a40a9p5+VWjPefkhhA0kOlKQyCR2N/AlwXkotLzvOM5gVquVTrJG9MgyTu5ZCkLgccu40nDQ2xJ7LFf1dsM9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:16:35.486633Z","bundle_sha256":"3dc298cdac8f8d213a4fbb134e43ca21ba931741654c9f250a13c1c2f62564d2"}}