{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T3KTMR7D4O4EVMDUD7N362Y3FK","short_pith_number":"pith:T3KTMR7D","schema_version":"1.0","canonical_sha256":"9ed53647e3e3b84ab0741fdbbf6b1b2a885e9365f0bde614ad424e5c05e0c531","source":{"kind":"arxiv","id":"1810.05603","version":1},"attestation_state":"computed","paper":{"title":"Investigating the Power of Circuits with $MOD_6$ Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel J. Saunders","submitted_at":"2018-10-12T16:46:33Z","abstract_excerpt":"We consider the power of Boolean circuits with MOD$_{6}$ gates. First, we introduce a few basic notions of computational complexity, and describe the standard models with which we study the complexity of problems. We then define the model of Boolean circuits, equate a restricted class of circuits with an algebraic model, and present some results from working with this algebra."},"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":"1810.05603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-10-12T16:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"5de8964c535bd0beb980b4337bf0896c2d9fa3e5d14e82a66e599debc4a902f4","abstract_canon_sha256":"00f2728ed53f38aae25457e9c7a3e7b0b92cc1e457743c8778628b75e163dcbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:29.979268Z","signature_b64":"DxG0dS0NxG5eIgOV+Jm8uTyx43BoxEvqgDhJ7QJl/St4UvWp3LdMne3+Q4T9RQzuronU32dloHA6uf8KhfwwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed53647e3e3b84ab0741fdbbf6b1b2a885e9365f0bde614ad424e5c05e0c531","last_reissued_at":"2026-05-18T00:03:29.978604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:29.978604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Investigating the Power of Circuits with $MOD_6$ Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel J. Saunders","submitted_at":"2018-10-12T16:46:33Z","abstract_excerpt":"We consider the power of Boolean circuits with MOD$_{6}$ gates. First, we introduce a few basic notions of computational complexity, and describe the standard models with which we study the complexity of problems. We then define the model of Boolean circuits, equate a restricted class of circuits with an algebraic model, and present some results from working with this algebra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05603","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":"1810.05603","created_at":"2026-05-18T00:03:29.978703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05603v1","created_at":"2026-05-18T00:03:29.978703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05603","created_at":"2026-05-18T00:03:29.978703+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3KTMR7D4O4E","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3KTMR7D4O4EVMDU","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3KTMR7D","created_at":"2026-05-18T12:32:53.628368+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/T3KTMR7D4O4EVMDUD7N362Y3FK","json":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK.json","graph_json":"https://pith.science/api/pith-number/T3KTMR7D4O4EVMDUD7N362Y3FK/graph.json","events_json":"https://pith.science/api/pith-number/T3KTMR7D4O4EVMDUD7N362Y3FK/events.json","paper":"https://pith.science/paper/T3KTMR7D"},"agent_actions":{"view_html":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK","download_json":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK.json","view_paper":"https://pith.science/paper/T3KTMR7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05603&json=true","fetch_graph":"https://pith.science/api/pith-number/T3KTMR7D4O4EVMDUD7N362Y3FK/graph.json","fetch_events":"https://pith.science/api/pith-number/T3KTMR7D4O4EVMDUD7N362Y3FK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK/action/storage_attestation","attest_author":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK/action/author_attestation","sign_citation":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK/action/citation_signature","submit_replication":"https://pith.science/pith/T3KTMR7D4O4EVMDUD7N362Y3FK/action/replication_record"}},"created_at":"2026-05-18T00:03:29.978703+00:00","updated_at":"2026-05-18T00:03:29.978703+00:00"}