{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AUPXEDW7SR32Z3BA22X2VIFHEQ","short_pith_number":"pith:AUPXEDW7","schema_version":"1.0","canonical_sha256":"051f720edf9477acec20d6afaaa0a7241796e491c7dc5337355b082550a0f651","source":{"kind":"arxiv","id":"2403.02212","version":2},"attestation_state":"computed","paper":{"title":"Constraint Satisfaction Problems with Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Suprovat Ghoshal, Yury Makarychev","submitted_at":"2024-03-04T17:00:31Z","abstract_excerpt":"We initiate the study of algorithms for constraint satisfaction problems with ML oracle advice. We introduce two models of advice and then design approximation algorithms for Max Cut, Max $2$-Lin, and Max $3$-Lin in these models. In particular, we show the following.\n  1. For Max-Cut and Max $2$-Lin, we design an algorithm that yields near-optimal solutions when the average degree is larger than a threshold degree, which only depends on the amount of advice and is independent of the instance size. We also give an algorithm for nearly satisfiable Max $3$-Lin instances with quantitatively simila"},"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":"2403.02212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-04T17:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"a0b8d6eab3cb09df8feec5950aa8d21111f0ad79dfec4735d9f1a162df60f211","abstract_canon_sha256":"6d1d870555c7518cce3f81dc485d93d22e191bf29e11f109e2f8e94fb20ccc61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:52.511536Z","signature_b64":"nfyy4AP8aaAfPTygm/bLheAwFbgLYW0qvGC7JwhJ8Da4v3/H4UoN3j4rEiCIkx9V/5JwbB6aEa2Uf7oZdjjyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"051f720edf9477acec20d6afaaa0a7241796e491c7dc5337355b082550a0f651","last_reissued_at":"2026-07-05T08:49:52.511087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:52.511087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraint Satisfaction Problems with Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Suprovat Ghoshal, Yury Makarychev","submitted_at":"2024-03-04T17:00:31Z","abstract_excerpt":"We initiate the study of algorithms for constraint satisfaction problems with ML oracle advice. We introduce two models of advice and then design approximation algorithms for Max Cut, Max $2$-Lin, and Max $3$-Lin in these models. In particular, we show the following.\n  1. For Max-Cut and Max $2$-Lin, we design an algorithm that yields near-optimal solutions when the average degree is larger than a threshold degree, which only depends on the amount of advice and is independent of the instance size. We also give an algorithm for nearly satisfiable Max $3$-Lin instances with quantitatively simila"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02212","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02212/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.02212","created_at":"2026-07-05T08:49:52.511152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02212v2","created_at":"2026-07-05T08:49:52.511152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02212","created_at":"2026-07-05T08:49:52.511152+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUPXEDW7SR32","created_at":"2026-07-05T08:49:52.511152+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUPXEDW7SR32Z3BA","created_at":"2026-07-05T08:49:52.511152+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUPXEDW7","created_at":"2026-07-05T08:49:52.511152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00841","citing_title":"Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ","json":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ.json","graph_json":"https://pith.science/api/pith-number/AUPXEDW7SR32Z3BA22X2VIFHEQ/graph.json","events_json":"https://pith.science/api/pith-number/AUPXEDW7SR32Z3BA22X2VIFHEQ/events.json","paper":"https://pith.science/paper/AUPXEDW7"},"agent_actions":{"view_html":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ","download_json":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ.json","view_paper":"https://pith.science/paper/AUPXEDW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02212&json=true","fetch_graph":"https://pith.science/api/pith-number/AUPXEDW7SR32Z3BA22X2VIFHEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AUPXEDW7SR32Z3BA22X2VIFHEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ/action/storage_attestation","attest_author":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ/action/author_attestation","sign_citation":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ/action/citation_signature","submit_replication":"https://pith.science/pith/AUPXEDW7SR32Z3BA22X2VIFHEQ/action/replication_record"}},"created_at":"2026-07-05T08:49:52.511152+00:00","updated_at":"2026-07-05T08:49:52.511152+00:00"}