{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DEQ3KVGE5N35EZSVLP5EUDS6XD","short_pith_number":"pith:DEQ3KVGE","canonical_record":{"source":{"id":"1710.08163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-23T09:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"af25b1292fec84b43b51eb666fa04a5993dfd2a5a1de14443c89be1ca369885d","abstract_canon_sha256":"10183c6ff4b8d5fdd8bbad0d2f561c6aff2dcec9a21ef98ff5f82dcbb186e7ff"},"schema_version":"1.0"},"canonical_sha256":"1921b554c4eb77d266555bfa4a0e5eb8ed08ba1d4af5f30702b9497bdf1cbe6a","source":{"kind":"arxiv","id":"1710.08163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08163","created_at":"2026-05-18T00:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08163v1","created_at":"2026-05-18T00:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08163","created_at":"2026-05-18T00:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"DEQ3KVGE5N35","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DEQ3KVGE5N35EZSV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DEQ3KVGE","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DEQ3KVGE5N35EZSVLP5EUDS6XD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-23T09:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"af25b1292fec84b43b51eb666fa04a5993dfd2a5a1de14443c89be1ca369885d","abstract_canon_sha256":"10183c6ff4b8d5fdd8bbad0d2f561c6aff2dcec9a21ef98ff5f82dcbb186e7ff"},"schema_version":"1.0"},"canonical_sha256":"1921b554c4eb77d266555bfa4a0e5eb8ed08ba1d4af5f30702b9497bdf1cbe6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:17.025719Z","signature_b64":"PBAEgAtFFWUbj091xW/v0mrsutrGzrHXJ8Abr6nLQeTMOsW7z0ZszLBCcy0X5JLI50cZYKtD31r/VCb9Lh0dCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1921b554c4eb77d266555bfa4a0e5eb8ed08ba1d4af5f30702b9497bdf1cbe6a","last_reissued_at":"2026-05-18T00:32:17.025158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:17.025158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08163","source_version":1,"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-18T00:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKHtg1/YkCFRWMnc87ilGL0Nw/nDhHYZ5om9jFxDo+eCx91ea4AHVC1MkLBGYJl/Kjs6mcX2BKqsU83M1WHSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:51:05.897699Z"},"content_sha256":"f08a6bd0d5d88e40c89c3206633a46b4992b2a4768503bc3ab4a6f9d13eaa261","schema_version":"1.0","event_id":"sha256:f08a6bd0d5d88e40c89c3206633a46b4992b2a4768503bc3ab4a6f9d13eaa261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DEQ3KVGE5N35EZSVLP5EUDS6XD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Satisfiability in multi-valued circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jacek Krzaczkowski, Pawe{\\l} M. Idziak","submitted_at":"2017-10-23T09:27:38Z","abstract_excerpt":"Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this is strictly connected with the problems of solving equations (or systems of equations) over finite algebras.\n  The research reported in this work was motivated by a desire to know for which finite algeb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08163","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"},"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-18T00:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9S6Zn5Q52iq8bw3DLlniiev9BCOo1JchH3kR5U1/vQ7z1mmHslYgR/RjDwATu7sMttJ/FfsxzSloohCL8PnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:51:05.898047Z"},"content_sha256":"162e3b87e86600d2e126faa6ecc206ebb14796a8e3fc270913c96e93d1a4c907","schema_version":"1.0","event_id":"sha256:162e3b87e86600d2e126faa6ecc206ebb14796a8e3fc270913c96e93d1a4c907"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEQ3KVGE5N35EZSVLP5EUDS6XD/bundle.json","state_url":"https://pith.science/pith/DEQ3KVGE5N35EZSVLP5EUDS6XD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEQ3KVGE5N35EZSVLP5EUDS6XD/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-01T21:51:05Z","links":{"resolver":"https://pith.science/pith/DEQ3KVGE5N35EZSVLP5EUDS6XD","bundle":"https://pith.science/pith/DEQ3KVGE5N35EZSVLP5EUDS6XD/bundle.json","state":"https://pith.science/pith/DEQ3KVGE5N35EZSVLP5EUDS6XD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEQ3KVGE5N35EZSVLP5EUDS6XD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DEQ3KVGE5N35EZSVLP5EUDS6XD","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":"10183c6ff4b8d5fdd8bbad0d2f561c6aff2dcec9a21ef98ff5f82dcbb186e7ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-23T09:27:38Z","title_canon_sha256":"af25b1292fec84b43b51eb666fa04a5993dfd2a5a1de14443c89be1ca369885d"},"schema_version":"1.0","source":{"id":"1710.08163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08163","created_at":"2026-05-18T00:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08163v1","created_at":"2026-05-18T00:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08163","created_at":"2026-05-18T00:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"DEQ3KVGE5N35","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DEQ3KVGE5N35EZSV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DEQ3KVGE","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:162e3b87e86600d2e126faa6ecc206ebb14796a8e3fc270913c96e93d1a4c907","target":"graph","created_at":"2026-05-18T00:32:17Z","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":"Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this is strictly connected with the problems of solving equations (or systems of equations) over finite algebras.\n  The research reported in this work was motivated by a desire to know for which finite algeb","authors_text":"Jacek Krzaczkowski, Pawe{\\l} M. Idziak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-23T09:27:38Z","title":"Satisfiability in multi-valued circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08163","kind":"arxiv","version":1},"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:f08a6bd0d5d88e40c89c3206633a46b4992b2a4768503bc3ab4a6f9d13eaa261","target":"record","created_at":"2026-05-18T00:32:17Z","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":"10183c6ff4b8d5fdd8bbad0d2f561c6aff2dcec9a21ef98ff5f82dcbb186e7ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-23T09:27:38Z","title_canon_sha256":"af25b1292fec84b43b51eb666fa04a5993dfd2a5a1de14443c89be1ca369885d"},"schema_version":"1.0","source":{"id":"1710.08163","kind":"arxiv","version":1}},"canonical_sha256":"1921b554c4eb77d266555bfa4a0e5eb8ed08ba1d4af5f30702b9497bdf1cbe6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1921b554c4eb77d266555bfa4a0e5eb8ed08ba1d4af5f30702b9497bdf1cbe6a","first_computed_at":"2026-05-18T00:32:17.025158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:17.025158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBAEgAtFFWUbj091xW/v0mrsutrGzrHXJ8Abr6nLQeTMOsW7z0ZszLBCcy0X5JLI50cZYKtD31r/VCb9Lh0dCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:17.025719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f08a6bd0d5d88e40c89c3206633a46b4992b2a4768503bc3ab4a6f9d13eaa261","sha256:162e3b87e86600d2e126faa6ecc206ebb14796a8e3fc270913c96e93d1a4c907"],"state_sha256":"3a4e15bf05e762702dcd871d187de9a1031d51b8792b1413ec8381cff6da622e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBHw9rgvX+G6jCHUrCI6i/0dur++ryXTWWnTX2KiUr8DdYm5Fju71ChvAJoh8w6Qd6O7ynhCAJvO9k2Y3PGGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:51:05.900035Z","bundle_sha256":"2b3066523055427df4284e9d50371fc2b35edc8e7b791ff333d8e3723721b53b"}}