{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FS3CAOBRJOLON7MRPBSNMC3WVS","short_pith_number":"pith:FS3CAOBR","schema_version":"1.0","canonical_sha256":"2cb62038314b96e6fd917864d60b76ac9aaa9db5e2ef32dc367ba0cf7742ec3f","source":{"kind":"arxiv","id":"1805.07434","version":1},"attestation_state":"computed","paper":{"title":"Reachability Analysis for Spatial Concurrent Constraint Systems with Extrusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Camilo Rocha, Miguel Romero","submitted_at":"2018-05-18T20:38:16Z","abstract_excerpt":"Spatial concurrent constraint programming (SCCP) is an algebraic model of spatial modalities in constrained-based process calculi; it can be used to reason about spatial information distributed among the agents of a system. This work presents an executable rewriting logic semantics of SCCP with extrusion (i.e., process mobility) that uses rewriting modulo SMT, a novel technique that combines the power of term rewriting, matching algorithms, and SMT-solving. In this setting, constraints are encoded as formulas in a theory with a satisfaction relation decided by an SMT solver, while the topology"},"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":"1805.07434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-18T20:38:16Z","cross_cats_sorted":[],"title_canon_sha256":"88c40138f163b3bd66004106af895390ae9bbc425d1d442f730c9afb45d10724","abstract_canon_sha256":"1954698dae67ff85281ded5c6eb3c057b9fb9969fa9a4d40a93d407d9bd2a817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:33.609465Z","signature_b64":"hPlMGl+aK0r/GcEWZYLMtI3CN8osOY4hvvwDlZ16Z8KNUPlaLImJNAuRPJtI6CNsk/n1TTC98pkyIROD/13YAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cb62038314b96e6fd917864d60b76ac9aaa9db5e2ef32dc367ba0cf7742ec3f","last_reissued_at":"2026-05-18T00:15:33.608918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:33.608918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability Analysis for Spatial Concurrent Constraint Systems with Extrusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Camilo Rocha, Miguel Romero","submitted_at":"2018-05-18T20:38:16Z","abstract_excerpt":"Spatial concurrent constraint programming (SCCP) is an algebraic model of spatial modalities in constrained-based process calculi; it can be used to reason about spatial information distributed among the agents of a system. This work presents an executable rewriting logic semantics of SCCP with extrusion (i.e., process mobility) that uses rewriting modulo SMT, a novel technique that combines the power of term rewriting, matching algorithms, and SMT-solving. In this setting, constraints are encoded as formulas in a theory with a satisfaction relation decided by an SMT solver, while the topology"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07434","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":"1805.07434","created_at":"2026-05-18T00:15:33.609020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07434v1","created_at":"2026-05-18T00:15:33.609020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07434","created_at":"2026-05-18T00:15:33.609020+00:00"},{"alias_kind":"pith_short_12","alias_value":"FS3CAOBRJOLO","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FS3CAOBRJOLON7MR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FS3CAOBR","created_at":"2026-05-18T12:32:25.280505+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/FS3CAOBRJOLON7MRPBSNMC3WVS","json":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS.json","graph_json":"https://pith.science/api/pith-number/FS3CAOBRJOLON7MRPBSNMC3WVS/graph.json","events_json":"https://pith.science/api/pith-number/FS3CAOBRJOLON7MRPBSNMC3WVS/events.json","paper":"https://pith.science/paper/FS3CAOBR"},"agent_actions":{"view_html":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS","download_json":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS.json","view_paper":"https://pith.science/paper/FS3CAOBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07434&json=true","fetch_graph":"https://pith.science/api/pith-number/FS3CAOBRJOLON7MRPBSNMC3WVS/graph.json","fetch_events":"https://pith.science/api/pith-number/FS3CAOBRJOLON7MRPBSNMC3WVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS/action/storage_attestation","attest_author":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS/action/author_attestation","sign_citation":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS/action/citation_signature","submit_replication":"https://pith.science/pith/FS3CAOBRJOLON7MRPBSNMC3WVS/action/replication_record"}},"created_at":"2026-05-18T00:15:33.609020+00:00","updated_at":"2026-05-18T00:15:33.609020+00:00"}