{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F2YE3O4YRUCKLZUCE4UX7IJS5N","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":"48f4dbaee5ce26d0cf96f8fbc4c4ae5c45de7c4c38039eef065eb6194e2748ae","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T18:57:39Z","title_canon_sha256":"84e26b81d01fa9b5322175f7d91840a5dcf13528b9984bc6b53c9b841946ea2f"},"schema_version":"1.0","source":{"id":"1605.04284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04284","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04284v1","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04284","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"F2YE3O4YRUCK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F2YE3O4YRUCKLZUC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F2YE3O4Y","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:be1b7c967835499ca6982b0c14034f2a5e51df155a27dd84f18f9df4aee2785b","target":"graph","created_at":"2026-05-18T01:14:53Z","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":"The Densest $k$-Subgraph (D$k$S) problem, and its corresponding minimization problem Smallest $p$-Edge Subgraph (S$p$ES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed that they do not an admit a subpolynomial approximation ratio (although the best known hardness results do not rule this out).\n  In this paper we generalize both D$k$S and S$p$ES from graphs to hyp","authors_text":"Christian Konrad, Eden Chlamt\\'a\\v{c}, George Rabanca, Guy Kortsarz, Michael Dinitz","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T18:57:39Z","title":"The Densest k-Subhypergraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04284","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:7eb223a981f92296bcf8bced5c6dc1254d1261a1521f2abe230a77eb78b6aa19","target":"record","created_at":"2026-05-18T01:14:53Z","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":"48f4dbaee5ce26d0cf96f8fbc4c4ae5c45de7c4c38039eef065eb6194e2748ae","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T18:57:39Z","title_canon_sha256":"84e26b81d01fa9b5322175f7d91840a5dcf13528b9984bc6b53c9b841946ea2f"},"schema_version":"1.0","source":{"id":"1605.04284","kind":"arxiv","version":1}},"canonical_sha256":"2eb04dbb988d04a5e68227297fa132eb4ca454469c467cdcb9e7c5a85df665e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2eb04dbb988d04a5e68227297fa132eb4ca454469c467cdcb9e7c5a85df665e7","first_computed_at":"2026-05-18T01:14:53.826452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:53.826452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fAqvFz+g4c2XfvQfrb6vbnEwwG5himWcb05gnOEd8ef8mAeP1XXI9HNsPBAvB6KwC/iw8IX9UhnFqMPj5I3lCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:53.826902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eb223a981f92296bcf8bced5c6dc1254d1261a1521f2abe230a77eb78b6aa19","sha256:be1b7c967835499ca6982b0c14034f2a5e51df155a27dd84f18f9df4aee2785b"],"state_sha256":"ef478e686a172816988e151275a0c71f70d6681f4a3ee655472052255e3ba212"}