{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:X7VFCPS4MA2KPNO2HC6ISZPTUS","short_pith_number":"pith:X7VFCPS4","schema_version":"1.0","canonical_sha256":"bfea513e5c6034a7b5da38bc8965f3a4972c3170435e6fdcc5fec1fbe23e00ec","source":{"kind":"arxiv","id":"1307.4655","version":1},"attestation_state":"computed","paper":{"title":"Compilation for QCSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Igor St\\'ephan","submitted_at":"2013-07-17T14:42:55Z","abstract_excerpt":"We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the semantics of this formalism by an interpretation to a QCSP. We specify an algorithm to compile a QCSP embedded into a search algorithm and based on the inductive semantics of QCSP. We introduce an optimality property and demonstrate the optimality of the interpretation of the compiled QCSP."},"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":"1307.4655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-07-17T14:42:55Z","cross_cats_sorted":[],"title_canon_sha256":"e11908afde632f1c39998195606b3ae22d2c4b445f2460ec94a638ee0124a941","abstract_canon_sha256":"7b4dbec9abfee7680415331686f774f4101aeda517afd1fe374f32c8f218ddfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:17.411109Z","signature_b64":"ji7XlnpM0yNST9KebkK+8eH2B6WFbDDKHkL538TbTsyDU9e2cj/puwvIDvm8aQ0rblhXdA9Ti3vwQvpQS200Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfea513e5c6034a7b5da38bc8965f3a4972c3170435e6fdcc5fec1fbe23e00ec","last_reissued_at":"2026-05-18T03:18:17.410579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:17.410579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compilation for QCSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Igor St\\'ephan","submitted_at":"2013-07-17T14:42:55Z","abstract_excerpt":"We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the semantics of this formalism by an interpretation to a QCSP. We specify an algorithm to compile a QCSP embedded into a search algorithm and based on the inductive semantics of QCSP. We introduce an optimality property and demonstrate the optimality of the interpretation of the compiled QCSP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4655","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":"1307.4655","created_at":"2026-05-18T03:18:17.410657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4655v1","created_at":"2026-05-18T03:18:17.410657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4655","created_at":"2026-05-18T03:18:17.410657+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7VFCPS4MA2K","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7VFCPS4MA2KPNO2","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7VFCPS4","created_at":"2026-05-18T12:28:06.772260+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/X7VFCPS4MA2KPNO2HC6ISZPTUS","json":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS.json","graph_json":"https://pith.science/api/pith-number/X7VFCPS4MA2KPNO2HC6ISZPTUS/graph.json","events_json":"https://pith.science/api/pith-number/X7VFCPS4MA2KPNO2HC6ISZPTUS/events.json","paper":"https://pith.science/paper/X7VFCPS4"},"agent_actions":{"view_html":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS","download_json":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS.json","view_paper":"https://pith.science/paper/X7VFCPS4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4655&json=true","fetch_graph":"https://pith.science/api/pith-number/X7VFCPS4MA2KPNO2HC6ISZPTUS/graph.json","fetch_events":"https://pith.science/api/pith-number/X7VFCPS4MA2KPNO2HC6ISZPTUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS/action/storage_attestation","attest_author":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS/action/author_attestation","sign_citation":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS/action/citation_signature","submit_replication":"https://pith.science/pith/X7VFCPS4MA2KPNO2HC6ISZPTUS/action/replication_record"}},"created_at":"2026-05-18T03:18:17.410657+00:00","updated_at":"2026-05-18T03:18:17.410657+00:00"}