{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7URD5DS5243AGLBIU4XM2KVTWC","short_pith_number":"pith:7URD5DS5","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"},"canonical_sha256":"fd223e8e5dd736032c28a72ecd2ab3b0bd94f33567b228b9ebe0f0668249a329","source":{"kind":"arxiv","id":"1406.5336","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5336","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5336v2","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5336","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"7URD5DS5243A","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7URD5DS5243AGLBI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7URD5DS5","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7URD5DS5243AGLBIU4XM2KVTWC","target":"record","payload":{"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"},"canonical_sha256":"fd223e8e5dd736032c28a72ecd2ab3b0bd94f33567b228b9ebe0f0668249a329","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"},"source_kind":"arxiv","source_id":"1406.5336","source_version":2,"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-18T00:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/youvepHp4cmL3ecyBx7Q9Yy1P0UaPO2s5uMamHCYTHRJAD0zKz6a3kSEdjwopvLcfGhnWKgxGxCTKKm2rCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:43:57.922455Z"},"content_sha256":"b95c2e3707e73335ce1694f4522adcb4111bed56bc9443947429602502d6df3b","schema_version":"1.0","event_id":"sha256:b95c2e3707e73335ce1694f4522adcb4111bed56bc9443947429602502d6df3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7URD5DS5243AGLBIU4XM2KVTWC","target":"graph","payload":{"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"},"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-18T00:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fr7PIOYqR2N9Ec8z6A2IYVB0eiUoY+2JM5xsW6ZXRLG0VxeIAJW8V+LupDkxX88ASQRzPS2k/IFjfa59IkwfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:43:57.923144Z"},"content_sha256":"51afa9e978ac512e026f16d00e9426e84326d0341f664b6204b110a395039291","schema_version":"1.0","event_id":"sha256:51afa9e978ac512e026f16d00e9426e84326d0341f664b6204b110a395039291"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/bundle.json","state_url":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7URD5DS5243AGLBIU4XM2KVTWC/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-05-26T08:43:57Z","links":{"resolver":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC","bundle":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/bundle.json","state":"https://pith.science/pith/7URD5DS5243AGLBIU4XM2KVTWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7URD5DS5243AGLBIU4XM2KVTWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7URD5DS5243AGLBIU4XM2KVTWC","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":"1af140394526654093fb13c081817199a31d0cc0c19cfb3f5508bae69212e1af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-20T09:49:08Z","title_canon_sha256":"e468ad8174c162cfff09b4e8ea0b0f9335e81fa7b14ab2e858fdcb9566341fec"},"schema_version":"1.0","source":{"id":"1406.5336","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5336","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5336v2","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5336","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"7URD5DS5243A","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7URD5DS5243AGLBI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7URD5DS5","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:51afa9e978ac512e026f16d00e9426e84326d0341f664b6204b110a395039291","target":"graph","created_at":"2026-05-18T00:37:57Z","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":"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","authors_text":"Aarthi Sundaram, G\\'abor Ivanyos, Miklos Santha, Raghav Kulkarni, Youming Qiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-20T09:49:08Z","title":"On the Complexity of Trial and Error for Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5336","kind":"arxiv","version":2},"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:b95c2e3707e73335ce1694f4522adcb4111bed56bc9443947429602502d6df3b","target":"record","created_at":"2026-05-18T00:37:57Z","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":"1af140394526654093fb13c081817199a31d0cc0c19cfb3f5508bae69212e1af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-20T09:49:08Z","title_canon_sha256":"e468ad8174c162cfff09b4e8ea0b0f9335e81fa7b14ab2e858fdcb9566341fec"},"schema_version":"1.0","source":{"id":"1406.5336","kind":"arxiv","version":2}},"canonical_sha256":"fd223e8e5dd736032c28a72ecd2ab3b0bd94f33567b228b9ebe0f0668249a329","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd223e8e5dd736032c28a72ecd2ab3b0bd94f33567b228b9ebe0f0668249a329","first_computed_at":"2026-05-18T00:37:57.721428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:57.721428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VDF81TGcxMy9L7852T9SdxFO1trI8Qb+IHx2it7BwQcSExJwTkMGIL3ADo10DQqqMSOquRCys9pH/zYKKx6PAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:57.721900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5336","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b95c2e3707e73335ce1694f4522adcb4111bed56bc9443947429602502d6df3b","sha256:51afa9e978ac512e026f16d00e9426e84326d0341f664b6204b110a395039291"],"state_sha256":"0dae50936253daa4564935f4ea38059c466d3338bfc2f74881c7392566a1ced0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1WXOzAnz8J2C2f0A35gj4FXjA5/+jtT1wgpytEn/n8Riw8sSra6AsjYduQN97nvhSE26fHJMEQWNnSyt60aCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:43:57.926737Z","bundle_sha256":"87967fda975f8883cde3ff7a76829349961ad1770a17adbafd4abbf76ff5a182"}}