{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZWASACG5F63I6MGEUJ26GSCUWM","short_pith_number":"pith:ZWASACG5","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"},"canonical_sha256":"cd812008dd2fb68f30c4a275e34854b337ed91ebb7cb3b0c6d6d976d9c97a61b","source":{"kind":"arxiv","id":"1507.04391","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04391","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04391v1","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04391","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZWASACG5F63I","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZWASACG5F63I6MGE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZWASACG5","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZWASACG5F63I6MGEUJ26GSCUWM","target":"record","payload":{"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"},"canonical_sha256":"cd812008dd2fb68f30c4a275e34854b337ed91ebb7cb3b0c6d6d976d9c97a61b","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"},"source_kind":"arxiv","source_id":"1507.04391","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:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJzfvhzNMVg4iFnMvIdqNheLI7r5luTk1WSUBz27nqffaRu4IBBNIlSoVxxZosO5IqDbxTD3sSTBPXca7v57Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:21:10.735942Z"},"content_sha256":"882a453fec7af92b614160694177ac254c564e46e0aa30c8b26ea5d469787356","schema_version":"1.0","event_id":"sha256:882a453fec7af92b614160694177ac254c564e46e0aa30c8b26ea5d469787356"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZWASACG5F63I6MGEUJ26GSCUWM","target":"graph","payload":{"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"},"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:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mPNaSzzUCa6fn0bU8XsqkDPXjVZq6YlvQ4oZxkSl83Ldsx076cvyulXV7JQthSMC4wwzGi9HDU+Je85oUTduDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:21:10.736606Z"},"content_sha256":"2a0767dcfddab598875a45dd2fbd26c393fe12cef845943817a04af971d7a630","schema_version":"1.0","event_id":"sha256:2a0767dcfddab598875a45dd2fbd26c393fe12cef845943817a04af971d7a630"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/bundle.json","state_url":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWASACG5F63I6MGEUJ26GSCUWM/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-11T02:21:10Z","links":{"resolver":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM","bundle":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/bundle.json","state":"https://pith.science/pith/ZWASACG5F63I6MGEUJ26GSCUWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWASACG5F63I6MGEUJ26GSCUWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZWASACG5F63I6MGEUJ26GSCUWM","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":"99dbdfbf010baa49f3948c21d286f556c21d95f6299dbf4489f66dd064c35abc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-15T20:48:19Z","title_canon_sha256":"67226e3305efdc6a21f529a8b21442694c45acec09e4a4aa2ae968ebb5a604cb"},"schema_version":"1.0","source":{"id":"1507.04391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04391","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04391v1","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04391","created_at":"2026-05-18T01:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZWASACG5F63I","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZWASACG5F63I6MGE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZWASACG5","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:2a0767dcfddab598875a45dd2fbd26c393fe12cef845943817a04af971d7a630","target":"graph","created_at":"2026-05-18T01:36:47Z","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":"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","authors_text":"Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-15T20:48:19Z","title":"Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04391","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:882a453fec7af92b614160694177ac254c564e46e0aa30c8b26ea5d469787356","target":"record","created_at":"2026-05-18T01:36:47Z","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":"99dbdfbf010baa49f3948c21d286f556c21d95f6299dbf4489f66dd064c35abc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-15T20:48:19Z","title_canon_sha256":"67226e3305efdc6a21f529a8b21442694c45acec09e4a4aa2ae968ebb5a604cb"},"schema_version":"1.0","source":{"id":"1507.04391","kind":"arxiv","version":1}},"canonical_sha256":"cd812008dd2fb68f30c4a275e34854b337ed91ebb7cb3b0c6d6d976d9c97a61b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd812008dd2fb68f30c4a275e34854b337ed91ebb7cb3b0c6d6d976d9c97a61b","first_computed_at":"2026-05-18T01:36:47.546840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:47.546840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"32Uv0O9j4eu5NLW4Dr/qkWghbRHnv8noeG08L0FO+EArwwmcVNTbQzx0IIYAO0H5gNqrP/7kJMRcMY1c2YylDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:47.547347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:882a453fec7af92b614160694177ac254c564e46e0aa30c8b26ea5d469787356","sha256:2a0767dcfddab598875a45dd2fbd26c393fe12cef845943817a04af971d7a630"],"state_sha256":"bf405f8dfbbde7e61793b034be908337d9d51786fb6f307147feaaa4ac9cfc74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuDlVT6JCBr4McIb/8sg/L5gTJKCHcMABSjn+TCjWE2Q0gQ9HHNfWpigA17/IEx43GdG6UoxbVeRShFH26cwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:21:10.740139Z","bundle_sha256":"8e6ed7f1d2a978870ffaa0e80095869fcded810a88032b7537cbd85c63c0a427"}}