{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GYA6U77B7F65MVD627XC5ZXA63","short_pith_number":"pith:GYA6U77B","schema_version":"1.0","canonical_sha256":"3601ea7fe1f97dd6547ed7ee2ee6e0f6c831e8026d5eb1a50e78d9dea06e11a7","source":{"kind":"arxiv","id":"2509.11068","version":1},"attestation_state":"computed","paper":{"title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bryan Ng, Hiroyuki Ohsaki, Zan-Kai Chong","submitted_at":"2025-09-14T03:30:06Z","abstract_excerpt":"The landscape of Large Language Models (LLMs) shifts rapidly towards dynamic, multi-agent systems. This introduces a fundamental challenge in establishing computational trust, specifically how one agent can verify that another's output was genuinely produced by a claimed LLM, and not falsified or generated by a cheaper or inferior model. To address this challenge, this paper proposes a verification framework that achieves tractable asymmetric effort, where the cost to verify a computation is substantially lower than the cost to perform it. Our approach is built upon the principle of determinis"},"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":"2509.11068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-09-14T03:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"e536c3133b477b4406fd2bbe6a5da2d59cfac5a12d32f30affc366c3a8e78a4b","abstract_canon_sha256":"f6b91c182456f0d50fcf6a5c753df75df9ed49911593331c8e2e019ee98d25a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:32.932647Z","signature_b64":"vbnpIxqfn/Ytu6Uevl0rtuwJz2s4MZRvVwlSfAEEOFKtb8gsswn1OLnB5n+Y808y/JrEiecOZ3j2tQ8V3yItCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3601ea7fe1f97dd6547ed7ee2ee6e0f6c831e8026d5eb1a50e78d9dea06e11a7","last_reissued_at":"2026-07-05T12:11:32.932177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:32.932177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bryan Ng, Hiroyuki Ohsaki, Zan-Kai Chong","submitted_at":"2025-09-14T03:30:06Z","abstract_excerpt":"The landscape of Large Language Models (LLMs) shifts rapidly towards dynamic, multi-agent systems. This introduces a fundamental challenge in establishing computational trust, specifically how one agent can verify that another's output was genuinely produced by a claimed LLM, and not falsified or generated by a cheaper or inferior model. To address this challenge, this paper proposes a verification framework that achieves tractable asymmetric effort, where the cost to verify a computation is substantially lower than the cost to perform it. Our approach is built upon the principle of determinis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.11068","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/2509.11068/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":"2509.11068","created_at":"2026-07-05T12:11:32.932234+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.11068v1","created_at":"2026-07-05T12:11:32.932234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.11068","created_at":"2026-07-05T12:11:32.932234+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYA6U77B7F65","created_at":"2026-07-05T12:11:32.932234+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYA6U77B7F65MVD6","created_at":"2026-07-05T12:11:32.932234+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYA6U77B","created_at":"2026-07-05T12:11:32.932234+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23414","citing_title":"When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63","json":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63.json","graph_json":"https://pith.science/api/pith-number/GYA6U77B7F65MVD627XC5ZXA63/graph.json","events_json":"https://pith.science/api/pith-number/GYA6U77B7F65MVD627XC5ZXA63/events.json","paper":"https://pith.science/paper/GYA6U77B"},"agent_actions":{"view_html":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63","download_json":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63.json","view_paper":"https://pith.science/paper/GYA6U77B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.11068&json=true","fetch_graph":"https://pith.science/api/pith-number/GYA6U77B7F65MVD627XC5ZXA63/graph.json","fetch_events":"https://pith.science/api/pith-number/GYA6U77B7F65MVD627XC5ZXA63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63/action/storage_attestation","attest_author":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63/action/author_attestation","sign_citation":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63/action/citation_signature","submit_replication":"https://pith.science/pith/GYA6U77B7F65MVD627XC5ZXA63/action/replication_record"}},"created_at":"2026-07-05T12:11:32.932234+00:00","updated_at":"2026-07-05T12:11:32.932234+00:00"}