{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4FHN4Z3DXO2I57OY3JBXY45MPZ","short_pith_number":"pith:4FHN4Z3D","schema_version":"1.0","canonical_sha256":"e14ede6763bbb48efdd8da437c73ac7e51f7caaa99e7dd91101f7b34ccf0c2cb","source":{"kind":"arxiv","id":"1410.2442","version":2},"attestation_state":"computed","paper":{"title":"Realizing RCC8 networks using convex regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Sanjiang Li, Steven Schockaert","submitted_at":"2014-10-09T12:54:08Z","abstract_excerpt":"RCC8 is a popular fragment of the region connection calculus, in which qualitative spatial relations between regions, such as adjacency, overlap and parthood, can be expressed. While RCC8 is essentially dimensionless, most current applications are confined to reasoning about two-dimensional or three-dimensional physical space. In this paper, however, we are mainly interested in conceptual spaces, which typically are high-dimensional Euclidean spaces in which the meaning of natural language concepts can be represented using convex regions. The aim of this paper is to analyze how the restriction"},"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":"1410.2442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-10-09T12:54:08Z","cross_cats_sorted":[],"title_canon_sha256":"69fec41b62d3f2149106669b0c16484c13b72e16ceb3f1336ecc94a72316f138","abstract_canon_sha256":"7341648279b6935f75526d05ab31d1229e1f295e9388b6714f106f8d7ae58f9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:55.316923Z","signature_b64":"5B5ZJa1G/ExdQx3A3GGA6vfLBxFXnIyTffMa5MFc5rKblaQEzz5rglKZ6IRmEBubXdefTTPWaL73ki3nDFaVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14ede6763bbb48efdd8da437c73ac7e51f7caaa99e7dd91101f7b34ccf0c2cb","last_reissued_at":"2026-05-18T02:39:55.316531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:55.316531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Realizing RCC8 networks using convex regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Sanjiang Li, Steven Schockaert","submitted_at":"2014-10-09T12:54:08Z","abstract_excerpt":"RCC8 is a popular fragment of the region connection calculus, in which qualitative spatial relations between regions, such as adjacency, overlap and parthood, can be expressed. While RCC8 is essentially dimensionless, most current applications are confined to reasoning about two-dimensional or three-dimensional physical space. In this paper, however, we are mainly interested in conceptual spaces, which typically are high-dimensional Euclidean spaces in which the meaning of natural language concepts can be represented using convex regions. The aim of this paper is to analyze how the restriction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2442","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.2442","created_at":"2026-05-18T02:39:55.316588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2442v2","created_at":"2026-05-18T02:39:55.316588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2442","created_at":"2026-05-18T02:39:55.316588+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FHN4Z3DXO2I","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FHN4Z3DXO2I57OY","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FHN4Z3D","created_at":"2026-05-18T12:28:14.216126+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/4FHN4Z3DXO2I57OY3JBXY45MPZ","json":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ.json","graph_json":"https://pith.science/api/pith-number/4FHN4Z3DXO2I57OY3JBXY45MPZ/graph.json","events_json":"https://pith.science/api/pith-number/4FHN4Z3DXO2I57OY3JBXY45MPZ/events.json","paper":"https://pith.science/paper/4FHN4Z3D"},"agent_actions":{"view_html":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ","download_json":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ.json","view_paper":"https://pith.science/paper/4FHN4Z3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2442&json=true","fetch_graph":"https://pith.science/api/pith-number/4FHN4Z3DXO2I57OY3JBXY45MPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4FHN4Z3DXO2I57OY3JBXY45MPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ/action/storage_attestation","attest_author":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ/action/author_attestation","sign_citation":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ/action/citation_signature","submit_replication":"https://pith.science/pith/4FHN4Z3DXO2I57OY3JBXY45MPZ/action/replication_record"}},"created_at":"2026-05-18T02:39:55.316588+00:00","updated_at":"2026-05-18T02:39:55.316588+00:00"}