{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CRDXX22WTLBULVWPBOTQJHOEXM","short_pith_number":"pith:CRDXX22W","canonical_record":{"source":{"id":"1110.0304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-10-03T09:03:41Z","cross_cats_sorted":[],"title_canon_sha256":"1df605780d6924f4b11537db2f62f64cef8f32e7a299c4cf4009d752ae694eaf","abstract_canon_sha256":"98e6170e553d1f122cb4c8b5408036aa2dc0a9ba4595d2232992974217b952b7"},"schema_version":"1.0"},"canonical_sha256":"14477beb569ac345d6cf0ba7049dc4bb00ffe6051a7125a4d267d9ec7c1bbf79","source":{"kind":"arxiv","id":"1110.0304","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0304","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0304v1","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0304","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"CRDXX22WTLBU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CRDXX22WTLBULVWP","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CRDXX22W","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CRDXX22WTLBULVWPBOTQJHOEXM","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-10-03T09:03:41Z","cross_cats_sorted":[],"title_canon_sha256":"1df605780d6924f4b11537db2f62f64cef8f32e7a299c4cf4009d752ae694eaf","abstract_canon_sha256":"98e6170e553d1f122cb4c8b5408036aa2dc0a9ba4595d2232992974217b952b7"},"schema_version":"1.0"},"canonical_sha256":"14477beb569ac345d6cf0ba7049dc4bb00ffe6051a7125a4d267d9ec7c1bbf79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:50.294438Z","signature_b64":"q8WJohzYoIh8ujlSZomzq9ue0owahl3JhMI+04YS8qrxReg/EqgrWrhjtPuNLKfqwE1dVoIaT0zTRefW8NlVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14477beb569ac345d6cf0ba7049dc4bb00ffe6051a7125a4d267d9ec7c1bbf79","last_reissued_at":"2026-05-18T04:11:50.293911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:50.293911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0304","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-18T04:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4X0mS3GwKwFQnm3J3kN7ktfuBac1Ggaf2hhs6BvDjzCY9gs5w6/Zcgqp2w3mtPv3PqrUG9wcBvXnpy7R6MkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:02:19.669537Z"},"content_sha256":"8bc01d11e3fab8eaf0a7c8a628acda2d754d0c48dea7743e313d26f62243a0c6","schema_version":"1.0","event_id":"sha256:8bc01d11e3fab8eaf0a7c8a628acda2d754d0c48dea7743e313d26f62243a0c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CRDXX22WTLBULVWPBOTQJHOEXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anti-complex sets and reducibilities with tiny use","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Frank Stephan, Guohua Wu, Johanna N.Y. Franklin, Noam Greenberg","submitted_at":"2011-10-03T09:03:41Z","abstract_excerpt":"In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for complexity, the natural arena for examining anti-complexity is the weak-truth table degrees. In this context, we show the equivalence of anti-complexity and other lowness notions such as r.e.\\ traceability or being weak truth-table reducible to a Schnorr trivial set. A set $A$ is anti-complex if and only if it is reducible to another set $B$ with \\emph{tiny use}, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0304","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-18T04:11:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxCwENco0grEmy34ax7un/BcLy9OLrP8b3ctS7UIuYAAr2JUeTDa46xQFsEP3caAXijzyAiUZT7ntx9II3xuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:02:19.670289Z"},"content_sha256":"a1e398662102a043ab2203ced4d027c4dfd48c0c88d689fecb728905f364f713","schema_version":"1.0","event_id":"sha256:a1e398662102a043ab2203ced4d027c4dfd48c0c88d689fecb728905f364f713"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/bundle.json","state_url":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRDXX22WTLBULVWPBOTQJHOEXM/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-05-27T15:02:19Z","links":{"resolver":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM","bundle":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/bundle.json","state":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRDXX22WTLBULVWPBOTQJHOEXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CRDXX22WTLBULVWPBOTQJHOEXM","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":"98e6170e553d1f122cb4c8b5408036aa2dc0a9ba4595d2232992974217b952b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-10-03T09:03:41Z","title_canon_sha256":"1df605780d6924f4b11537db2f62f64cef8f32e7a299c4cf4009d752ae694eaf"},"schema_version":"1.0","source":{"id":"1110.0304","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0304","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0304v1","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0304","created_at":"2026-05-18T04:11:50Z"},{"alias_kind":"pith_short_12","alias_value":"CRDXX22WTLBU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CRDXX22WTLBULVWP","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CRDXX22W","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:a1e398662102a043ab2203ced4d027c4dfd48c0c88d689fecb728905f364f713","target":"graph","created_at":"2026-05-18T04:11:50Z","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":"In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for complexity, the natural arena for examining anti-complexity is the weak-truth table degrees. In this context, we show the equivalence of anti-complexity and other lowness notions such as r.e.\\ traceability or being weak truth-table reducible to a Schnorr trivial set. A set $A$ is anti-complex if and only if it is reducible to another set $B$ with \\emph{tiny use}, wh","authors_text":"Frank Stephan, Guohua Wu, Johanna N.Y. Franklin, Noam Greenberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-10-03T09:03:41Z","title":"Anti-complex sets and reducibilities with tiny use"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0304","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:8bc01d11e3fab8eaf0a7c8a628acda2d754d0c48dea7743e313d26f62243a0c6","target":"record","created_at":"2026-05-18T04:11:50Z","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":"98e6170e553d1f122cb4c8b5408036aa2dc0a9ba4595d2232992974217b952b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-10-03T09:03:41Z","title_canon_sha256":"1df605780d6924f4b11537db2f62f64cef8f32e7a299c4cf4009d752ae694eaf"},"schema_version":"1.0","source":{"id":"1110.0304","kind":"arxiv","version":1}},"canonical_sha256":"14477beb569ac345d6cf0ba7049dc4bb00ffe6051a7125a4d267d9ec7c1bbf79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14477beb569ac345d6cf0ba7049dc4bb00ffe6051a7125a4d267d9ec7c1bbf79","first_computed_at":"2026-05-18T04:11:50.293911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:50.293911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8WJohzYoIh8ujlSZomzq9ue0owahl3JhMI+04YS8qrxReg/EqgrWrhjtPuNLKfqwE1dVoIaT0zTRefW8NlVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:50.294438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0304","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bc01d11e3fab8eaf0a7c8a628acda2d754d0c48dea7743e313d26f62243a0c6","sha256:a1e398662102a043ab2203ced4d027c4dfd48c0c88d689fecb728905f364f713"],"state_sha256":"aefa9418c651a46497962cef0aad10e8b50b0e52e9e31c4fe1ce7d7f7f2641f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZWvBhGNW4DJoYOqwFyH9gUTSaT0c0qBwahoqmX5JxXbh9VzFlAuZkvFMrMnyp4K1Bd6+WsJBQt8RfRZPrjECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:02:19.674657Z","bundle_sha256":"f2dea54396d3d9e990240338ef4617c3748c2b45864ee75dbc250ddacbbf9e58"}}