{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZWASACG5F63I6MGEUJ26GSCUWM","short_pith_number":"pith:ZWASACG5","schema_version":"1.0","canonical_sha256":"cd812008dd2fb68f30c4a275e34854b337ed91ebb7cb3b0c6d6d976d9c97a61b","source":{"kind":"arxiv","id":"1507.04391","version":1},"attestation_state":"computed","paper":{"title":"Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2015-07-15T20:48:19Z","abstract_excerpt":"It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS~99), that \\MC\\ admits a PTAS on dense graphs, and more generally, \\kCSP\\ admits a PTAS on \"dense\" instances with $\\Omega(n^k)$ constraints. In this paper we extend and generalize their exhaustive sampling approach, presenting a framework for $(1-\\eps)$-approximating any \\kCSP\\ problem in \\emph{sub-exponential} time while significantly relaxing the denseness requirement on the input instance. Specifically, we prove that for any constants $\\delta \\in (0, 1]$ and $\\eps > 0$, we can approximate \\kCSP\\ problems with"},"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":"1507.04391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-15T20:48:19Z","cross_cats_sorted":[],"title_canon_sha256":"67226e3305efdc6a21f529a8b21442694c45acec09e4a4aa2ae968ebb5a604cb","abstract_canon_sha256":"99dbdfbf010baa49f3948c21d286f556c21d95f6299dbf4489f66dd064c35abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:47.547347Z","signature_b64":"32Uv0O9j4eu5NLW4Dr/qkWghbRHnv8noeG08L0FO+EArwwmcVNTbQzx0IIYAO0H5gNqrP/7kJMRcMY1c2YylDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd812008dd2fb68f30c4a275e34854b337ed91ebb7cb3b0c6d6d976d9c97a61b","last_reissued_at":"2026-05-18T01:36:47.546840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:47.546840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2015-07-15T20:48:19Z","abstract_excerpt":"It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS~99), that \\MC\\ admits a PTAS on dense graphs, and more generally, \\kCSP\\ admits a PTAS on \"dense\" instances with $\\Omega(n^k)$ constraints. In this paper we extend and generalize their exhaustive sampling approach, presenting a framework for $(1-\\eps)$-approximating any \\kCSP\\ problem in \\emph{sub-exponential} time while significantly relaxing the denseness requirement on the input instance. Specifically, we prove that for any constants $\\delta \\in (0, 1]$ and $\\eps > 0$, we can approximate \\kCSP\\ problems with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04391","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":"1507.04391","created_at":"2026-05-18T01:36:47.546932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04391v1","created_at":"2026-05-18T01:36:47.546932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04391","created_at":"2026-05-18T01:36:47.546932+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWASACG5F63I","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWASACG5F63I6MGE","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWASACG5","created_at":"2026-05-18T12:29:52.810259+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/ZWASACG5F63I6MGEUJ26GSCUWM","json":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM.json","graph_json":"https://pith.science/api/pith-number/ZWASACG5F63I6MGEUJ26GSCUWM/graph.json","events_json":"https://pith.science/api/pith-number/ZWASACG5F63I6MGEUJ26GSCUWM/events.json","paper":"https://pith.science/paper/ZWASACG5"},"agent_actions":{"view_html":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM","download_json":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM.json","view_paper":"https://pith.science/paper/ZWASACG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04391&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWASACG5F63I6MGEUJ26GSCUWM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWASACG5F63I6MGEUJ26GSCUWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/action/storage_attestation","attest_author":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/action/author_attestation","sign_citation":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/action/citation_signature","submit_replication":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/action/replication_record"}},"created_at":"2026-05-18T01:36:47.546932+00:00","updated_at":"2026-05-18T01:36:47.546932+00:00"}