{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VQKGLEWPJSMRSGZU2YXBHOYVK4","short_pith_number":"pith:VQKGLEWP","schema_version":"1.0","canonical_sha256":"ac146592cf4c99191b34d62e13bb15570af8120b3388251e6eb2e040f53a6e41","source":{"kind":"arxiv","id":"1109.5522","version":1},"attestation_state":"computed","paper":{"title":"Shared Memory Concurrent System Verification using Kronecker Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Johann Blieberger, Robert Mittermayr","submitted_at":"2011-09-26T11:23:04Z","abstract_excerpt":"The verification of multithreaded software is still a challenge. This comes mainly from the fact that the number of thread interleavings grows exponentially in the number of threads. The idea that thread interleavings can be studied with a matrix calculus is a novel approach in this research area. Our sparse matrix representations of the program are manipulated using a lazy implementation of Kronecker algebra. One goal is the generation of a data structure called Concurrent Program Graph (CPG) which describes all possible interleavings and incorporates synchronization while preserving complete"},"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":"1109.5522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-26T11:23:04Z","cross_cats_sorted":[],"title_canon_sha256":"630d81f95dd549324c99e93e37677ad63c722fe116a37fe6136b4744200519cd","abstract_canon_sha256":"0ec7d122b1d767a0c8d4a364a778d798cecb498cf49c9b4469884af3baedc172"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:19.590163Z","signature_b64":"7D9zasogooucjWg4uHUS/LJ8zPl4gpBAPxiOTTiVSCiWu1IFEXi8jvQOfpPYnh/qSOvyxnSUPv5ygqcH8vO3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac146592cf4c99191b34d62e13bb15570af8120b3388251e6eb2e040f53a6e41","last_reissued_at":"2026-05-18T04:12:19.589570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:19.589570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shared Memory Concurrent System Verification using Kronecker Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Johann Blieberger, Robert Mittermayr","submitted_at":"2011-09-26T11:23:04Z","abstract_excerpt":"The verification of multithreaded software is still a challenge. This comes mainly from the fact that the number of thread interleavings grows exponentially in the number of threads. The idea that thread interleavings can be studied with a matrix calculus is a novel approach in this research area. Our sparse matrix representations of the program are manipulated using a lazy implementation of Kronecker algebra. One goal is the generation of a data structure called Concurrent Program Graph (CPG) which describes all possible interleavings and incorporates synchronization while preserving complete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5522","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":"1109.5522","created_at":"2026-05-18T04:12:19.589656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5522v1","created_at":"2026-05-18T04:12:19.589656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5522","created_at":"2026-05-18T04:12:19.589656+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQKGLEWPJSMR","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQKGLEWPJSMRSGZU","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQKGLEWP","created_at":"2026-05-18T12:26:44.992195+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/VQKGLEWPJSMRSGZU2YXBHOYVK4","json":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4.json","graph_json":"https://pith.science/api/pith-number/VQKGLEWPJSMRSGZU2YXBHOYVK4/graph.json","events_json":"https://pith.science/api/pith-number/VQKGLEWPJSMRSGZU2YXBHOYVK4/events.json","paper":"https://pith.science/paper/VQKGLEWP"},"agent_actions":{"view_html":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4","download_json":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4.json","view_paper":"https://pith.science/paper/VQKGLEWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5522&json=true","fetch_graph":"https://pith.science/api/pith-number/VQKGLEWPJSMRSGZU2YXBHOYVK4/graph.json","fetch_events":"https://pith.science/api/pith-number/VQKGLEWPJSMRSGZU2YXBHOYVK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4/action/storage_attestation","attest_author":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4/action/author_attestation","sign_citation":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4/action/citation_signature","submit_replication":"https://pith.science/pith/VQKGLEWPJSMRSGZU2YXBHOYVK4/action/replication_record"}},"created_at":"2026-05-18T04:12:19.589656+00:00","updated_at":"2026-05-18T04:12:19.589656+00:00"}