{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GGETBTP5WKR4SPNATRJ2NLC3S6","short_pith_number":"pith:GGETBTP5","schema_version":"1.0","canonical_sha256":"318930cdfdb2a3c93da09c53a6ac5b979b8a50d8564060a08132cb36f7708113","source":{"kind":"arxiv","id":"1402.6804","version":2},"attestation_state":"computed","paper":{"title":"Extending ALCQIO with reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Florian Zuleger, Helmut Veith, Mantas Simkus, Tomer Kotek","submitted_at":"2014-02-27T06:52:18Z","abstract_excerpt":"We introduce a description logic ALCQIO_{b,Re} which adds reachability assertions to ALCQIO, a sub-logic of the two-variable fragment of first order logic with counting quantifiers. ALCQIO_{b,Re} is well-suited for applications in software verification and shape analysis. Shape analysis requires expressive logics which can express reachability and have good computational properties. We show that ALCQIO_{b,Re} can describe complex data structures with a high degree of sharing and allows compositions such as list of trees.\n  We show that the finite satisfiability and implication problems of ALCQ"},"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":"1402.6804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-27T06:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"3c1281e02291189e707dd0e701b9283ab70c7dc687e8f449a9ef16aebc28c000","abstract_canon_sha256":"adfbcf80dd322fbded3bac2903c04c20f401b74dcaed6ba0a8a7ae8f709bfb47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:02.170689Z","signature_b64":"NGCC93JNtXw0V+5KcRPZV5LhtUeoKCLfFheKeYBhBzZTTTsAlbPN9j4XU5U8r19jkJjvZNwGYCUIpjL0r3zjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"318930cdfdb2a3c93da09c53a6ac5b979b8a50d8564060a08132cb36f7708113","last_reissued_at":"2026-05-18T02:48:02.170242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:02.170242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending ALCQIO with reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Florian Zuleger, Helmut Veith, Mantas Simkus, Tomer Kotek","submitted_at":"2014-02-27T06:52:18Z","abstract_excerpt":"We introduce a description logic ALCQIO_{b,Re} which adds reachability assertions to ALCQIO, a sub-logic of the two-variable fragment of first order logic with counting quantifiers. ALCQIO_{b,Re} is well-suited for applications in software verification and shape analysis. Shape analysis requires expressive logics which can express reachability and have good computational properties. We show that ALCQIO_{b,Re} can describe complex data structures with a high degree of sharing and allows compositions such as list of trees.\n  We show that the finite satisfiability and implication problems of ALCQ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6804","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":"1402.6804","created_at":"2026-05-18T02:48:02.170299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.6804v2","created_at":"2026-05-18T02:48:02.170299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6804","created_at":"2026-05-18T02:48:02.170299+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGETBTP5WKR4","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGETBTP5WKR4SPNA","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGETBTP5","created_at":"2026-05-18T12:28:30.664211+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/GGETBTP5WKR4SPNATRJ2NLC3S6","json":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6.json","graph_json":"https://pith.science/api/pith-number/GGETBTP5WKR4SPNATRJ2NLC3S6/graph.json","events_json":"https://pith.science/api/pith-number/GGETBTP5WKR4SPNATRJ2NLC3S6/events.json","paper":"https://pith.science/paper/GGETBTP5"},"agent_actions":{"view_html":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6","download_json":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6.json","view_paper":"https://pith.science/paper/GGETBTP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.6804&json=true","fetch_graph":"https://pith.science/api/pith-number/GGETBTP5WKR4SPNATRJ2NLC3S6/graph.json","fetch_events":"https://pith.science/api/pith-number/GGETBTP5WKR4SPNATRJ2NLC3S6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6/action/storage_attestation","attest_author":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6/action/author_attestation","sign_citation":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6/action/citation_signature","submit_replication":"https://pith.science/pith/GGETBTP5WKR4SPNATRJ2NLC3S6/action/replication_record"}},"created_at":"2026-05-18T02:48:02.170299+00:00","updated_at":"2026-05-18T02:48:02.170299+00:00"}