{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DX2GNVODMVATVI3V5MUE2SG3NQ","short_pith_number":"pith:DX2GNVOD","schema_version":"1.0","canonical_sha256":"1df466d5c365413aa375eb284d48db6c0d65a0a5363f3a45116fa45aadbd1425","source":{"kind":"arxiv","id":"1610.04935","version":1},"attestation_state":"computed","paper":{"title":"Approximations of the Densest k-Subhypergraph and Set Union Knapsack problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Richard Taylor","submitted_at":"2016-10-17T00:28:12Z","abstract_excerpt":"For any given $\\epsilon>0$ we provide an algorithm for the Densest $k$-Subhypergraph Problem with an approximation ratio of at most $O(n^{\\theta_m+2\\epsilon})$ for $\\theta_m=\\frac{1}{2}m-\\frac{1}{2}-\\frac{1}{2m}$ and run time at most $O(n^{m-2+1/\\epsilon})$, where the hyperedges have at most $m$ vertices. We use this result to give an algorithm for the Set Union Knapsack Problem with an approximation ratio of at most $O(n^{\\alpha_m+\\epsilon})$ for $\\alpha_m=\\frac{2}{3}[m-1-\\frac{2m-2}{m^2+m-1}]$ and run time at most $O(n^{5(m-2)+9/\\epsilon})$, where the subsets have at most $m$ elements. The 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":"1610.04935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T00:28:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"513e037b85ca518b93022386c560aebbc4660be78d35d25d248b0d558664a0ca","abstract_canon_sha256":"4349f9cd5605b16a2876fc636d8318c2056b119d005c049c2912e70f3390513c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:06.693138Z","signature_b64":"81DRTFt5nFuWVZ26MZDyWFoa/4wL0eCIbUjnNv+0LlQ1E0OJ5ujh8b+GrA5CckjOIsgAkdItkXjm34hqkZPABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df466d5c365413aa375eb284d48db6c0d65a0a5363f3a45116fa45aadbd1425","last_reissued_at":"2026-05-18T01:02:06.692606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:06.692606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximations of the Densest k-Subhypergraph and Set Union Knapsack problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Richard Taylor","submitted_at":"2016-10-17T00:28:12Z","abstract_excerpt":"For any given $\\epsilon>0$ we provide an algorithm for the Densest $k$-Subhypergraph Problem with an approximation ratio of at most $O(n^{\\theta_m+2\\epsilon})$ for $\\theta_m=\\frac{1}{2}m-\\frac{1}{2}-\\frac{1}{2m}$ and run time at most $O(n^{m-2+1/\\epsilon})$, where the hyperedges have at most $m$ vertices. We use this result to give an algorithm for the Set Union Knapsack Problem with an approximation ratio of at most $O(n^{\\alpha_m+\\epsilon})$ for $\\alpha_m=\\frac{2}{3}[m-1-\\frac{2m-2}{m^2+m-1}]$ and run time at most $O(n^{5(m-2)+9/\\epsilon})$, where the subsets have at most $m$ elements. The a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04935","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":"1610.04935","created_at":"2026-05-18T01:02:06.692682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04935v1","created_at":"2026-05-18T01:02:06.692682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04935","created_at":"2026-05-18T01:02:06.692682+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX2GNVODMVAT","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX2GNVODMVATVI3V","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX2GNVOD","created_at":"2026-05-18T12:30:12.583610+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/DX2GNVODMVATVI3V5MUE2SG3NQ","json":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ.json","graph_json":"https://pith.science/api/pith-number/DX2GNVODMVATVI3V5MUE2SG3NQ/graph.json","events_json":"https://pith.science/api/pith-number/DX2GNVODMVATVI3V5MUE2SG3NQ/events.json","paper":"https://pith.science/paper/DX2GNVOD"},"agent_actions":{"view_html":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ","download_json":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ.json","view_paper":"https://pith.science/paper/DX2GNVOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04935&json=true","fetch_graph":"https://pith.science/api/pith-number/DX2GNVODMVATVI3V5MUE2SG3NQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DX2GNVODMVATVI3V5MUE2SG3NQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/action/storage_attestation","attest_author":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/action/author_attestation","sign_citation":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/action/citation_signature","submit_replication":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/action/replication_record"}},"created_at":"2026-05-18T01:02:06.692682+00:00","updated_at":"2026-05-18T01:02:06.692682+00:00"}