{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7FMN4ATDORB2WEFQKCBH4LKMQR","short_pith_number":"pith:7FMN4ATD","schema_version":"1.0","canonical_sha256":"f958de02637443ab10b050827e2d4c845672dbb472c716b31bc5ed9e2d33591e","source":{"kind":"arxiv","id":"1704.08620","version":4},"attestation_state":"computed","paper":{"title":"Improved approximation algorithm for the Dense-3-Subhypergraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amey Bhangale, Guy Kortsarz, Rajiv Gandhi","submitted_at":"2017-04-27T15:18:03Z","abstract_excerpt":"The study of Dense-$3$-Subhypergraph problem was initiated in Chlamt{\\'{a}}c et al. [Approx'16]. The input is a universe $U$ and collection ${\\cal S}$ of subsets of $U$, each of size $3$, and a number $k$. The goal is to choose a set $W$ of $k$ elements from the universe, and maximize the number of sets, $S\\in {\\cal S}$ so that $S\\subseteq W$. The members in $U$ are called {\\em vertices} and the sets of ${\\cal S}$ are called the {\\em hyperedges}. This is the simplest extension into hyperedges of the case of sets of size $2$ which is the well known Dense $k$-subgraph problem.\n  The best known r"},"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":"1704.08620","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T15:18:03Z","cross_cats_sorted":[],"title_canon_sha256":"fad890282fc77d628b79644182374608db88d7fef43267c9bd202c947d44c0b3","abstract_canon_sha256":"9835a30a640a56df89eaeadbabd502c14a42d9246b26d2d40b4d1a31f7d7fe3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.754084Z","signature_b64":"0dB0+yNablciPXeLyczjnxiIdJtl9gW+VBlaKfRlcGHca+hycPgATNT3TLFVfCtayLOac4PGyT/dagebvibbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f958de02637443ab10b050827e2d4c845672dbb472c716b31bc5ed9e2d33591e","last_reissued_at":"2026-05-18T00:25:11.753466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.753466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved approximation algorithm for the Dense-3-Subhypergraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amey Bhangale, Guy Kortsarz, Rajiv Gandhi","submitted_at":"2017-04-27T15:18:03Z","abstract_excerpt":"The study of Dense-$3$-Subhypergraph problem was initiated in Chlamt{\\'{a}}c et al. [Approx'16]. The input is a universe $U$ and collection ${\\cal S}$ of subsets of $U$, each of size $3$, and a number $k$. The goal is to choose a set $W$ of $k$ elements from the universe, and maximize the number of sets, $S\\in {\\cal S}$ so that $S\\subseteq W$. The members in $U$ are called {\\em vertices} and the sets of ${\\cal S}$ are called the {\\em hyperedges}. This is the simplest extension into hyperedges of the case of sets of size $2$ which is the well known Dense $k$-subgraph problem.\n  The best known r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08620","kind":"arxiv","version":4},"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":"1704.08620","created_at":"2026-05-18T00:25:11.753563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08620v4","created_at":"2026-05-18T00:25:11.753563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08620","created_at":"2026-05-18T00:25:11.753563+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FMN4ATDORB2","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FMN4ATDORB2WEFQ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FMN4ATD","created_at":"2026-05-18T12:31:05.417338+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/7FMN4ATDORB2WEFQKCBH4LKMQR","json":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR.json","graph_json":"https://pith.science/api/pith-number/7FMN4ATDORB2WEFQKCBH4LKMQR/graph.json","events_json":"https://pith.science/api/pith-number/7FMN4ATDORB2WEFQKCBH4LKMQR/events.json","paper":"https://pith.science/paper/7FMN4ATD"},"agent_actions":{"view_html":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR","download_json":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR.json","view_paper":"https://pith.science/paper/7FMN4ATD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08620&json=true","fetch_graph":"https://pith.science/api/pith-number/7FMN4ATDORB2WEFQKCBH4LKMQR/graph.json","fetch_events":"https://pith.science/api/pith-number/7FMN4ATDORB2WEFQKCBH4LKMQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/action/storage_attestation","attest_author":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/action/author_attestation","sign_citation":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/action/citation_signature","submit_replication":"https://pith.science/pith/7FMN4ATDORB2WEFQKCBH4LKMQR/action/replication_record"}},"created_at":"2026-05-18T00:25:11.753563+00:00","updated_at":"2026-05-18T00:25:11.753563+00:00"}