{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ZZ562TQYCI7VM3PMDMWIMBVWBY","short_pith_number":"pith:ZZ562TQY","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"},"canonical_sha256":"ce7bed4e18123f566dec1b2c8606b60e3daebce85bab309bbf55bcfbdea88e89","source":{"kind":"arxiv","id":"2212.03684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03684","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03684v1","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03684","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ562TQYCI7V","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ562TQYCI7VM3PM","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ562TQY","created_at":"2026-07-05T05:50:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ZZ562TQYCI7VM3PMDMWIMBVWBY","target":"record","payload":{"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"},"canonical_sha256":"ce7bed4e18123f566dec1b2c8606b60e3daebce85bab309bbf55bcfbdea88e89","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"},"source_kind":"arxiv","source_id":"2212.03684","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HyRcz5iKeYv5WUmI3WtSUQhPnwAVSMuMiKQC+li49RxKp3kZZ151jFQEJ9+KotPSsIf1Tzvm3HYBrLb+hGizCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:38:45.354684Z"},"content_sha256":"3b4358261746ee602f391dd72bd092b6df4eaca41f42dc03dd93d7e4af009ede","schema_version":"1.0","event_id":"sha256:3b4358261746ee602f391dd72bd092b6df4eaca41f42dc03dd93d7e4af009ede"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ZZ562TQYCI7VM3PMDMWIMBVWBY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jevRYy2MtcgDvAQ2UIvkC53N90BhzBdi6SHrySMApwTc4/2fNNi6V8MvVZ8SS3WRS4yeGYq5gbHcmEM3dKUGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T15:38:45.355520Z"},"content_sha256":"b1ecf0fe2115174fb93963b28a10fc77275486cf904ec8531c09702f897687ec","schema_version":"1.0","event_id":"sha256:b1ecf0fe2115174fb93963b28a10fc77275486cf904ec8531c09702f897687ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/bundle.json","state_url":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T15:38:45Z","links":{"resolver":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY","bundle":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/bundle.json","state":"https://pith.science/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZ562TQYCI7VM3PMDMWIMBVWBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ZZ562TQYCI7VM3PMDMWIMBVWBY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a50f49e94c41f95b36269addddb41fa2313645724c2f7bb77017122110fdc05f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-12-07T14:57:25Z","title_canon_sha256":"f762fe7651c560f06b5968115ef165ca5386b9ddd3d4cc777ec40c727d41c5cd"},"schema_version":"1.0","source":{"id":"2212.03684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03684","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03684v1","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03684","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ562TQYCI7V","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ562TQYCI7VM3PM","created_at":"2026-07-05T05:50:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ562TQY","created_at":"2026-07-05T05:50:11Z"}],"graph_snapshots":[{"event_id":"sha256:b1ecf0fe2115174fb93963b28a10fc77275486cf904ec8531c09702f897687ec","target":"graph","created_at":"2026-07-05T05:50:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.03684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. ","authors_text":"Alfons Laarman, Sebastiaan Brand, Thomas B\\\"ack","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-12-07T14:57:25Z","title":"A Decision Diagram Operation for Reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03684","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b4358261746ee602f391dd72bd092b6df4eaca41f42dc03dd93d7e4af009ede","target":"record","created_at":"2026-07-05T05:50:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a50f49e94c41f95b36269addddb41fa2313645724c2f7bb77017122110fdc05f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-12-07T14:57:25Z","title_canon_sha256":"f762fe7651c560f06b5968115ef165ca5386b9ddd3d4cc777ec40c727d41c5cd"},"schema_version":"1.0","source":{"id":"2212.03684","kind":"arxiv","version":1}},"canonical_sha256":"ce7bed4e18123f566dec1b2c8606b60e3daebce85bab309bbf55bcfbdea88e89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce7bed4e18123f566dec1b2c8606b60e3daebce85bab309bbf55bcfbdea88e89","first_computed_at":"2026-07-05T05:50:11.864607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:50:11.864607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wUWRbr+NI6013L5Q8yjAvg4HtvbBy1gSohIlATSB+HHsOTJx8B4Y5QJsG574F1FosyMBGE4sSCEwn7Woek+HDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:50:11.865003Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.03684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b4358261746ee602f391dd72bd092b6df4eaca41f42dc03dd93d7e4af009ede","sha256:b1ecf0fe2115174fb93963b28a10fc77275486cf904ec8531c09702f897687ec"],"state_sha256":"049d9f2fcacdab3c1c5b63a180ac9da78de13c8a9a8e36632f9f911aad2d5772"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/i6HhOqj373x5gLj+y9PqydAB5zcvreFB5uCw8neAu+qwRx1lqADmMnk+ggx0Qd1Gd0pVqJWbgj2M2cPfVVfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T15:38:45.362473Z","bundle_sha256":"32867e2ac42dec7e4b76899ddd3075aea6245f5e8ab931cd8c1b735618e6c33b"}}