{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SSZDQVWQJ73P6JUTVZ5YRQ74AO","short_pith_number":"pith:SSZDQVWQ","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"},"canonical_sha256":"94b23856d04ff6ff2693ae7b88c3fc03b8e890174e038229678a7ebacc86db9e","source":{"kind":"arxiv","id":"1009.1208","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1208","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1208v5","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1208","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"SSZDQVWQJ73P","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SSZDQVWQJ73P6JUT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SSZDQVWQ","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SSZDQVWQJ73P6JUTVZ5YRQ74AO","target":"record","payload":{"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"},"canonical_sha256":"94b23856d04ff6ff2693ae7b88c3fc03b8e890174e038229678a7ebacc86db9e","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"},"source_kind":"arxiv","source_id":"1009.1208","source_version":5,"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-05-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgRb/fr9WbkpyF0u5EMnBklp6dQ4S9FghbRFB+nfcjZyqLRrpZqoFfi6ukKE0tNLKDd2FQT4XTNhI4tXYeBMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:31:18.513488Z"},"content_sha256":"0837e0fda857af4d0b7fb10c2fc02fa23bc8bce3208493c502e3aaf2c474f6a5","schema_version":"1.0","event_id":"sha256:0837e0fda857af4d0b7fb10c2fc02fa23bc8bce3208493c502e3aaf2c474f6a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SSZDQVWQJ73P6JUTVZ5YRQ74AO","target":"graph","payload":{"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"},"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-05-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFPzUKdYCbEouCP+fg7cj/nKRPh11Se1Mb+qpzzDVTZI/vOx81MfaT2eqUp6AQOe74WaVrAvUE2KKV7IFf1mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:31:18.514204Z"},"content_sha256":"e3bdb13c1cddd84dcd71c3cdefe264c6e4a2269696252175b7b20674e71a581d","schema_version":"1.0","event_id":"sha256:e3bdb13c1cddd84dcd71c3cdefe264c6e4a2269696252175b7b20674e71a581d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/bundle.json","state_url":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/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-06-09T04:31:18Z","links":{"resolver":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO","bundle":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/bundle.json","state":"https://pith.science/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSZDQVWQJ73P6JUTVZ5YRQ74AO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SSZDQVWQJ73P6JUTVZ5YRQ74AO","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":"270487f076102fa38960563e764e859fd8adb284f7b17835a31605b5ad3a62db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-07T07:19:16Z","title_canon_sha256":"debdb523a05a9e45b6b33461ccb96ae6117f32a2025f0198a053425c8cad36ae"},"schema_version":"1.0","source":{"id":"1009.1208","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1208","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1208v5","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1208","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"SSZDQVWQJ73P","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SSZDQVWQJ73P6JUT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SSZDQVWQ","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:e3bdb13c1cddd84dcd71c3cdefe264c6e4a2269696252175b7b20674e71a581d","target":"graph","created_at":"2026-05-18T01:37:39Z","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"},"paper":{"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.","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)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-07T07:19:16Z","title":"Complexity classifications for different equivalence and audit problems for Boolean circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1208","kind":"arxiv","version":5},"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:0837e0fda857af4d0b7fb10c2fc02fa23bc8bce3208493c502e3aaf2c474f6a5","target":"record","created_at":"2026-05-18T01:37:39Z","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":"270487f076102fa38960563e764e859fd8adb284f7b17835a31605b5ad3a62db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-07T07:19:16Z","title_canon_sha256":"debdb523a05a9e45b6b33461ccb96ae6117f32a2025f0198a053425c8cad36ae"},"schema_version":"1.0","source":{"id":"1009.1208","kind":"arxiv","version":5}},"canonical_sha256":"94b23856d04ff6ff2693ae7b88c3fc03b8e890174e038229678a7ebacc86db9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94b23856d04ff6ff2693ae7b88c3fc03b8e890174e038229678a7ebacc86db9e","first_computed_at":"2026-05-18T01:37:39.895330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.895330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EGQJlbCeeiMU4KqBkTFmHh01NW1APuM9EEGm38C6pIDb8Hnzmqc5BuLBVABxmuoHRggxKGHSlaleeZrIWxS5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.895934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1208","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0837e0fda857af4d0b7fb10c2fc02fa23bc8bce3208493c502e3aaf2c474f6a5","sha256:e3bdb13c1cddd84dcd71c3cdefe264c6e4a2269696252175b7b20674e71a581d"],"state_sha256":"147a65c27d1825691655b2f147e2ec532b9723dd13efe99203b88f45b6274968"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnRjq/oUkpnVpB0KFcfR3e2l/Hy/pDGv7WfD5N4JHY7JecZY/M3nLemOtWNACG7rJ9Y93kL5WJtipl55uY4eAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:31:18.518247Z","bundle_sha256":"28c0baf8e6fa0415dc58a61233cfc83f312ad6b81978cd7012079d33304a6b5e"}}