{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K6B4IKAM7YCINQCGUI7R6BCDZZ","short_pith_number":"pith:K6B4IKAM","schema_version":"1.0","canonical_sha256":"5783c4280cfe0486c046a23f1f0443ce420d1a862abfc4a73d74d4e85ed45ab9","source":{"kind":"arxiv","id":"1901.07928","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.07928","created_at":"2026-05-17T23:55:39.464611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07928v1","created_at":"2026-05-17T23:55:39.464611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07928","created_at":"2026-05-17T23:55:39.464611+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6B4IKAM7YCI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6B4IKAM7YCINQCG","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6B4IKAM","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ","json":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ.json","graph_json":"https://pith.science/api/pith-number/K6B4IKAM7YCINQCGUI7R6BCDZZ/graph.json","events_json":"https://pith.science/api/pith-number/K6B4IKAM7YCINQCGUI7R6BCDZZ/events.json","paper":"https://pith.science/paper/K6B4IKAM"},"agent_actions":{"view_html":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ","download_json":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ.json","view_paper":"https://pith.science/paper/K6B4IKAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07928&json=true","fetch_graph":"https://pith.science/api/pith-number/K6B4IKAM7YCINQCGUI7R6BCDZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/K6B4IKAM7YCINQCGUI7R6BCDZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/action/storage_attestation","attest_author":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/action/author_attestation","sign_citation":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/action/citation_signature","submit_replication":"https://pith.science/pith/K6B4IKAM7YCINQCGUI7R6BCDZZ/action/replication_record"}},"created_at":"2026-05-17T23:55:39.464611+00:00","updated_at":"2026-05-17T23:55:39.464611+00:00"}