{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WGJHBVIZX7U7DSWNS2IO73EIIT","short_pith_number":"pith:WGJHBVIZ","canonical_record":{"source":{"id":"1007.2924","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-17T12:32:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"7f02eb0484fe816a0b9861bebfe84a5fbf2d88a7a70cc519ea94239e553eb2ab","abstract_canon_sha256":"432455fb2fead22fa12eb79f3a640732f7dfcddb262f063831dabe800162a55e"},"schema_version":"1.0"},"canonical_sha256":"b19270d519bfe9f1cacd9690efec8844d72f3b7280db79a829b1e09b64f98b57","source":{"kind":"arxiv","id":"1007.2924","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2924","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2924v3","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2924","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"WGJHBVIZX7U7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WGJHBVIZX7U7DSWN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WGJHBVIZ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WGJHBVIZX7U7DSWNS2IO73EIIT","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2924","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-17T12:32:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"7f02eb0484fe816a0b9861bebfe84a5fbf2d88a7a70cc519ea94239e553eb2ab","abstract_canon_sha256":"432455fb2fead22fa12eb79f3a640732f7dfcddb262f063831dabe800162a55e"},"schema_version":"1.0"},"canonical_sha256":"b19270d519bfe9f1cacd9690efec8844d72f3b7280db79a829b1e09b64f98b57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:15.155914Z","signature_b64":"ksPfymcIJ6Vyb+OcSb92Uz9U5AWI9jm+PQqkC/oEvKDUW7UuPxzZOXcbY3udU2k5Xdqbwxs72KHYpknzyjIhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b19270d519bfe9f1cacd9690efec8844d72f3b7280db79a829b1e09b64f98b57","last_reissued_at":"2026-05-18T04:05:15.155385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:15.155385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2924","source_version":3,"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-18T04:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMidA7FpA0NRZgCt2tT3nnJNDg/ch9KwRdO6otuclPANZv3BewZ82iVuPbkggXbZHRlJjgIsLtsIaqDShMCHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:09:43.079447Z"},"content_sha256":"bf49b1d70c3ba2c99515a46d2da87e64a9006c1330035c4be928e1981aadd601","schema_version":"1.0","event_id":"sha256:bf49b1d70c3ba2c99515a46d2da87e64a9006c1330035c4be928e1981aadd601"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WGJHBVIZX7U7DSWNS2IO73EIIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Applicability of Post's Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Michael Thomas","submitted_at":"2010-07-17T12:32:40Z","abstract_excerpt":"For decision problems P defined over Boolean circuits from a restricted set of gates, we have that P(B) AC0 many-one reduces to P(B') for all finite sets B and B' of gates such that all gates from B can be computed by circuits over gates from B'. In this paper, we show that a weaker version of this statement holds for decision problems defined over Boolean formulae, namely that P(B) NC2 many-one reduces to P(B' union {and,or}) and that P(B) NC2 many-one reduces to P(B' union {false,true}), for all finite sets B and B' of Boolean functions such that all f in B can be defined in B'."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2924","kind":"arxiv","version":3},"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-18T04:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+izkl3GSK0i/NEM1+Flm1WMTO0aNznKy1JUvOdc76w2P9SdxBp3IHOq4qlZ6zjbb4PCSNHngPGBw6GhC0xJsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:09:43.080156Z"},"content_sha256":"96a01c2abe426e758cc2b86a549d56fde088d22a229bbefb47237e610422b4a9","schema_version":"1.0","event_id":"sha256:96a01c2abe426e758cc2b86a549d56fde088d22a229bbefb47237e610422b4a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGJHBVIZX7U7DSWNS2IO73EIIT/bundle.json","state_url":"https://pith.science/pith/WGJHBVIZX7U7DSWNS2IO73EIIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGJHBVIZX7U7DSWNS2IO73EIIT/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-11T21:09:43Z","links":{"resolver":"https://pith.science/pith/WGJHBVIZX7U7DSWNS2IO73EIIT","bundle":"https://pith.science/pith/WGJHBVIZX7U7DSWNS2IO73EIIT/bundle.json","state":"https://pith.science/pith/WGJHBVIZX7U7DSWNS2IO73EIIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGJHBVIZX7U7DSWNS2IO73EIIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WGJHBVIZX7U7DSWNS2IO73EIIT","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":"432455fb2fead22fa12eb79f3a640732f7dfcddb262f063831dabe800162a55e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-17T12:32:40Z","title_canon_sha256":"7f02eb0484fe816a0b9861bebfe84a5fbf2d88a7a70cc519ea94239e553eb2ab"},"schema_version":"1.0","source":{"id":"1007.2924","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2924","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2924v3","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2924","created_at":"2026-05-18T04:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"WGJHBVIZX7U7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WGJHBVIZX7U7DSWN","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WGJHBVIZ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:96a01c2abe426e758cc2b86a549d56fde088d22a229bbefb47237e610422b4a9","target":"graph","created_at":"2026-05-18T04:05:15Z","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":"For decision problems P defined over Boolean circuits from a restricted set of gates, we have that P(B) AC0 many-one reduces to P(B') for all finite sets B and B' of gates such that all gates from B can be computed by circuits over gates from B'. In this paper, we show that a weaker version of this statement holds for decision problems defined over Boolean formulae, namely that P(B) NC2 many-one reduces to P(B' union {and,or}) and that P(B) NC2 many-one reduces to P(B' union {false,true}), for all finite sets B and B' of Boolean functions such that all f in B can be defined in B'.","authors_text":"Michael Thomas","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-17T12:32:40Z","title":"On the Applicability of Post's Lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2924","kind":"arxiv","version":3},"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:bf49b1d70c3ba2c99515a46d2da87e64a9006c1330035c4be928e1981aadd601","target":"record","created_at":"2026-05-18T04:05:15Z","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":"432455fb2fead22fa12eb79f3a640732f7dfcddb262f063831dabe800162a55e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-17T12:32:40Z","title_canon_sha256":"7f02eb0484fe816a0b9861bebfe84a5fbf2d88a7a70cc519ea94239e553eb2ab"},"schema_version":"1.0","source":{"id":"1007.2924","kind":"arxiv","version":3}},"canonical_sha256":"b19270d519bfe9f1cacd9690efec8844d72f3b7280db79a829b1e09b64f98b57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b19270d519bfe9f1cacd9690efec8844d72f3b7280db79a829b1e09b64f98b57","first_computed_at":"2026-05-18T04:05:15.155385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:15.155385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ksPfymcIJ6Vyb+OcSb92Uz9U5AWI9jm+PQqkC/oEvKDUW7UuPxzZOXcbY3udU2k5Xdqbwxs72KHYpknzyjIhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:15.155914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2924","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf49b1d70c3ba2c99515a46d2da87e64a9006c1330035c4be928e1981aadd601","sha256:96a01c2abe426e758cc2b86a549d56fde088d22a229bbefb47237e610422b4a9"],"state_sha256":"f899ea99bf79afa983d1f9c9ff3adbd0ebf356f0f42a6351561346ecca31affc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50hlrR5EAoNCNAJhS+8TxbrT6Y9qPI3KyvYSfT39nv6IKd9lyRVdxudq2J2goCpNv6P37LgQg6lcD4ZCRkOuBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:09:43.084156Z","bundle_sha256":"c830f9d8c41196747d5ce8ab52984755954afa6af88e4bc8624dc02dac550d2f"}}