{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4X7DDBOM35NAGWATTPRUUNG2H6","short_pith_number":"pith:4X7DDBOM","schema_version":"1.0","canonical_sha256":"e5fe3185ccdf5a0358139be34a34da3fa0a2feef3a2e43e9fdb74ef00cc01e27","source":{"kind":"arxiv","id":"1907.07833","version":1},"attestation_state":"computed","paper":{"title":"Approximating Constraint Satisfaction Problems on High-Dimensional Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Fernando Granha Jeronimo, Madhur Tulsiani, Vedat Levi Alev","submitted_at":"2019-07-18T01:31:52Z","abstract_excerpt":"We consider the problem of approximately solving constraint satisfaction problems with arity $k > 2$ ($k$-CSPs) on instances satisfying certain expansion properties, when viewed as hypergraphs. Random instances of $k$-CSPs, which are also highly expanding, are well-known to be hard to approximate using known algorithmic techniques (and are widely believed to be hard to approximate in polynomial time). However, we show that this is not necessarily the case for instances where the hypergraph is a high-dimensional expander.\n  We consider the spectral definition of high-dimensional expansion used "},"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":"1907.07833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T01:31:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ebeefd48382ba5cda25b6510449af5fcad7bbb8324d300283b764724a2ec6b17","abstract_canon_sha256":"bbc5315d58410eadabdf995aaeac45cb8f475d168809468bf9eb015cc1de41e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:16.060084Z","signature_b64":"YEii7NTU/ahab1pp4B3mYf7QMF0FCUX3X8yuAAnrO2YSbYirG1MYB6laTPi/1ClOQOr1T8nG9xtIU/0hTFOUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5fe3185ccdf5a0358139be34a34da3fa0a2feef3a2e43e9fdb74ef00cc01e27","last_reissued_at":"2026-05-17T23:40:16.059503Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:16.059503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Constraint Satisfaction Problems on High-Dimensional Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Fernando Granha Jeronimo, Madhur Tulsiani, Vedat Levi Alev","submitted_at":"2019-07-18T01:31:52Z","abstract_excerpt":"We consider the problem of approximately solving constraint satisfaction problems with arity $k > 2$ ($k$-CSPs) on instances satisfying certain expansion properties, when viewed as hypergraphs. Random instances of $k$-CSPs, which are also highly expanding, are well-known to be hard to approximate using known algorithmic techniques (and are widely believed to be hard to approximate in polynomial time). However, we show that this is not necessarily the case for instances where the hypergraph is a high-dimensional expander.\n  We consider the spectral definition of high-dimensional expansion used "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07833","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":"1907.07833","created_at":"2026-05-17T23:40:16.059619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07833v1","created_at":"2026-05-17T23:40:16.059619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07833","created_at":"2026-05-17T23:40:16.059619+00:00"},{"alias_kind":"pith_short_12","alias_value":"4X7DDBOM35NA","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4X7DDBOM35NAGWAT","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4X7DDBOM","created_at":"2026-05-18T12:33:10.108867+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/4X7DDBOM35NAGWATTPRUUNG2H6","json":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6.json","graph_json":"https://pith.science/api/pith-number/4X7DDBOM35NAGWATTPRUUNG2H6/graph.json","events_json":"https://pith.science/api/pith-number/4X7DDBOM35NAGWATTPRUUNG2H6/events.json","paper":"https://pith.science/paper/4X7DDBOM"},"agent_actions":{"view_html":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6","download_json":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6.json","view_paper":"https://pith.science/paper/4X7DDBOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07833&json=true","fetch_graph":"https://pith.science/api/pith-number/4X7DDBOM35NAGWATTPRUUNG2H6/graph.json","fetch_events":"https://pith.science/api/pith-number/4X7DDBOM35NAGWATTPRUUNG2H6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6/action/storage_attestation","attest_author":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6/action/author_attestation","sign_citation":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6/action/citation_signature","submit_replication":"https://pith.science/pith/4X7DDBOM35NAGWATTPRUUNG2H6/action/replication_record"}},"created_at":"2026-05-17T23:40:16.059619+00:00","updated_at":"2026-05-17T23:40:16.059619+00:00"}