{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NANGHFWWVWJGKYHBAND3CIQGTH","short_pith_number":"pith:NANGHFWW","schema_version":"1.0","canonical_sha256":"681a6396d6ad926560e10347b1220699e8a570f77603826b88048036b7fa5a17","source":{"kind":"arxiv","id":"1512.09186","version":1},"attestation_state":"computed","paper":{"title":"Collapsing Threads Safely with Soft Invariants","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Friggens, Lindsay Groves","submitted_at":"2015-12-31T00:23:29Z","abstract_excerpt":"Canonical abstraction is a static analysis technique that represents states as 3-valued logical structures, and produces finite abstract systems. Despite providing a finite bound, these abstractions may still suffer from the state explosion problem. Notably, for concurrent programs with arbitrary interleaving, if threads in a state are abstracted based on their location, then the number of locations will be a combinatorial factor in the size of the statespace. We present an approach using canonical abstraction that avoids this state explosion by \"collapsing\" all of the threads in a state into "},"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":"1512.09186","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2015-12-31T00:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"b5de578e4f0a5d30739a48ac37a62054024659f72b7959842e2e7ba8fc83163c","abstract_canon_sha256":"f20d3acec1cda239b9e325e736a6453bb6afe4943319db1db1a68d22296e71ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:33.074474Z","signature_b64":"2VIKvdR6p7oIFVdmZAmvgxo900V94yzx176aZTFeCsiirLRH/3EmrvsrfSf1R9kZ5SCuSvCCZXPZ2twnk0ztCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"681a6396d6ad926560e10347b1220699e8a570f77603826b88048036b7fa5a17","last_reissued_at":"2026-05-18T01:23:33.073760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:33.073760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collapsing Threads Safely with Soft Invariants","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Friggens, Lindsay Groves","submitted_at":"2015-12-31T00:23:29Z","abstract_excerpt":"Canonical abstraction is a static analysis technique that represents states as 3-valued logical structures, and produces finite abstract systems. Despite providing a finite bound, these abstractions may still suffer from the state explosion problem. Notably, for concurrent programs with arbitrary interleaving, if threads in a state are abstracted based on their location, then the number of locations will be a combinatorial factor in the size of the statespace. We present an approach using canonical abstraction that avoids this state explosion by \"collapsing\" all of the threads in a state into "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09186","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":"1512.09186","created_at":"2026-05-18T01:23:33.073876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09186v1","created_at":"2026-05-18T01:23:33.073876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09186","created_at":"2026-05-18T01:23:33.073876+00:00"},{"alias_kind":"pith_short_12","alias_value":"NANGHFWWVWJG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NANGHFWWVWJGKYHB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NANGHFWW","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/NANGHFWWVWJGKYHBAND3CIQGTH","json":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH.json","graph_json":"https://pith.science/api/pith-number/NANGHFWWVWJGKYHBAND3CIQGTH/graph.json","events_json":"https://pith.science/api/pith-number/NANGHFWWVWJGKYHBAND3CIQGTH/events.json","paper":"https://pith.science/paper/NANGHFWW"},"agent_actions":{"view_html":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH","download_json":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH.json","view_paper":"https://pith.science/paper/NANGHFWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09186&json=true","fetch_graph":"https://pith.science/api/pith-number/NANGHFWWVWJGKYHBAND3CIQGTH/graph.json","fetch_events":"https://pith.science/api/pith-number/NANGHFWWVWJGKYHBAND3CIQGTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH/action/storage_attestation","attest_author":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH/action/author_attestation","sign_citation":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH/action/citation_signature","submit_replication":"https://pith.science/pith/NANGHFWWVWJGKYHBAND3CIQGTH/action/replication_record"}},"created_at":"2026-05-18T01:23:33.073876+00:00","updated_at":"2026-05-18T01:23:33.073876+00:00"}