{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F2YE3O4YRUCKLZUCE4UX7IJS5N","short_pith_number":"pith:F2YE3O4Y","schema_version":"1.0","canonical_sha256":"2eb04dbb988d04a5e68227297fa132eb4ca454469c467cdcb9e7c5a85df665e7","source":{"kind":"arxiv","id":"1605.04284","version":1},"attestation_state":"computed","paper":{"title":"The Densest k-Subhypergraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Eden Chlamt\\'a\\v{c}, George Rabanca, Guy Kortsarz, Michael Dinitz","submitted_at":"2016-05-13T18:57:39Z","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"},"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":"1605.04284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T18:57:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"84e26b81d01fa9b5322175f7d91840a5dcf13528b9984bc6b53c9b841946ea2f","abstract_canon_sha256":"48f4dbaee5ce26d0cf96f8fbc4c4ae5c45de7c4c38039eef065eb6194e2748ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.826902Z","signature_b64":"fAqvFz+g4c2XfvQfrb6vbnEwwG5himWcb05gnOEd8ef8mAeP1XXI9HNsPBAvB6KwC/iw8IX9UhnFqMPj5I3lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb04dbb988d04a5e68227297fa132eb4ca454469c467cdcb9e7c5a85df665e7","last_reissued_at":"2026-05-18T01:14:53.826452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.826452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Densest k-Subhypergraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Eden Chlamt\\'a\\v{c}, George Rabanca, Guy Kortsarz, Michael Dinitz","submitted_at":"2016-05-13T18:57:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04284","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":"1605.04284","created_at":"2026-05-18T01:14:53.826522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04284v1","created_at":"2026-05-18T01:14:53.826522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04284","created_at":"2026-05-18T01:14:53.826522+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2YE3O4YRUCK","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2YE3O4YRUCKLZUC","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2YE3O4Y","created_at":"2026-05-18T12:30:15.759754+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/F2YE3O4YRUCKLZUCE4UX7IJS5N","json":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N.json","graph_json":"https://pith.science/api/pith-number/F2YE3O4YRUCKLZUCE4UX7IJS5N/graph.json","events_json":"https://pith.science/api/pith-number/F2YE3O4YRUCKLZUCE4UX7IJS5N/events.json","paper":"https://pith.science/paper/F2YE3O4Y"},"agent_actions":{"view_html":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N","download_json":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N.json","view_paper":"https://pith.science/paper/F2YE3O4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04284&json=true","fetch_graph":"https://pith.science/api/pith-number/F2YE3O4YRUCKLZUCE4UX7IJS5N/graph.json","fetch_events":"https://pith.science/api/pith-number/F2YE3O4YRUCKLZUCE4UX7IJS5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N/action/storage_attestation","attest_author":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N/action/author_attestation","sign_citation":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N/action/citation_signature","submit_replication":"https://pith.science/pith/F2YE3O4YRUCKLZUCE4UX7IJS5N/action/replication_record"}},"created_at":"2026-05-18T01:14:53.826522+00:00","updated_at":"2026-05-18T01:14:53.826522+00:00"}