{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2M2OC6OD5S3Z5D67MILRGHLE7S","short_pith_number":"pith:2M2OC6OD","schema_version":"1.0","canonical_sha256":"d334e179c3ecb79e8fdf6217131d64fcb4277a75de37fff15342753451a10a4e","source":{"kind":"arxiv","id":"2606.29177","version":1},"attestation_state":"computed","paper":{"title":"Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Fabio F.G. Buono","submitted_at":"2026-06-28T03:46:33Z","abstract_excerpt":"We prove that syntactic separation implies computational indistinguishability. A local syntactic system R acts on terms within radius r0 without consulting any model; when two Skolem functions are syntactically separated in R, no derivation can prove their equivalence (Case 1), and any sound local extension requires Omega(n) steps, improving to Omega(2^n) under clause-per-configuration encoding (Case 2). Both bounds are new: the derivation-length lower bound does not appear in prior work on Skolemization or saturation proving, and the cryptographic reading, syntactic separation as ciphertext i"},"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":"2606.29177","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-28T03:46:33Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"bb10fd96f9956c6730bfe2f23f94d48149aeaa9b60ab4052bcccedc30b6eaa07","abstract_canon_sha256":"09d51cb183c266dcbeefbd76618f0f8096fffef8c8b14f6e9153bc45038ead65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:56.012165Z","signature_b64":"Td9chBXangxsU3K1TqHzMlxs5qfOvwamRb4MjZJvJ4g59iz9p0EPociUOlDJHW75vwK12DJI9ppRc/9BRp63AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d334e179c3ecb79e8fdf6217131d64fcb4277a75de37fff15342753451a10a4e","last_reissued_at":"2026-06-30T01:17:56.011734Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:56.011734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Fabio F.G. Buono","submitted_at":"2026-06-28T03:46:33Z","abstract_excerpt":"We prove that syntactic separation implies computational indistinguishability. A local syntactic system R acts on terms within radius r0 without consulting any model; when two Skolem functions are syntactically separated in R, no derivation can prove their equivalence (Case 1), and any sound local extension requires Omega(n) steps, improving to Omega(2^n) under clause-per-configuration encoding (Case 2). Both bounds are new: the derivation-length lower bound does not appear in prior work on Skolemization or saturation proving, and the cryptographic reading, syntactic separation as ciphertext i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29177","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/2606.29177/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":"2606.29177","created_at":"2026-06-30T01:17:56.011801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29177v1","created_at":"2026-06-30T01:17:56.011801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29177","created_at":"2026-06-30T01:17:56.011801+00:00"},{"alias_kind":"pith_short_12","alias_value":"2M2OC6OD5S3Z","created_at":"2026-06-30T01:17:56.011801+00:00"},{"alias_kind":"pith_short_16","alias_value":"2M2OC6OD5S3Z5D67","created_at":"2026-06-30T01:17:56.011801+00:00"},{"alias_kind":"pith_short_8","alias_value":"2M2OC6OD","created_at":"2026-06-30T01:17:56.011801+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/2M2OC6OD5S3Z5D67MILRGHLE7S","json":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S.json","graph_json":"https://pith.science/api/pith-number/2M2OC6OD5S3Z5D67MILRGHLE7S/graph.json","events_json":"https://pith.science/api/pith-number/2M2OC6OD5S3Z5D67MILRGHLE7S/events.json","paper":"https://pith.science/paper/2M2OC6OD"},"agent_actions":{"view_html":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S","download_json":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S.json","view_paper":"https://pith.science/paper/2M2OC6OD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29177&json=true","fetch_graph":"https://pith.science/api/pith-number/2M2OC6OD5S3Z5D67MILRGHLE7S/graph.json","fetch_events":"https://pith.science/api/pith-number/2M2OC6OD5S3Z5D67MILRGHLE7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S/action/storage_attestation","attest_author":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S/action/author_attestation","sign_citation":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S/action/citation_signature","submit_replication":"https://pith.science/pith/2M2OC6OD5S3Z5D67MILRGHLE7S/action/replication_record"}},"created_at":"2026-06-30T01:17:56.011801+00:00","updated_at":"2026-06-30T01:17:56.011801+00:00"}