{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YGYOD27IFHDQRJFSGM6JHJBTS5","short_pith_number":"pith:YGYOD27I","schema_version":"1.0","canonical_sha256":"c1b0e1ebe829c708a4b2333c93a4339746d64562588b71bc3115d19943ca68ab","source":{"kind":"arxiv","id":"2411.17250","version":2},"attestation_state":"computed","paper":{"title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Jakob Schulz, Javier Esparza, Michael Blondin, Micha\\\"el Cadilhac, Philipp Czerner, Xin-Yi Cui","submitted_at":"2024-11-26T09:28:43Z","abstract_excerpt":"Ordered binary decision diagrams (OBDDs) are a fundamental data structure for the manipulation of Boolean functions, with strong applications to finite-state symbolic model checking. OBDDs allow for efficient algorithms using top-down dynamic programming. From an automata-theoretic perspective, OBDDs essentially are minimal deterministic finite automata recognizing languages whose words have a fixed length (the arity of the Boolean function). We introduce weakly acyclic diagrams (WADs), a generalization of OBDDs that maintains their algorithmic advantages, but can also represent infinite langu"},"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":"2411.17250","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-11-26T09:28:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"46e6061049d03c433e4a5191c8f25dfab38fa24cb33e927ca86d428c6383e94f","abstract_canon_sha256":"2a6d955b6c24acba51e91c8962b3b23cb0d03df780ecd8a58e04c242aeb50367"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:23.318388Z","signature_b64":"45+6BSrU9OWz5CS3GNqiBTqRKaBZ+eYU9irs+ra6CRcsRFFdpMspDImO2BoHO+H0lFu1GlMePV0Hm68ocQhGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1b0e1ebe829c708a4b2333c93a4339746d64562588b71bc3115d19943ca68ab","last_reissued_at":"2026-07-05T10:15:23.317922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:23.317922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Jakob Schulz, Javier Esparza, Michael Blondin, Micha\\\"el Cadilhac, Philipp Czerner, Xin-Yi Cui","submitted_at":"2024-11-26T09:28:43Z","abstract_excerpt":"Ordered binary decision diagrams (OBDDs) are a fundamental data structure for the manipulation of Boolean functions, with strong applications to finite-state symbolic model checking. OBDDs allow for efficient algorithms using top-down dynamic programming. From an automata-theoretic perspective, OBDDs essentially are minimal deterministic finite automata recognizing languages whose words have a fixed length (the arity of the Boolean function). We introduce weakly acyclic diagrams (WADs), a generalization of OBDDs that maintains their algorithmic advantages, but can also represent infinite langu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17250","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17250/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":"2411.17250","created_at":"2026-07-05T10:15:23.317982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17250v2","created_at":"2026-07-05T10:15:23.317982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17250","created_at":"2026-07-05T10:15:23.317982+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGYOD27IFHDQ","created_at":"2026-07-05T10:15:23.317982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGYOD27IFHDQRJFS","created_at":"2026-07-05T10:15:23.317982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGYOD27I","created_at":"2026-07-05T10:15:23.317982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17250","citing_title":"Weakly acyclic diagrams: A data structure for infinite-state symbolic verification","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5","json":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5.json","graph_json":"https://pith.science/api/pith-number/YGYOD27IFHDQRJFSGM6JHJBTS5/graph.json","events_json":"https://pith.science/api/pith-number/YGYOD27IFHDQRJFSGM6JHJBTS5/events.json","paper":"https://pith.science/paper/YGYOD27I"},"agent_actions":{"view_html":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5","download_json":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5.json","view_paper":"https://pith.science/paper/YGYOD27I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17250&json=true","fetch_graph":"https://pith.science/api/pith-number/YGYOD27IFHDQRJFSGM6JHJBTS5/graph.json","fetch_events":"https://pith.science/api/pith-number/YGYOD27IFHDQRJFSGM6JHJBTS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5/action/storage_attestation","attest_author":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5/action/author_attestation","sign_citation":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5/action/citation_signature","submit_replication":"https://pith.science/pith/YGYOD27IFHDQRJFSGM6JHJBTS5/action/replication_record"}},"created_at":"2026-07-05T10:15:23.317982+00:00","updated_at":"2026-07-05T10:15:23.317982+00:00"}