{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KO3XP24FCXUZQFF7JHRDDKBQLQ","short_pith_number":"pith:KO3XP24F","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"},"canonical_sha256":"53b777eb8515e99814bf49e231a8305c34c68bc11cabbc96aecf965cc748fdc6","source":{"kind":"arxiv","id":"2504.05577","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.05577","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"2504.05577v2","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05577","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"KO3XP24FCXUZ","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"pith_short_16","alias_value":"KO3XP24FCXUZQFF7","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"pith_short_8","alias_value":"KO3XP24F","created_at":"2026-07-05T10:51:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KO3XP24FCXUZQFF7JHRDDKBQLQ","target":"record","payload":{"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"},"canonical_sha256":"53b777eb8515e99814bf49e231a8305c34c68bc11cabbc96aecf965cc748fdc6","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"},"source_kind":"arxiv","source_id":"2504.05577","source_version":2,"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-05T10:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBMjBP1pm6MI0ImOF+Gx1eW0Wkth7LizWeotfwsaOHSpnW4LHdMguukJgCtYP5A014aAkeWT3U12oMTMuwYoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:00:48.146603Z"},"content_sha256":"b7cd66b8f46c231c61db108c4519ae372c45709ca0593154607ca4db36a9a96f","schema_version":"1.0","event_id":"sha256:b7cd66b8f46c231c61db108c4519ae372c45709ca0593154607ca4db36a9a96f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KO3XP24FCXUZQFF7JHRDDKBQLQ","target":"graph","payload":{"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"},"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-05T10:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPtTqcHlawiCxh9h7lqlWUBn7IBTRj6hNQ0CuV7Fm7Rq9VTnrgLYpKc8yocomClf1FPJI/CZ1YOS1eyVF0kQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:00:48.148804Z"},"content_sha256":"aa095afa2c81c4a2ad0e7525cfa616128069a2f8ea50b17ab633f253df30bb6b","schema_version":"1.0","event_id":"sha256:aa095afa2c81c4a2ad0e7525cfa616128069a2f8ea50b17ab633f253df30bb6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/bundle.json","state_url":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/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-03T19:00:48Z","links":{"resolver":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ","bundle":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/bundle.json","state":"https://pith.science/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KO3XP24FCXUZQFF7JHRDDKBQLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KO3XP24FCXUZQFF7JHRDDKBQLQ","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":"92ee39896034405b321c824961a4c1be523ccea7326ecc0b66d6c9b9dcfc5193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2025-04-08T00:25:25Z","title_canon_sha256":"a6d3b21244d9dad80988362aad6943c86407b0268cf1e1a15cb31e97f68dc314"},"schema_version":"1.0","source":{"id":"2504.05577","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.05577","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"2504.05577v2","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05577","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"KO3XP24FCXUZ","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"pith_short_16","alias_value":"KO3XP24FCXUZQFF7","created_at":"2026-07-05T10:51:36Z"},{"alias_kind":"pith_short_8","alias_value":"KO3XP24F","created_at":"2026-07-05T10:51:36Z"}],"graph_snapshots":[{"event_id":"sha256:aa095afa2c81c4a2ad0e7525cfa616128069a2f8ea50b17ab633f253df30bb6b","target":"graph","created_at":"2026-07-05T10:51:36Z","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/2504.05577/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chen Chen, Cunxi Yu, Jiaqi Yin, Qihao Hu, Zhan Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2025-04-08T00:25:25Z","title":"BoolE: Exact Symbolic Reasoning via Boolean Equality Saturation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05577","kind":"arxiv","version":2},"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:b7cd66b8f46c231c61db108c4519ae372c45709ca0593154607ca4db36a9a96f","target":"record","created_at":"2026-07-05T10:51:36Z","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":"92ee39896034405b321c824961a4c1be523ccea7326ecc0b66d6c9b9dcfc5193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2025-04-08T00:25:25Z","title_canon_sha256":"a6d3b21244d9dad80988362aad6943c86407b0268cf1e1a15cb31e97f68dc314"},"schema_version":"1.0","source":{"id":"2504.05577","kind":"arxiv","version":2}},"canonical_sha256":"53b777eb8515e99814bf49e231a8305c34c68bc11cabbc96aecf965cc748fdc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53b777eb8515e99814bf49e231a8305c34c68bc11cabbc96aecf965cc748fdc6","first_computed_at":"2026-07-05T10:51:36.085730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:51:36.085730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"URwIOC5ifS9Ki8Sg+m1scN6XBPlT3MhmP7XYAjJO6UurFhj7dD6jrFEfNoEE7zFCmTSm83qCX4ZSFCUZrq8ZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:51:36.086197Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.05577","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7cd66b8f46c231c61db108c4519ae372c45709ca0593154607ca4db36a9a96f","sha256:aa095afa2c81c4a2ad0e7525cfa616128069a2f8ea50b17ab633f253df30bb6b"],"state_sha256":"05c08af08022e020fe7c377731f6ae8f78c0a7475a25c6dff8efbbfc7f9cb5d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwG9I5cIauguDsmETk4u7CsfaAyX2jP4XE/H8GcttVpLnE0fnt1GLqJT0cFkOHunFyHZwWbYh+NkPlwmdasXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:00:48.156491Z","bundle_sha256":"232b7a9c98fd405ec61420d8e01ed17795e0a0f383259b31f90128830e458293"}}