{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N6HTZYV6QTQYDIYBLI6F32244I","short_pith_number":"pith:N6HTZYV6","schema_version":"1.0","canonical_sha256":"6f8f3ce2be84e181a3015a3c5deb5ce2333d1a22ac64110385c6d4a762645dc2","source":{"kind":"arxiv","id":"1506.04945","version":1},"attestation_state":"computed","paper":{"title":"Spatial Symmetry Driven Pruning Strategies for Efficient Declarative Spatial Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Carl Schultz, Mehul Bhatt","submitted_at":"2015-06-16T12:40:30Z","abstract_excerpt":"Declarative spatial reasoning denotes the ability to (declaratively) specify and solve real-world problems related to geometric and qualitative spatial representation and reasoning within standard knowledge representation and reasoning (KR) based methods (e.g., logic programming and derivatives). One approach for encoding the semantics of spatial relations within a declarative programming framework is by systems of polynomial constraints. However, solving such constraints is computationally intractable in general (i.e. the theory of real-closed fields).\n  We present a new algorithm, implemente"},"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":"1506.04945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-16T12:40:30Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"57a4c2ffde7de6de1a8b714ed3e4b23dc43144d9312f6454a4577f5759011e19","abstract_canon_sha256":"506f3b46679039299f7e86ccadade883a64486cd4877bf00053c54a60cd01309"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:05.421539Z","signature_b64":"EYE3tAIDGPiJyvvGcW4vbss40krh+C/lMjMPP0wVHufDMOvA/Ih9ZJ4pwPtigosqLpes9vlTwlOrHkIgqYlNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f8f3ce2be84e181a3015a3c5deb5ce2333d1a22ac64110385c6d4a762645dc2","last_reissued_at":"2026-05-18T01:48:05.421083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:05.421083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial Symmetry Driven Pruning Strategies for Efficient Declarative Spatial Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.AI","authors_text":"Carl Schultz, Mehul Bhatt","submitted_at":"2015-06-16T12:40:30Z","abstract_excerpt":"Declarative spatial reasoning denotes the ability to (declaratively) specify and solve real-world problems related to geometric and qualitative spatial representation and reasoning within standard knowledge representation and reasoning (KR) based methods (e.g., logic programming and derivatives). One approach for encoding the semantics of spatial relations within a declarative programming framework is by systems of polynomial constraints. However, solving such constraints is computationally intractable in general (i.e. the theory of real-closed fields).\n  We present a new algorithm, implemente"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04945","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":"1506.04945","created_at":"2026-05-18T01:48:05.421152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04945v1","created_at":"2026-05-18T01:48:05.421152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04945","created_at":"2026-05-18T01:48:05.421152+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6HTZYV6QTQY","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6HTZYV6QTQYDIYB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6HTZYV6","created_at":"2026-05-18T12:29:32.376354+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/N6HTZYV6QTQYDIYBLI6F32244I","json":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I.json","graph_json":"https://pith.science/api/pith-number/N6HTZYV6QTQYDIYBLI6F32244I/graph.json","events_json":"https://pith.science/api/pith-number/N6HTZYV6QTQYDIYBLI6F32244I/events.json","paper":"https://pith.science/paper/N6HTZYV6"},"agent_actions":{"view_html":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I","download_json":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I.json","view_paper":"https://pith.science/paper/N6HTZYV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04945&json=true","fetch_graph":"https://pith.science/api/pith-number/N6HTZYV6QTQYDIYBLI6F32244I/graph.json","fetch_events":"https://pith.science/api/pith-number/N6HTZYV6QTQYDIYBLI6F32244I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I/action/storage_attestation","attest_author":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I/action/author_attestation","sign_citation":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I/action/citation_signature","submit_replication":"https://pith.science/pith/N6HTZYV6QTQYDIYBLI6F32244I/action/replication_record"}},"created_at":"2026-05-18T01:48:05.421152+00:00","updated_at":"2026-05-18T01:48:05.421152+00:00"}