{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CRDXX22WTLBULVWPBOTQJHOEXM","short_pith_number":"pith:CRDXX22W","schema_version":"1.0","canonical_sha256":"14477beb569ac345d6cf0ba7049dc4bb00ffe6051a7125a4d267d9ec7c1bbf79","source":{"kind":"arxiv","id":"1110.0304","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.0304","created_at":"2026-05-18T04:11:50.293983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0304v1","created_at":"2026-05-18T04:11:50.293983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0304","created_at":"2026-05-18T04:11:50.293983+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRDXX22WTLBU","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRDXX22WTLBULVWP","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRDXX22W","created_at":"2026-05-18T12:26:26.731475+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/CRDXX22WTLBULVWPBOTQJHOEXM","json":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM.json","graph_json":"https://pith.science/api/pith-number/CRDXX22WTLBULVWPBOTQJHOEXM/graph.json","events_json":"https://pith.science/api/pith-number/CRDXX22WTLBULVWPBOTQJHOEXM/events.json","paper":"https://pith.science/paper/CRDXX22W"},"agent_actions":{"view_html":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM","download_json":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM.json","view_paper":"https://pith.science/paper/CRDXX22W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0304&json=true","fetch_graph":"https://pith.science/api/pith-number/CRDXX22WTLBULVWPBOTQJHOEXM/graph.json","fetch_events":"https://pith.science/api/pith-number/CRDXX22WTLBULVWPBOTQJHOEXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/action/storage_attestation","attest_author":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/action/author_attestation","sign_citation":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/action/citation_signature","submit_replication":"https://pith.science/pith/CRDXX22WTLBULVWPBOTQJHOEXM/action/replication_record"}},"created_at":"2026-05-18T04:11:50.293983+00:00","updated_at":"2026-05-18T04:11:50.293983+00:00"}