{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7URD5DS5243AGLBIU4XM2KVTWC","short_pith_number":"pith:7URD5DS5","schema_version":"1.0","canonical_sha256":"fd223e8e5dd736032c28a72ecd2ab3b0bd94f33567b228b9ebe0f0668249a329","source":{"kind":"arxiv","id":"1406.5336","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Trial and Error for Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aarthi Sundaram, G\\'abor Ivanyos, Miklos Santha, Raghav Kulkarni, Youming Qiao","submitted_at":"2014-06-20T09:49:08Z","abstract_excerpt":"In 2013 Bei, Chen and Zhang introduced a trial and error model of computing, and applied to some constraint satisfaction problems. In this model the input is hidden by an oracle which, for a candidate assignment, reveals some information about a violated constraint if the assignment is not satisfying. In this paper we initiate a {\\em systematic} study of constraint satisfaction problems in the trial and error model. To achieve this, we first adopt a formal framework for CSPs, and based on this framework we define several types of revealing oracles. Our main contribution is to develop a \\emph{t"},"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":"1406.5336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-20T09:49:08Z","cross_cats_sorted":[],"title_canon_sha256":"e468ad8174c162cfff09b4e8ea0b0f9335e81fa7b14ab2e858fdcb9566341fec","abstract_canon_sha256":"1af140394526654093fb13c081817199a31d0cc0c19cfb3f5508bae69212e1af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:57.721900Z","signature_b64":"VDF81TGcxMy9L7852T9SdxFO1trI8Qb+IHx2it7BwQcSExJwTkMGIL3ADo10DQqqMSOquRCys9pH/zYKKx6PAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd223e8e5dd736032c28a72ecd2ab3b0bd94f33567b228b9ebe0f0668249a329","last_reissued_at":"2026-05-18T00:37:57.721428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:57.721428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Trial and Error for Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aarthi Sundaram, G\\'abor Ivanyos, Miklos Santha, Raghav Kulkarni, Youming Qiao","submitted_at":"2014-06-20T09:49:08Z","abstract_excerpt":"In 2013 Bei, Chen and Zhang introduced a trial and error model of computing, and applied to some constraint satisfaction problems. In this model the input is hidden by an oracle which, for a candidate assignment, reveals some information about a violated constraint if the assignment is not satisfying. In this paper we initiate a {\\em systematic} study of constraint satisfaction problems in the trial and error model. To achieve this, we first adopt a formal framework for CSPs, and based on this framework we define several types of revealing oracles. Our main contribution is to develop a \\emph{t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5336","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":""},"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":"1406.5336","created_at":"2026-05-18T00:37:57.721492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5336v2","created_at":"2026-05-18T00:37:57.721492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5336","created_at":"2026-05-18T00:37:57.721492+00:00"},{"alias_kind":"pith_short_12","alias_value":"7URD5DS5243A","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7URD5DS5243AGLBI","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7URD5DS5","created_at":"2026-05-18T12:28:19.803747+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/7URD5DS5243AGLBIU4XM2KVTWC","json":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC.json","graph_json":"https://pith.science/api/pith-number/7URD5DS5243AGLBIU4XM2KVTWC/graph.json","events_json":"https://pith.science/api/pith-number/7URD5DS5243AGLBIU4XM2KVTWC/events.json","paper":"https://pith.science/paper/7URD5DS5"},"agent_actions":{"view_html":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC","download_json":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC.json","view_paper":"https://pith.science/paper/7URD5DS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5336&json=true","fetch_graph":"https://pith.science/api/pith-number/7URD5DS5243AGLBIU4XM2KVTWC/graph.json","fetch_events":"https://pith.science/api/pith-number/7URD5DS5243AGLBIU4XM2KVTWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/action/storage_attestation","attest_author":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/action/author_attestation","sign_citation":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/action/citation_signature","submit_replication":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/action/replication_record"}},"created_at":"2026-05-18T00:37:57.721492+00:00","updated_at":"2026-05-18T00:37:57.721492+00:00"}