{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JGCNYXTRGAKC3D3FRKSMLNJZXL","short_pith_number":"pith:JGCNYXTR","schema_version":"1.0","canonical_sha256":"4984dc5e7130142d8f658aa4c5b539bae38cae1edf963b7d47704ae766b7b820","source":{"kind":"arxiv","id":"1609.04274","version":2},"attestation_state":"computed","paper":{"title":"Polymorphisms and Circuit Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gustav Nordh","submitted_at":"2016-09-14T13:59:42Z","abstract_excerpt":"We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function $f$ is characterized by the partial polymorphisms of $f$'s truth table. Moreover, the non-deterministic circuit complexity of $f$ is characterized by the polymorphisms of $f$'s truth table."},"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":"1609.04274","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-14T13:59:42Z","cross_cats_sorted":[],"title_canon_sha256":"0571e6e9698eeea13d9b15dfd73b09e449552ba391fcc089e76dedfcc098dc3c","abstract_canon_sha256":"ff3424bc264bf8bb3e7ac56452c63227410f7009f7ae4de595b4fcffe6b6eadd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:52.301751Z","signature_b64":"ND08kwb/wtmndGPGdPOiodIjRQqlWbB6Ft4TSZQMc4WU6LDVogCc/CmJ42O2ZiBUND4/ca9o9rjOEQcKP3WRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4984dc5e7130142d8f658aa4c5b539bae38cae1edf963b7d47704ae766b7b820","last_reissued_at":"2026-05-18T00:44:52.300915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:52.300915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polymorphisms and Circuit Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gustav Nordh","submitted_at":"2016-09-14T13:59:42Z","abstract_excerpt":"We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function $f$ is characterized by the partial polymorphisms of $f$'s truth table. Moreover, the non-deterministic circuit complexity of $f$ is characterized by the polymorphisms of $f$'s truth table."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04274","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":"1609.04274","created_at":"2026-05-18T00:44:52.301079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04274v2","created_at":"2026-05-18T00:44:52.301079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04274","created_at":"2026-05-18T00:44:52.301079+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGCNYXTRGAKC","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGCNYXTRGAKC3D3F","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGCNYXTR","created_at":"2026-05-18T12:30:25.849896+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/JGCNYXTRGAKC3D3FRKSMLNJZXL","json":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL.json","graph_json":"https://pith.science/api/pith-number/JGCNYXTRGAKC3D3FRKSMLNJZXL/graph.json","events_json":"https://pith.science/api/pith-number/JGCNYXTRGAKC3D3FRKSMLNJZXL/events.json","paper":"https://pith.science/paper/JGCNYXTR"},"agent_actions":{"view_html":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL","download_json":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL.json","view_paper":"https://pith.science/paper/JGCNYXTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04274&json=true","fetch_graph":"https://pith.science/api/pith-number/JGCNYXTRGAKC3D3FRKSMLNJZXL/graph.json","fetch_events":"https://pith.science/api/pith-number/JGCNYXTRGAKC3D3FRKSMLNJZXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL/action/storage_attestation","attest_author":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL/action/author_attestation","sign_citation":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL/action/citation_signature","submit_replication":"https://pith.science/pith/JGCNYXTRGAKC3D3FRKSMLNJZXL/action/replication_record"}},"created_at":"2026-05-18T00:44:52.301079+00:00","updated_at":"2026-05-18T00:44:52.301079+00:00"}