{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:NQUPF5XGRCZKA5PFUDWPQTCPQB","short_pith_number":"pith:NQUPF5XG","schema_version":"1.0","canonical_sha256":"6c28f2f6e688b2a075e5a0ecf84c4f8063289ce42ac134e6b7aa932fdce46cac","source":{"kind":"arxiv","id":"0710.4695","version":1},"attestation_state":"computed","paper":{"title":"SAT-Based Complete Don't-Care Computation for Network Optimization","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alan Mishchenko, Robert K. Brayton","submitted_at":"2007-10-25T09:15:10Z","abstract_excerpt":"This paper describes an improved approach to Boolean network optimization using internal don't-cares. The improvements concern the type of don't-cares computed, their scope, and the computation method. Instead of the traditionally used compatible observability don't-cares (CODCs), we introduce and justify the use of complete don't-cares (CDC). To ensure the robustness of the don't-care computation for very large industrial networks, a optional windowing scheme is implemented that computes substantial subsets of the CDCs in reasonable time. Finally, we give a SAT-based don't-care computation al"},"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":"0710.4695","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-10-25T09:15:10Z","cross_cats_sorted":[],"title_canon_sha256":"b898ad63ca404a384520d90ef152b4361c1bd2dbc20158f2c0904a1459ba3572","abstract_canon_sha256":"6ef3d433ae072358437cd1e32f485d9f19ea38ee9e3fffff3f6f0df44a1d206c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:05.886208Z","signature_b64":"6Cb4S1SvnhS/bBQzhdS2FGRJ1BhLbVTbCYr3ID2b7QqAH/xmVx5ICbpGddKjveVEIENc7GCuGc3bsNnXsOLoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c28f2f6e688b2a075e5a0ecf84c4f8063289ce42ac134e6b7aa932fdce46cac","last_reissued_at":"2026-05-18T04:09:05.885501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:05.885501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SAT-Based Complete Don't-Care Computation for Network Optimization","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alan Mishchenko, Robert K. Brayton","submitted_at":"2007-10-25T09:15:10Z","abstract_excerpt":"This paper describes an improved approach to Boolean network optimization using internal don't-cares. The improvements concern the type of don't-cares computed, their scope, and the computation method. Instead of the traditionally used compatible observability don't-cares (CODCs), we introduce and justify the use of complete don't-cares (CDC). To ensure the robustness of the don't-care computation for very large industrial networks, a optional windowing scheme is implemented that computes substantial subsets of the CDCs in reasonable time. Finally, we give a SAT-based don't-care computation al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4695","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":""},"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":"0710.4695","created_at":"2026-05-18T04:09:05.885610+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.4695v1","created_at":"2026-05-18T04:09:05.885610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4695","created_at":"2026-05-18T04:09:05.885610+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQUPF5XGRCZK","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQUPF5XGRCZKA5PF","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQUPF5XG","created_at":"2026-05-18T12:25:55.427421+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/NQUPF5XGRCZKA5PFUDWPQTCPQB","json":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB.json","graph_json":"https://pith.science/api/pith-number/NQUPF5XGRCZKA5PFUDWPQTCPQB/graph.json","events_json":"https://pith.science/api/pith-number/NQUPF5XGRCZKA5PFUDWPQTCPQB/events.json","paper":"https://pith.science/paper/NQUPF5XG"},"agent_actions":{"view_html":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB","download_json":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB.json","view_paper":"https://pith.science/paper/NQUPF5XG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.4695&json=true","fetch_graph":"https://pith.science/api/pith-number/NQUPF5XGRCZKA5PFUDWPQTCPQB/graph.json","fetch_events":"https://pith.science/api/pith-number/NQUPF5XGRCZKA5PFUDWPQTCPQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB/action/storage_attestation","attest_author":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB/action/author_attestation","sign_citation":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB/action/citation_signature","submit_replication":"https://pith.science/pith/NQUPF5XGRCZKA5PFUDWPQTCPQB/action/replication_record"}},"created_at":"2026-05-18T04:09:05.885610+00:00","updated_at":"2026-05-18T04:09:05.885610+00:00"}