{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZZ562TQYCI7VM3PMDMWIMBVWBY","short_pith_number":"pith:ZZ562TQY","schema_version":"1.0","canonical_sha256":"ce7bed4e18123f566dec1b2c8606b60e3daebce85bab309bbf55bcfbdea88e89","source":{"kind":"arxiv","id":"2212.03684","version":1},"attestation_state":"computed","paper":{"title":"A Decision Diagram Operation for Reachability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alfons Laarman, Sebastiaan Brand, Thomas B\\\"ack","submitted_at":"2022-12-07T14:57:25Z","abstract_excerpt":"Saturation is considered the state-of-the-art method for computing fixpoints with decision diagrams. We present a relatively simple decision diagram operation called REACH that also computes fixpoints. In contrast to saturation, it does not require a partitioning of the transition relation. We give sequential algorithms implementing the new operation for both binary and multi-valued decision diagrams, and moreover provide parallel counterparts. We implement these algorithms and experimentally compare their performance against saturation on 692 model checking benchmarks in different languages. "},"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":"2212.03684","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-12-07T14:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"f762fe7651c560f06b5968115ef165ca5386b9ddd3d4cc777ec40c727d41c5cd","abstract_canon_sha256":"a50f49e94c41f95b36269addddb41fa2313645724c2f7bb77017122110fdc05f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:50:11.865003Z","signature_b64":"wUWRbr+NI6013L5Q8yjAvg4HtvbBy1gSohIlATSB+HHsOTJx8B4Y5QJsG574F1FosyMBGE4sSCEwn7Woek+HDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce7bed4e18123f566dec1b2c8606b60e3daebce85bab309bbf55bcfbdea88e89","last_reissued_at":"2026-07-05T05:50:11.864607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:50:11.864607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decision Diagram Operation for Reachability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alfons Laarman, Sebastiaan Brand, Thomas B\\\"ack","submitted_at":"2022-12-07T14:57:25Z","abstract_excerpt":"Saturation is considered the state-of-the-art method for computing fixpoints with decision diagrams. We present a relatively simple decision diagram operation called REACH that also computes fixpoints. In contrast to saturation, it does not require a partitioning of the transition relation. We give sequential algorithms implementing the new operation for both binary and multi-valued decision diagrams, and moreover provide parallel counterparts. We implement these algorithms and experimentally compare their performance against saturation on 692 model checking benchmarks in different languages. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03684","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.03684/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2212.03684","created_at":"2026-07-05T05:50:11.864666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.03684v1","created_at":"2026-07-05T05:50:11.864666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03684","created_at":"2026-07-05T05:50:11.864666+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZ562TQYCI7V","created_at":"2026-07-05T05:50:11.864666+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZ562TQYCI7VM3PM","created_at":"2026-07-05T05:50:11.864666+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZ562TQY","created_at":"2026-07-05T05:50:11.864666+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/ZZ562TQYCI7VM3PMDMWIMBVWBY","json":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY.json","graph_json":"https://pith.science/api/pith-number/ZZ562TQYCI7VM3PMDMWIMBVWBY/graph.json","events_json":"https://pith.science/api/pith-number/ZZ562TQYCI7VM3PMDMWIMBVWBY/events.json","paper":"https://pith.science/paper/ZZ562TQY"},"agent_actions":{"view_html":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY","download_json":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY.json","view_paper":"https://pith.science/paper/ZZ562TQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.03684&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZ562TQYCI7VM3PMDMWIMBVWBY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZ562TQYCI7VM3PMDMWIMBVWBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/action/storage_attestation","attest_author":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/action/author_attestation","sign_citation":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/action/citation_signature","submit_replication":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/action/replication_record"}},"created_at":"2026-07-05T05:50:11.864666+00:00","updated_at":"2026-07-05T05:50:11.864666+00:00"}