{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DK5UXYZ4HYJYPZL7WVY37HUIN4","short_pith_number":"pith:DK5UXYZ4","canonical_record":{"source":{"id":"2604.22844","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-21T17:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"941d32a49d0d6612acb82fcb3eade27df0e26e12ccc64d40f3feebe46a7c20f4","abstract_canon_sha256":"d4ed3d8aa606f6ca0f44d0c6ee283c79c3bcefaaae2ab8a0a1b72db5cca1df60"},"schema_version":"1.0"},"canonical_sha256":"1abb4be33c3e1387e57fb571bf9e886f1327c8676f491b2865a0010fad4e1a6c","source":{"kind":"arxiv","id":"2604.22844","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22844","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22844v3","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22844","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"DK5UXYZ4HYJY","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"DK5UXYZ4HYJYPZL7","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"DK5UXYZ4","created_at":"2026-05-22T01:04:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DK5UXYZ4HYJYPZL7WVY37HUIN4","target":"record","payload":{"canonical_record":{"source":{"id":"2604.22844","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-21T17:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"941d32a49d0d6612acb82fcb3eade27df0e26e12ccc64d40f3feebe46a7c20f4","abstract_canon_sha256":"d4ed3d8aa606f6ca0f44d0c6ee283c79c3bcefaaae2ab8a0a1b72db5cca1df60"},"schema_version":"1.0"},"canonical_sha256":"1abb4be33c3e1387e57fb571bf9e886f1327c8676f491b2865a0010fad4e1a6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:03.100348Z","signature_b64":"I5hqzQb1gzXY7kuXpZjVlxfPJHyYca6V3CwIhwi/rYv4cQQjyyU7eZTmG1M9HxkKfz0YES1+OCb5K1CvTDwgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1abb4be33c3e1387e57fb571bf9e886f1327c8676f491b2865a0010fad4e1a6c","last_reissued_at":"2026-05-22T01:04:03.099742Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:03.099742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.22844","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-22T01:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ROL1VmEZAMPPXk4cEMRYWNXa/DTla6ONyqC3Cz7x98/ZzbfkSOkXh/OpUtkM2gReqed1AQ57gdyREsPXJZMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:30:58.665069Z"},"content_sha256":"5fae39148f8755b9068584566dbe44083b601faa042c9b6affaa0adc6fca2847","schema_version":"1.0","event_id":"sha256:5fae39148f8755b9068584566dbe44083b601faa042c9b6affaa0adc6fca2847"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DK5UXYZ4HYJYPZL7WVY37HUIN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Operational Inexpressibility at the Step-Duplicating Primitive Recursor Orientation Boundary","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Term-rewriting proof systems exhibit operational inexpressibility at the step-duplicating primitive recursor boundary, so no derivation both depends on the step dimension and constrains the target.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Moses Rahnama","submitted_at":"2026-04-21T17:59:06Z","abstract_excerpt":"We identify a structural property of term-rewriting proof systems called operational inexpressibility: no derivation depends on a specified input dimension and also constrains the target question. The canonical instance is direct aggregation on the primitive recursion duplicator $F(x,y,Z)\\to x$, $F(x,y,S(n))\\to G(y,F(x,y,n))$, where the step argument $y$ is duplicated on the right. Under any direct whole-term measure the recursor's mass profile coincides with that of a true circular reference; the boundary operator's channel-preservation axiom and the dependency-pair soundness license separate"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We identify a structural property of term-rewriting proof systems called operational inexpressibility: for a fixed input and a fixed dimension of that input, no derivation in the proof language both depends on that dimension and constrains the target question. The canonical instance is direct aggregation on the primitive recursion duplicator F(x,y,Z)→x, F(x,y,S(n))→G(y,F(x,y,n)), where the step argument y is duplicated on the right-hand side.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The companion orientation-boundary paper delineates the schema-level non-representability frontier and escape routes; we prove this frontier is operational inexpressibility at the step-argument dimension. Under any direct whole-term measure the recursor's mass profile coincides with a true circular reference, separated by the boundary operator's channel-preservation axiom and the dependency-pair license.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Operational inexpressibility is identified as the property that blocks derivations depending on input dimension from constraining the target in term-rewriting systems, with the step-duplicating primitive recursor as the canonical case at the orientation boundary.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Term-rewriting proof systems exhibit operational inexpressibility at the step-duplicating primitive recursor boundary, so no derivation both depends on the step dimension and constrains the target.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"93430923484c1209801eebb2000ba39b26362340e940e3dc68c5056207d558ab"},"source":{"id":"2604.22844","kind":"arxiv","version":3},"verdict":{"id":"1cd49532-c795-4192-a257-2a4813f931bd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T01:15:50.269718Z","strongest_claim":"We identify a structural property of term-rewriting proof systems called operational inexpressibility: for a fixed input and a fixed dimension of that input, no derivation in the proof language both depends on that dimension and constrains the target question. The canonical instance is direct aggregation on the primitive recursion duplicator F(x,y,Z)→x, F(x,y,S(n))→G(y,F(x,y,n)), where the step argument y is duplicated on the right-hand side.","one_line_summary":"Operational inexpressibility is identified as the property that blocks derivations depending on input dimension from constraining the target in term-rewriting systems, with the step-duplicating primitive recursor as the canonical case at the orientation boundary.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The companion orientation-boundary paper delineates the schema-level non-representability frontier and escape routes; we prove this frontier is operational inexpressibility at the step-argument dimension. Under any direct whole-term measure the recursor's mass profile coincides with a true circular reference, separated by the boundary operator's channel-preservation axiom and the dependency-pair license.","pith_extraction_headline":"Term-rewriting proof systems exhibit operational inexpressibility at the step-duplicating primitive recursor boundary, so no derivation both depends on the step dimension and constrains the target."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.22844/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T15:42:46.689174Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-20T02:35:48.028745Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f82844861738c08f8076721cec2ca57d8e8acf5d84a04b0e9d82b8b8141815ef"},"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":"1cd49532-c795-4192-a257-2a4813f931bd"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcWM15n7b+I83wwYZPY2iYvw//FMQgln0KNsS03/zLJR24PdRiFGHvLHEL6j3zHxvUbuRfN7L4IJ8q9wcWjOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:30:58.666115Z"},"content_sha256":"0b87f844d4bf947f35affa27671b74f7e6f93587b2c6746f0a3b7f45f0c57833","schema_version":"1.0","event_id":"sha256:0b87f844d4bf947f35affa27671b74f7e6f93587b2c6746f0a3b7f45f0c57833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DK5UXYZ4HYJYPZL7WVY37HUIN4/bundle.json","state_url":"https://pith.science/pith/DK5UXYZ4HYJYPZL7WVY37HUIN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DK5UXYZ4HYJYPZL7WVY37HUIN4/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-06T23:30:58Z","links":{"resolver":"https://pith.science/pith/DK5UXYZ4HYJYPZL7WVY37HUIN4","bundle":"https://pith.science/pith/DK5UXYZ4HYJYPZL7WVY37HUIN4/bundle.json","state":"https://pith.science/pith/DK5UXYZ4HYJYPZL7WVY37HUIN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DK5UXYZ4HYJYPZL7WVY37HUIN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DK5UXYZ4HYJYPZL7WVY37HUIN4","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":"d4ed3d8aa606f6ca0f44d0c6ee283c79c3bcefaaae2ab8a0a1b72db5cca1df60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-21T17:59:06Z","title_canon_sha256":"941d32a49d0d6612acb82fcb3eade27df0e26e12ccc64d40f3feebe46a7c20f4"},"schema_version":"1.0","source":{"id":"2604.22844","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22844","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22844v3","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22844","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"DK5UXYZ4HYJY","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"DK5UXYZ4HYJYPZL7","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"DK5UXYZ4","created_at":"2026-05-22T01:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:0b87f844d4bf947f35affa27671b74f7e6f93587b2c6746f0a3b7f45f0c57833","target":"graph","created_at":"2026-05-22T01:04:03Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We identify a structural property of term-rewriting proof systems called operational inexpressibility: for a fixed input and a fixed dimension of that input, no derivation in the proof language both depends on that dimension and constrains the target question. The canonical instance is direct aggregation on the primitive recursion duplicator F(x,y,Z)→x, F(x,y,S(n))→G(y,F(x,y,n)), where the step argument y is duplicated on the right-hand side."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The companion orientation-boundary paper delineates the schema-level non-representability frontier and escape routes; we prove this frontier is operational inexpressibility at the step-argument dimension. Under any direct whole-term measure the recursor's mass profile coincides with a true circular reference, separated by the boundary operator's channel-preservation axiom and the dependency-pair license."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Operational inexpressibility is identified as the property that blocks derivations depending on input dimension from constraining the target in term-rewriting systems, with the step-duplicating primitive recursor as the canonical case at the orientation boundary."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Term-rewriting proof systems exhibit operational inexpressibility at the step-duplicating primitive recursor boundary, so no derivation both depends on the step dimension and constrains the target."}],"snapshot_sha256":"93430923484c1209801eebb2000ba39b26362340e940e3dc68c5056207d558ab"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T15:42:46.689174Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T02:35:48.028745Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.22844/integrity.json","findings":[],"snapshot_sha256":"f82844861738c08f8076721cec2ca57d8e8acf5d84a04b0e9d82b8b8141815ef","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We identify a structural property of term-rewriting proof systems called operational inexpressibility: no derivation depends on a specified input dimension and also constrains the target question. The canonical instance is direct aggregation on the primitive recursion duplicator $F(x,y,Z)\\to x$, $F(x,y,S(n))\\to G(y,F(x,y,n))$, where the step argument $y$ is duplicated on the right. Under any direct whole-term measure the recursor's mass profile coincides with that of a true circular reference; the boundary operator's channel-preservation axiom and the dependency-pair soundness license separate","authors_text":"Moses Rahnama","cross_cats":[],"headline":"Term-rewriting proof systems exhibit operational inexpressibility at the step-duplicating primitive recursor boundary, so no derivation both depends on the step dimension and constrains the target.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-21T17:59:06Z","title":"Operational Inexpressibility at the Step-Duplicating Primitive Recursor Orientation Boundary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.22844","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-10T01:15:50.269718Z","id":"1cd49532-c795-4192-a257-2a4813f931bd","model_set":{"reader":"grok-4.3"},"one_line_summary":"Operational inexpressibility is identified as the property that blocks derivations depending on input dimension from constraining the target in term-rewriting systems, with the step-duplicating primitive recursor as the canonical case at the orientation boundary.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Term-rewriting proof systems exhibit operational inexpressibility at the step-duplicating primitive recursor boundary, so no derivation both depends on the step dimension and constrains the target.","strongest_claim":"We identify a structural property of term-rewriting proof systems called operational inexpressibility: for a fixed input and a fixed dimension of that input, no derivation in the proof language both depends on that dimension and constrains the target question. The canonical instance is direct aggregation on the primitive recursion duplicator F(x,y,Z)→x, F(x,y,S(n))→G(y,F(x,y,n)), where the step argument y is duplicated on the right-hand side.","weakest_assumption":"The companion orientation-boundary paper delineates the schema-level non-representability frontier and escape routes; we prove this frontier is operational inexpressibility at the step-argument dimension. Under any direct whole-term measure the recursor's mass profile coincides with a true circular reference, separated by the boundary operator's channel-preservation axiom and the dependency-pair license."}},"verdict_id":"1cd49532-c795-4192-a257-2a4813f931bd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5fae39148f8755b9068584566dbe44083b601faa042c9b6affaa0adc6fca2847","target":"record","created_at":"2026-05-22T01:04:03Z","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":"d4ed3d8aa606f6ca0f44d0c6ee283c79c3bcefaaae2ab8a0a1b72db5cca1df60","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-21T17:59:06Z","title_canon_sha256":"941d32a49d0d6612acb82fcb3eade27df0e26e12ccc64d40f3feebe46a7c20f4"},"schema_version":"1.0","source":{"id":"2604.22844","kind":"arxiv","version":3}},"canonical_sha256":"1abb4be33c3e1387e57fb571bf9e886f1327c8676f491b2865a0010fad4e1a6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1abb4be33c3e1387e57fb571bf9e886f1327c8676f491b2865a0010fad4e1a6c","first_computed_at":"2026-05-22T01:04:03.099742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:03.099742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5hqzQb1gzXY7kuXpZjVlxfPJHyYca6V3CwIhwi/rYv4cQQjyyU7eZTmG1M9HxkKfz0YES1+OCb5K1CvTDwgBA==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:03.100348Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.22844","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fae39148f8755b9068584566dbe44083b601faa042c9b6affaa0adc6fca2847","sha256:0b87f844d4bf947f35affa27671b74f7e6f93587b2c6746f0a3b7f45f0c57833"],"state_sha256":"875ff6c3bd89e3f8b6e1592848881e44a04af75de42b6019cf1fbb880998eab2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vs6vXmorV/8kpy4ncFRKtzODQj6RbmxOQlkych0K/I20WG34hTt2SdwRigx9WDgrm8FMOoP1L+YVC9ybww8wBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:30:58.671178Z","bundle_sha256":"7f73602dceb128a96d8067e60102aa609acdbc85032d1afd88555bce44fb2d11"}}