{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XWKLSISAIEVKMENUQDBTKUOLTQ","short_pith_number":"pith:XWKLSISA","canonical_record":{"source":{"id":"2401.01668","kind":"arxiv","version":10},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-01-03T11:07:46Z","cross_cats_sorted":[],"title_canon_sha256":"526895330527bb0f3631994c3988fbc240965348907082d1e3bece27cf4ce2c0","abstract_canon_sha256":"788fb2b658021e13045510e0bea96fed18408ffe5696b87ab7fb9b639072da52"},"schema_version":"1.0"},"canonical_sha256":"bd94b92240412aa611b480c33551cb9c2843b43abd6c4e222c74651afe93c708","source":{"kind":"arxiv","id":"2401.01668","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.01668","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2401.01668v10","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01668","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"XWKLSISAIEVK","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"XWKLSISAIEVKMENU","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"XWKLSISA","created_at":"2026-05-26T01:03:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XWKLSISAIEVKMENUQDBTKUOLTQ","target":"record","payload":{"canonical_record":{"source":{"id":"2401.01668","kind":"arxiv","version":10},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-01-03T11:07:46Z","cross_cats_sorted":[],"title_canon_sha256":"526895330527bb0f3631994c3988fbc240965348907082d1e3bece27cf4ce2c0","abstract_canon_sha256":"788fb2b658021e13045510e0bea96fed18408ffe5696b87ab7fb9b639072da52"},"schema_version":"1.0"},"canonical_sha256":"bd94b92240412aa611b480c33551cb9c2843b43abd6c4e222c74651afe93c708","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:07.984160Z","signature_b64":"zBhAwJdxjKff8SKFsrF0ziotAw9tA7zqTlqYiLXXySIPp/BtfGy4WvmGSe2+S4Bnr1a2RI4fSoNgXzQtDL4JCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd94b92240412aa611b480c33551cb9c2843b43abd6c4e222c74651afe93c708","last_reissued_at":"2026-05-26T01:03:07.983310Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:07.983310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.01668","source_version":10,"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-26T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sNbL00N8MInHGaxSLHOfUaE4Yw1c+OcVf1oGttjYXIZuq/bhd7g7bpCsIWg27BLlaMKGiRduThu6LMboagADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:07:51.781447Z"},"content_sha256":"2f29ba84cb863fbae8a119ff54f6ecfbd108d62004940e976f7f62d897ce5ee6","schema_version":"1.0","event_id":"sha256:2f29ba84cb863fbae8a119ff54f6ecfbd108d62004940e976f7f62d897ce5ee6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XWKLSISAIEVKMENUQDBTKUOLTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Natural Term Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Every Natural Term Logic term reduces to a unique normal form through structural, predicative and pushing-in reductions.","cross_cats":[],"primary_cat":"math.LO","authors_text":"Clarence Protin","submitted_at":"2024-01-03T11:07:46Z","abstract_excerpt":"In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $\\nu$ between NTL terms and closed BL terms as well as a canonical map $\\beta$ which assigns "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Each NTL term T reduces to a unique normal term N; the reductions fall into structural, predicative and pushing-in categories, and beta nu N = N when N is normal.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The three classes of reductions are terminating and confluent on the defined syntax of NTL terms (implicit in the claim that every term reaches a unique normal form).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NTL defines terms and three classes of reductions (structural, predicative, pushing-in) that yield a unique normal form for every term, with a many-to-one map to Bealer's closed terms.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every Natural Term Logic term reduces to a unique normal form through structural, predicative and pushing-in reductions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8cc8dacae59150a54148e6261345c5272d0f460955b6396311b6029a9f0715e1"},"source":{"id":"2401.01668","kind":"arxiv","version":10},"verdict":{"id":"e0143694-f439-4c12-a4f8-6ecc3c58bbf0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-24T04:19:06.741579Z","strongest_claim":"Each NTL term T reduces to a unique normal term N; the reductions fall into structural, predicative and pushing-in categories, and beta nu N = N when N is normal.","one_line_summary":"NTL defines terms and three classes of reductions (structural, predicative, pushing-in) that yield a unique normal form for every term, with a many-to-one map to Bealer's closed terms.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The three classes of reductions are terminating and confluent on the defined syntax of NTL terms (implicit in the claim that every term reaches a unique normal form).","pith_extraction_headline":"Every Natural Term Logic term reduces to a unique normal form through structural, predicative and pushing-in reductions."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.01668/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"},"verdict_id":"e0143694-f439-4c12-a4f8-6ecc3c58bbf0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHlXvQQLQ2xi72LB3kmQgWkMThXmEqjdCBwUYnsRknbqRfuUIyfbPnrYsbQfwyG5mI9hMIfVr7fLYUYARFO6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:07:51.782425Z"},"content_sha256":"3e0d285a1d79cf39337d532177697164f7511af4a9d746816df7b07a9bc4ecb0","schema_version":"1.0","event_id":"sha256:3e0d285a1d79cf39337d532177697164f7511af4a9d746816df7b07a9bc4ecb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWKLSISAIEVKMENUQDBTKUOLTQ/bundle.json","state_url":"https://pith.science/pith/XWKLSISAIEVKMENUQDBTKUOLTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWKLSISAIEVKMENUQDBTKUOLTQ/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:07:51Z","links":{"resolver":"https://pith.science/pith/XWKLSISAIEVKMENUQDBTKUOLTQ","bundle":"https://pith.science/pith/XWKLSISAIEVKMENUQDBTKUOLTQ/bundle.json","state":"https://pith.science/pith/XWKLSISAIEVKMENUQDBTKUOLTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWKLSISAIEVKMENUQDBTKUOLTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XWKLSISAIEVKMENUQDBTKUOLTQ","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":"788fb2b658021e13045510e0bea96fed18408ffe5696b87ab7fb9b639072da52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-01-03T11:07:46Z","title_canon_sha256":"526895330527bb0f3631994c3988fbc240965348907082d1e3bece27cf4ce2c0"},"schema_version":"1.0","source":{"id":"2401.01668","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.01668","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2401.01668v10","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01668","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"XWKLSISAIEVK","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"XWKLSISAIEVKMENU","created_at":"2026-05-26T01:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"XWKLSISA","created_at":"2026-05-26T01:03:07Z"}],"graph_snapshots":[{"event_id":"sha256:3e0d285a1d79cf39337d532177697164f7511af4a9d746816df7b07a9bc4ecb0","target":"graph","created_at":"2026-05-26T01:03:07Z","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":"Each NTL term T reduces to a unique normal term N; the reductions fall into structural, predicative and pushing-in categories, and beta nu N = N when N is normal."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The three classes of reductions are terminating and confluent on the defined syntax of NTL terms (implicit in the claim that every term reaches a unique normal form)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NTL defines terms and three classes of reductions (structural, predicative, pushing-in) that yield a unique normal form for every term, with a many-to-one map to Bealer's closed terms."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every Natural Term Logic term reduces to a unique normal form through structural, predicative and pushing-in reductions."}],"snapshot_sha256":"8cc8dacae59150a54148e6261345c5272d0f460955b6396311b6029a9f0715e1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.01668/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $\\nu$ between NTL terms and closed BL terms as well as a canonical map $\\beta$ which assigns ","authors_text":"Clarence Protin","cross_cats":[],"headline":"Every Natural Term Logic term reduces to a unique normal form through structural, predicative and pushing-in reductions.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-01-03T11:07:46Z","title":"Natural Term Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01668","kind":"arxiv","version":10},"verdict":{"created_at":"2026-05-24T04:19:06.741579Z","id":"e0143694-f439-4c12-a4f8-6ecc3c58bbf0","model_set":{"reader":"grok-4.3"},"one_line_summary":"NTL defines terms and three classes of reductions (structural, predicative, pushing-in) that yield a unique normal form for every term, with a many-to-one map to Bealer's closed terms.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every Natural Term Logic term reduces to a unique normal form through structural, predicative and pushing-in reductions.","strongest_claim":"Each NTL term T reduces to a unique normal term N; the reductions fall into structural, predicative and pushing-in categories, and beta nu N = N when N is normal.","weakest_assumption":"The three classes of reductions are terminating and confluent on the defined syntax of NTL terms (implicit in the claim that every term reaches a unique normal form)."}},"verdict_id":"e0143694-f439-4c12-a4f8-6ecc3c58bbf0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2f29ba84cb863fbae8a119ff54f6ecfbd108d62004940e976f7f62d897ce5ee6","target":"record","created_at":"2026-05-26T01:03:07Z","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":"788fb2b658021e13045510e0bea96fed18408ffe5696b87ab7fb9b639072da52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-01-03T11:07:46Z","title_canon_sha256":"526895330527bb0f3631994c3988fbc240965348907082d1e3bece27cf4ce2c0"},"schema_version":"1.0","source":{"id":"2401.01668","kind":"arxiv","version":10}},"canonical_sha256":"bd94b92240412aa611b480c33551cb9c2843b43abd6c4e222c74651afe93c708","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd94b92240412aa611b480c33551cb9c2843b43abd6c4e222c74651afe93c708","first_computed_at":"2026-05-26T01:03:07.983310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:07.983310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBhAwJdxjKff8SKFsrF0ziotAw9tA7zqTlqYiLXXySIPp/BtfGy4WvmGSe2+S4Bnr1a2RI4fSoNgXzQtDL4JCg==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:07.984160Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.01668","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f29ba84cb863fbae8a119ff54f6ecfbd108d62004940e976f7f62d897ce5ee6","sha256:3e0d285a1d79cf39337d532177697164f7511af4a9d746816df7b07a9bc4ecb0"],"state_sha256":"a904825aab521a599b6b9cb2e676d59317ced28b29368329690bdd6a626fa458"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uctvmCEYOvuGwVpe3kLTXUWmKW0ZqrE0ALVSMH+Z340wiW/Q0HL1pLKMkbzJuDDS2bAZQzQnWimwO1mvKkPEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:07:51.786849Z","bundle_sha256":"490ad621f51c16c68fef7dccd4b4c1aee70a442924486ac0556e957ea24d6a4b"}}