{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MYT67TU57W3KHHLHQANR3LL422","short_pith_number":"pith:MYT67TU5","schema_version":"1.0","canonical_sha256":"6627efce9dfdb6a39d67801b1dad7cd698d22ae545dff9ee54e4a3dde95619eb","source":{"kind":"arxiv","id":"2607.06956","version":1},"attestation_state":"computed","paper":{"title":"Fixed Points, a Predictor-Impossibility Theorem, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Tom Altman","submitted_at":"2026-07-08T03:31:15Z","abstract_excerpt":"We introduce an activation hierarchy consisting of stage machines, stage domains, and stage languages generated by an activation operator. The central result is a Predictor-Impossibility Theorem (PIT), which shows that no effective predictor family can uniformly determine all stage languages of the hierarchy. The proof combines the semantic activation construction with the S-m-n Theorem and Kleene's Recursion Theorem to obtain a self-referential fixed point that yields a contradiction. We then define an aggregate language MIS and establish a slice theorem connecting aggregate inputs to individ"},"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":"2607.06956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-08T03:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"0c8273e2e4154541600d042ad2e60a689e36608f9ffbbddb3847276657d06168","abstract_canon_sha256":"2cf6053b7c4d5623b9f452bbd3f5099b1e5e7dcc1270705e09995c640901e1d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T00:19:41.083211Z","signature_b64":"EEuzNqzdpbHuEmsmv1YiEeGBo7wmwpuv9PWp9GmRaAWPCSx/NwEVNJ1/RRnQFFRBosGECox7NOPOMX3fbfYkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6627efce9dfdb6a39d67801b1dad7cd698d22ae545dff9ee54e4a3dde95619eb","last_reissued_at":"2026-07-09T00:19:41.082776Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T00:19:41.082776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed Points, a Predictor-Impossibility Theorem, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Tom Altman","submitted_at":"2026-07-08T03:31:15Z","abstract_excerpt":"We introduce an activation hierarchy consisting of stage machines, stage domains, and stage languages generated by an activation operator. The central result is a Predictor-Impossibility Theorem (PIT), which shows that no effective predictor family can uniformly determine all stage languages of the hierarchy. The proof combines the semantic activation construction with the S-m-n Theorem and Kleene's Recursion Theorem to obtain a self-referential fixed point that yields a contradiction. We then define an aggregate language MIS and establish a slice theorem connecting aggregate inputs to individ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06956","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.06956/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.06956","created_at":"2026-07-09T00:19:41.082839+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.06956v1","created_at":"2026-07-09T00:19:41.082839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06956","created_at":"2026-07-09T00:19:41.082839+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYT67TU57W3K","created_at":"2026-07-09T00:19:41.082839+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYT67TU57W3KHHLH","created_at":"2026-07-09T00:19:41.082839+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYT67TU5","created_at":"2026-07-09T00:19:41.082839+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05613","citing_title":"Predictor-Impossibility Theorem and Applications","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422","json":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422.json","graph_json":"https://pith.science/api/pith-number/MYT67TU57W3KHHLHQANR3LL422/graph.json","events_json":"https://pith.science/api/pith-number/MYT67TU57W3KHHLHQANR3LL422/events.json","paper":"https://pith.science/paper/MYT67TU5"},"agent_actions":{"view_html":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422","download_json":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422.json","view_paper":"https://pith.science/paper/MYT67TU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.06956&json=true","fetch_graph":"https://pith.science/api/pith-number/MYT67TU57W3KHHLHQANR3LL422/graph.json","fetch_events":"https://pith.science/api/pith-number/MYT67TU57W3KHHLHQANR3LL422/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422/action/storage_attestation","attest_author":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422/action/author_attestation","sign_citation":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422/action/citation_signature","submit_replication":"https://pith.science/pith/MYT67TU57W3KHHLHQANR3LL422/action/replication_record"}},"created_at":"2026-07-09T00:19:41.082839+00:00","updated_at":"2026-07-09T00:19:41.082839+00:00"}