{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QMRUDJGDVHV3EYED6YX77K5LPE","short_pith_number":"pith:QMRUDJGD","schema_version":"1.0","canonical_sha256":"832341a4c3a9ebb26083f62fffabab790413043c82f2adecc337a424e45b4ac6","source":{"kind":"arxiv","id":"1705.03263","version":2},"attestation_state":"computed","paper":{"title":"A Note on the Power of Non-Deterministic Circuits with Gate Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gustav Nordh","submitted_at":"2017-05-09T10:24:57Z","abstract_excerpt":"We investigate the power of non-deterministic circuits over restricted sets of base gates. We note that the power of non-deterministic circuits exhibit a dichotomy, in the following sense: For weak enough bases, non-deterministic circuits are no more powerful than deterministic circuits, and for the remaining bases, non-deterministic circuits are super polynomial more efficient than deterministic circuits (under the assumption that $P/poly \\neq NP/poly$). Moreover, we give a precise characterization of the borderline between the two situations."},"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":"1705.03263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-09T10:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"27d44cb786c31b02681a4669003c4d54af59667d23e97af64d59c61c72868bc9","abstract_canon_sha256":"b12d9111290b3e7f062b010e262b05f82dcc8530b2ff778b3c66672093f0325b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:15.262809Z","signature_b64":"lu0AhuZWyBOLOMmJaqCa8sMOa/cfiPzxx7seyNuf0Ccrx6mXvonP0vxPB2QyxZOwR3yXRfMHbQMYgtDSNcWbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"832341a4c3a9ebb26083f62fffabab790413043c82f2adecc337a424e45b4ac6","last_reissued_at":"2026-05-18T00:44:15.262102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:15.262102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Power of Non-Deterministic Circuits with Gate Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gustav Nordh","submitted_at":"2017-05-09T10:24:57Z","abstract_excerpt":"We investigate the power of non-deterministic circuits over restricted sets of base gates. We note that the power of non-deterministic circuits exhibit a dichotomy, in the following sense: For weak enough bases, non-deterministic circuits are no more powerful than deterministic circuits, and for the remaining bases, non-deterministic circuits are super polynomial more efficient than deterministic circuits (under the assumption that $P/poly \\neq NP/poly$). Moreover, we give a precise characterization of the borderline between the two situations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03263","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":""},"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":"1705.03263","created_at":"2026-05-18T00:44:15.262215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03263v2","created_at":"2026-05-18T00:44:15.262215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03263","created_at":"2026-05-18T00:44:15.262215+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMRUDJGDVHV3","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMRUDJGDVHV3EYED","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMRUDJGD","created_at":"2026-05-18T12:31:39.905425+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/QMRUDJGDVHV3EYED6YX77K5LPE","json":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE.json","graph_json":"https://pith.science/api/pith-number/QMRUDJGDVHV3EYED6YX77K5LPE/graph.json","events_json":"https://pith.science/api/pith-number/QMRUDJGDVHV3EYED6YX77K5LPE/events.json","paper":"https://pith.science/paper/QMRUDJGD"},"agent_actions":{"view_html":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE","download_json":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE.json","view_paper":"https://pith.science/paper/QMRUDJGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03263&json=true","fetch_graph":"https://pith.science/api/pith-number/QMRUDJGDVHV3EYED6YX77K5LPE/graph.json","fetch_events":"https://pith.science/api/pith-number/QMRUDJGDVHV3EYED6YX77K5LPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE/action/storage_attestation","attest_author":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE/action/author_attestation","sign_citation":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE/action/citation_signature","submit_replication":"https://pith.science/pith/QMRUDJGDVHV3EYED6YX77K5LPE/action/replication_record"}},"created_at":"2026-05-18T00:44:15.262215+00:00","updated_at":"2026-05-18T00:44:15.262215+00:00"}