{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FCQPCN25C4K5WCQH7LS37R6YS4","short_pith_number":"pith:FCQPCN25","schema_version":"1.0","canonical_sha256":"28a0f1375d1715db0a07fae5bfc7d8972f0eb71e81187eda6c207187061a479f","source":{"kind":"arxiv","id":"2606.31344","version":1},"attestation_state":"computed","paper":{"title":"Spatial Model Checking of Images via Minimised Models and Branching Bisimilarity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Diego Latella, Erik P. de Vink, Jan Friso Groote, Mieke Massink, Vincenzo Ciancia","submitted_at":"2026-06-30T08:43:21Z","abstract_excerpt":"Spatial models are of increasing interest in traditional computer science domains and beyond. Spatial minimisation procedures are crucial for efficient model checking of such models that are often large in size. For the recent notion of spatial bisimilarity for quasi-discrete closure models, called `Compatible Paths' (CoPa) bisimilarity, an effective minimisation method is proposed, and shown to be correct. Reasoning about space represented by quasi-discrete closure models involves two different conditional reachability modalities: a forward reachability, similar to that used in temporal logic"},"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":"2606.31344","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-30T08:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"1e02d45a356c60bf16a764bc69bb03d142a15a8a193c100d7fe98039ae5d4140","abstract_canon_sha256":"834940ab16bb279fa0d4cfbe05c03986f63c37a34c34a95af92993ce279226d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:17:59.950100Z","signature_b64":"o37b5ZX0o9Pb5xcAWwUK4qxEiykPpz0TsRDxJ6a/uX0QVnHlZl/4exyun2/vVfeYokg2QBKX/KiCC9QQFGgbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28a0f1375d1715db0a07fae5bfc7d8972f0eb71e81187eda6c207187061a479f","last_reissued_at":"2026-07-01T01:17:59.949674Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:17:59.949674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial Model Checking of Images via Minimised Models and Branching Bisimilarity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Diego Latella, Erik P. de Vink, Jan Friso Groote, Mieke Massink, Vincenzo Ciancia","submitted_at":"2026-06-30T08:43:21Z","abstract_excerpt":"Spatial models are of increasing interest in traditional computer science domains and beyond. Spatial minimisation procedures are crucial for efficient model checking of such models that are often large in size. For the recent notion of spatial bisimilarity for quasi-discrete closure models, called `Compatible Paths' (CoPa) bisimilarity, an effective minimisation method is proposed, and shown to be correct. Reasoning about space represented by quasi-discrete closure models involves two different conditional reachability modalities: a forward reachability, similar to that used in temporal logic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31344","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.31344/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":"2606.31344","created_at":"2026-07-01T01:17:59.949734+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31344v1","created_at":"2026-07-01T01:17:59.949734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31344","created_at":"2026-07-01T01:17:59.949734+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCQPCN25C4K5","created_at":"2026-07-01T01:17:59.949734+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCQPCN25C4K5WCQH","created_at":"2026-07-01T01:17:59.949734+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCQPCN25","created_at":"2026-07-01T01:17:59.949734+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/FCQPCN25C4K5WCQH7LS37R6YS4","json":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4.json","graph_json":"https://pith.science/api/pith-number/FCQPCN25C4K5WCQH7LS37R6YS4/graph.json","events_json":"https://pith.science/api/pith-number/FCQPCN25C4K5WCQH7LS37R6YS4/events.json","paper":"https://pith.science/paper/FCQPCN25"},"agent_actions":{"view_html":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4","download_json":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4.json","view_paper":"https://pith.science/paper/FCQPCN25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31344&json=true","fetch_graph":"https://pith.science/api/pith-number/FCQPCN25C4K5WCQH7LS37R6YS4/graph.json","fetch_events":"https://pith.science/api/pith-number/FCQPCN25C4K5WCQH7LS37R6YS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4/action/storage_attestation","attest_author":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4/action/author_attestation","sign_citation":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4/action/citation_signature","submit_replication":"https://pith.science/pith/FCQPCN25C4K5WCQH7LS37R6YS4/action/replication_record"}},"created_at":"2026-07-01T01:17:59.949734+00:00","updated_at":"2026-07-01T01:17:59.949734+00:00"}