{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KO3XP24FCXUZQFF7JHRDDKBQLQ","short_pith_number":"pith:KO3XP24F","schema_version":"1.0","canonical_sha256":"53b777eb8515e99814bf49e231a8305c34c68bc11cabbc96aecf965cc748fdc6","source":{"kind":"arxiv","id":"2504.05577","version":2},"attestation_state":"computed","paper":{"title":"BoolE: Exact Symbolic Reasoning via Boolean Equality Saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Chen Chen, Cunxi Yu, Jiaqi Yin, Qihao Hu, Zhan Song","submitted_at":"2025-04-08T00:25:25Z","abstract_excerpt":"Boolean symbolic reasoning for gate-level netlists is a critical step in verification, logic and datapath synthesis, and hardware security. Specifically, reasoning datapath and adder tree in bit-blasted Boolean networks is particularly crucial for verification and synthesis, and challenging. Conventional approaches either fail to accurately (exactly) identify the function blocks of the designs in gate-level netlist with structural hashing and symbolic propagation, or their reasoning performance is highly sensitive to structure modifications caused by technology mapping or logic optimization. T"},"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":"2504.05577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2025-04-08T00:25:25Z","cross_cats_sorted":[],"title_canon_sha256":"a6d3b21244d9dad80988362aad6943c86407b0268cf1e1a15cb31e97f68dc314","abstract_canon_sha256":"92ee39896034405b321c824961a4c1be523ccea7326ecc0b66d6c9b9dcfc5193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:36.086197Z","signature_b64":"URwIOC5ifS9Ki8Sg+m1scN6XBPlT3MhmP7XYAjJO6UurFhj7dD6jrFEfNoEE7zFCmTSm83qCX4ZSFCUZrq8ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53b777eb8515e99814bf49e231a8305c34c68bc11cabbc96aecf965cc748fdc6","last_reissued_at":"2026-07-05T10:51:36.085730Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:36.085730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BoolE: Exact Symbolic Reasoning via Boolean Equality Saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Chen Chen, Cunxi Yu, Jiaqi Yin, Qihao Hu, Zhan Song","submitted_at":"2025-04-08T00:25:25Z","abstract_excerpt":"Boolean symbolic reasoning for gate-level netlists is a critical step in verification, logic and datapath synthesis, and hardware security. Specifically, reasoning datapath and adder tree in bit-blasted Boolean networks is particularly crucial for verification and synthesis, and challenging. Conventional approaches either fail to accurately (exactly) identify the function blocks of the designs in gate-level netlist with structural hashing and symbolic propagation, or their reasoning performance is highly sensitive to structure modifications caused by technology mapping or logic optimization. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05577","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/2504.05577/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":"2504.05577","created_at":"2026-07-05T10:51:36.085791+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.05577v2","created_at":"2026-07-05T10:51:36.085791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05577","created_at":"2026-07-05T10:51:36.085791+00:00"},{"alias_kind":"pith_short_12","alias_value":"KO3XP24FCXUZ","created_at":"2026-07-05T10:51:36.085791+00:00"},{"alias_kind":"pith_short_16","alias_value":"KO3XP24FCXUZQFF7","created_at":"2026-07-05T10:51:36.085791+00:00"},{"alias_kind":"pith_short_8","alias_value":"KO3XP24F","created_at":"2026-07-05T10:51:36.085791+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/KO3XP24FCXUZQFF7JHRDDKBQLQ","json":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ.json","graph_json":"https://pith.science/api/pith-number/KO3XP24FCXUZQFF7JHRDDKBQLQ/graph.json","events_json":"https://pith.science/api/pith-number/KO3XP24FCXUZQFF7JHRDDKBQLQ/events.json","paper":"https://pith.science/paper/KO3XP24F"},"agent_actions":{"view_html":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ","download_json":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ.json","view_paper":"https://pith.science/paper/KO3XP24F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.05577&json=true","fetch_graph":"https://pith.science/api/pith-number/KO3XP24FCXUZQFF7JHRDDKBQLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KO3XP24FCXUZQFF7JHRDDKBQLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/action/storage_attestation","attest_author":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/action/author_attestation","sign_citation":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/action/citation_signature","submit_replication":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/action/replication_record"}},"created_at":"2026-07-05T10:51:36.085791+00:00","updated_at":"2026-07-05T10:51:36.085791+00:00"}