{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DX2GNVODMVATVI3V5MUE2SG3NQ","short_pith_number":"pith:DX2GNVOD","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"},"canonical_sha256":"1df466d5c365413aa375eb284d48db6c0d65a0a5363f3a45116fa45aadbd1425","source":{"kind":"arxiv","id":"1610.04935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04935","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04935v1","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04935","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"DX2GNVODMVAT","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DX2GNVODMVATVI3V","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DX2GNVOD","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DX2GNVODMVATVI3V5MUE2SG3NQ","target":"record","payload":{"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"},"canonical_sha256":"1df466d5c365413aa375eb284d48db6c0d65a0a5363f3a45116fa45aadbd1425","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"},"source_kind":"arxiv","source_id":"1610.04935","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-18T01:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kSntJmrmwTAf2e5lSA5I36duetNRpanZjMycWNCtgDZCaPJaFGYeq1pyYzgiBYDL0ALo4iWI5iwvMBFAxY+bBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:35:32.584239Z"},"content_sha256":"f78c54d6f55a7c6f73dd3938ac54540a24ddf68a419b2a0bbf4af2699cb9be95","schema_version":"1.0","event_id":"sha256:f78c54d6f55a7c6f73dd3938ac54540a24ddf68a419b2a0bbf4af2699cb9be95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DX2GNVODMVATVI3V5MUE2SG3NQ","target":"graph","payload":{"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"},"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-18T01:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWwm5x1mcViXpdvRReOWH064pr3TCy277UqTPLNsulbwGTLJWkszS89r6yktQoxiW3UCyzY9XgluZGNTByHxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:35:32.584912Z"},"content_sha256":"da72d06d8cffb1b602434781afca8c76a9421bc665d307b0a3753e1be9bcb364","schema_version":"1.0","event_id":"sha256:da72d06d8cffb1b602434781afca8c76a9421bc665d307b0a3753e1be9bcb364"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/bundle.json","state_url":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/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-10T22:35:32Z","links":{"resolver":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ","bundle":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/bundle.json","state":"https://pith.science/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DX2GNVODMVATVI3V5MUE2SG3NQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DX2GNVODMVATVI3V5MUE2SG3NQ","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":"4349f9cd5605b16a2876fc636d8318c2056b119d005c049c2912e70f3390513c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T00:28:12Z","title_canon_sha256":"513e037b85ca518b93022386c560aebbc4660be78d35d25d248b0d558664a0ca"},"schema_version":"1.0","source":{"id":"1610.04935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04935","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04935v1","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04935","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"DX2GNVODMVAT","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DX2GNVODMVATVI3V","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DX2GNVOD","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:da72d06d8cffb1b602434781afca8c76a9421bc665d307b0a3753e1be9bcb364","target":"graph","created_at":"2026-05-18T01:02:06Z","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":"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","authors_text":"Richard Taylor","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T00:28:12Z","title":"Approximations of the Densest k-Subhypergraph and Set Union Knapsack problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04935","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:f78c54d6f55a7c6f73dd3938ac54540a24ddf68a419b2a0bbf4af2699cb9be95","target":"record","created_at":"2026-05-18T01:02:06Z","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":"4349f9cd5605b16a2876fc636d8318c2056b119d005c049c2912e70f3390513c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T00:28:12Z","title_canon_sha256":"513e037b85ca518b93022386c560aebbc4660be78d35d25d248b0d558664a0ca"},"schema_version":"1.0","source":{"id":"1610.04935","kind":"arxiv","version":1}},"canonical_sha256":"1df466d5c365413aa375eb284d48db6c0d65a0a5363f3a45116fa45aadbd1425","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1df466d5c365413aa375eb284d48db6c0d65a0a5363f3a45116fa45aadbd1425","first_computed_at":"2026-05-18T01:02:06.692606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:06.692606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"81DRTFt5nFuWVZ26MZDyWFoa/4wL0eCIbUjnNv+0LlQ1E0OJ5ujh8b+GrA5CckjOIsgAkdItkXjm34hqkZPABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:06.693138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f78c54d6f55a7c6f73dd3938ac54540a24ddf68a419b2a0bbf4af2699cb9be95","sha256:da72d06d8cffb1b602434781afca8c76a9421bc665d307b0a3753e1be9bcb364"],"state_sha256":"00d943cbc979a86ba7e47ff6113428ea86c32a3608eb40571ee7cb43db7e288b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TMyyMbWxahd1t0xqUHLYxEtzUZMV/ONYSECVZ70DIGAQoWqWbx5NYi42djELuzqRqARGtUsk67X2S7qJ2NzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:35:32.588528Z","bundle_sha256":"689f8b6980a2caa267ac500e6313c6ac46e578407bdd3ef843889a0569295bae"}}