{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SSZDQVWQJ73P6JUTVZ5YRQ74AO","short_pith_number":"pith:SSZDQVWQ","schema_version":"1.0","canonical_sha256":"94b23856d04ff6ff2693ae7b88c3fc03b8e890174e038229678a7ebacc86db9e","source":{"kind":"arxiv","id":"1009.1208","version":5},"attestation_state":"computed","paper":{"title":"Complexity classifications for different equivalence and audit problems for Boolean circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Elmar B\\~A{\\P}hler (Universit\\\"at W\\\"urzburg), Henning Schnoor (Christian-Albrechts-Universit\\\"at zu Kiel), Heribert Vollmer (Leibniz Universit\\\"at Hannover), Marseille), Matthias Galota (Elektrobit), Nadia Creignou (Universit\\'e de la M\\'editerran\\'ee, Steffen Reith (Hochschule RheinMain, Wiesbaden)","submitted_at":"2010-09-07T07:19:16Z","abstract_excerpt":"We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard."},"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":"1009.1208","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-07T07:19:16Z","cross_cats_sorted":[],"title_canon_sha256":"debdb523a05a9e45b6b33461ccb96ae6117f32a2025f0198a053425c8cad36ae","abstract_canon_sha256":"270487f076102fa38960563e764e859fd8adb284f7b17835a31605b5ad3a62db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.895934Z","signature_b64":"EGQJlbCeeiMU4KqBkTFmHh01NW1APuM9EEGm38C6pIDb8Hnzmqc5BuLBVABxmuoHRggxKGHSlaleeZrIWxS5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94b23856d04ff6ff2693ae7b88c3fc03b8e890174e038229678a7ebacc86db9e","last_reissued_at":"2026-05-18T01:37:39.895330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.895330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity classifications for different equivalence and audit problems for Boolean circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Elmar B\\~A{\\P}hler (Universit\\\"at W\\\"urzburg), Henning Schnoor (Christian-Albrechts-Universit\\\"at zu Kiel), Heribert Vollmer (Leibniz Universit\\\"at Hannover), Marseille), Matthias Galota (Elektrobit), Nadia Creignou (Universit\\'e de la M\\'editerran\\'ee, Steffen Reith (Hochschule RheinMain, Wiesbaden)","submitted_at":"2010-09-07T07:19:16Z","abstract_excerpt":"We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1208","kind":"arxiv","version":5},"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":"1009.1208","created_at":"2026-05-18T01:37:39.895439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1208v5","created_at":"2026-05-18T01:37:39.895439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1208","created_at":"2026-05-18T01:37:39.895439+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSZDQVWQJ73P","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSZDQVWQJ73P6JUT","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSZDQVWQ","created_at":"2026-05-18T12:26:13.927090+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/SSZDQVWQJ73P6JUTVZ5YRQ74AO","json":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO.json","graph_json":"https://pith.science/api/pith-number/SSZDQVWQJ73P6JUTVZ5YRQ74AO/graph.json","events_json":"https://pith.science/api/pith-number/SSZDQVWQJ73P6JUTVZ5YRQ74AO/events.json","paper":"https://pith.science/paper/SSZDQVWQ"},"agent_actions":{"view_html":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO","download_json":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO.json","view_paper":"https://pith.science/paper/SSZDQVWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1208&json=true","fetch_graph":"https://pith.science/api/pith-number/SSZDQVWQJ73P6JUTVZ5YRQ74AO/graph.json","fetch_events":"https://pith.science/api/pith-number/SSZDQVWQJ73P6JUTVZ5YRQ74AO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/action/storage_attestation","attest_author":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/action/author_attestation","sign_citation":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/action/citation_signature","submit_replication":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/action/replication_record"}},"created_at":"2026-05-18T01:37:39.895439+00:00","updated_at":"2026-05-18T01:37:39.895439+00:00"}