{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QVRPL6EAROXIQZ5KWQO3Z3U3X6","short_pith_number":"pith:QVRPL6EA","schema_version":"1.0","canonical_sha256":"8562f5f8808bae8867aab41dbcee9bbf970eb48cbc78dafe49d06fbf96bfb898","source":{"kind":"arxiv","id":"2501.16007","version":2},"attestation_state":"computed","paper":{"title":"TOPLOC: A Locality Sensitive Hashing Scheme for Trustless Verifiable Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Aaron Pazdera, Jack Min Ong, Johannes Hagemann, Manveer Basra, Matthew Di Ferrante, Max Ryabinin, Ryan Garner, Sami Jaghouar","submitted_at":"2025-01-27T12:46:45Z","abstract_excerpt":"Large language models (LLMs) have proven to be very capable, but access to frontier models currently relies on inference providers. This introduces trust challenges: how can we be sure that the provider is using the model configuration they claim? We propose TOPLOC, a novel method for verifiable inference that addresses this problem. TOPLOC leverages a compact locality-sensitive hashing mechanism for intermediate activations, which can detect unauthorized modifications to models, prompts, or precision with 100% accuracy, achieving no false positives or negatives in our empirical evaluations. O"},"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":"2501.16007","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-01-27T12:46:45Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4f6dae612397a01998a9276405c88ec936f06683a62d958964c0640a9369d71d","abstract_canon_sha256":"904eaaea5e9e1ccc1d675700332dad0f45bc97ab0bca70e0f41a094f3256e258"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:19.223962Z","signature_b64":"yWVZaVScEG5d5CuYzYGH85hqexWk2GqvgzDmEzOk8gWIIFNuUd9hiLKczROzrph6ipYeD4iRxykzXOcKVq82Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8562f5f8808bae8867aab41dbcee9bbf970eb48cbc78dafe49d06fbf96bfb898","last_reissued_at":"2026-07-05T11:13:19.223493Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:19.223493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TOPLOC: A Locality Sensitive Hashing Scheme for Trustless Verifiable Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Aaron Pazdera, Jack Min Ong, Johannes Hagemann, Manveer Basra, Matthew Di Ferrante, Max Ryabinin, Ryan Garner, Sami Jaghouar","submitted_at":"2025-01-27T12:46:45Z","abstract_excerpt":"Large language models (LLMs) have proven to be very capable, but access to frontier models currently relies on inference providers. This introduces trust challenges: how can we be sure that the provider is using the model configuration they claim? We propose TOPLOC, a novel method for verifiable inference that addresses this problem. TOPLOC leverages a compact locality-sensitive hashing mechanism for intermediate activations, which can detect unauthorized modifications to models, prompts, or precision with 100% accuracy, achieving no false positives or negatives in our empirical evaluations. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16007","kind":"arxiv","version":2},"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/2501.16007/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":"2501.16007","created_at":"2026-07-05T11:13:19.223549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.16007v2","created_at":"2026-07-05T11:13:19.223549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16007","created_at":"2026-07-05T11:13:19.223549+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVRPL6EAROXI","created_at":"2026-07-05T11:13:19.223549+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVRPL6EAROXIQZ5K","created_at":"2026-07-05T11:13:19.223549+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVRPL6EA","created_at":"2026-07-05T11:13:19.223549+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.20421","citing_title":"Hawkeye: Reproducing GPU-Level Non-Determinism","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17410","citing_title":"Computational Challenges in Token Economics: Bridging Economic Theory and AI System Design","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6","json":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6.json","graph_json":"https://pith.science/api/pith-number/QVRPL6EAROXIQZ5KWQO3Z3U3X6/graph.json","events_json":"https://pith.science/api/pith-number/QVRPL6EAROXIQZ5KWQO3Z3U3X6/events.json","paper":"https://pith.science/paper/QVRPL6EA"},"agent_actions":{"view_html":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6","download_json":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6.json","view_paper":"https://pith.science/paper/QVRPL6EA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.16007&json=true","fetch_graph":"https://pith.science/api/pith-number/QVRPL6EAROXIQZ5KWQO3Z3U3X6/graph.json","fetch_events":"https://pith.science/api/pith-number/QVRPL6EAROXIQZ5KWQO3Z3U3X6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6/action/storage_attestation","attest_author":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6/action/author_attestation","sign_citation":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6/action/citation_signature","submit_replication":"https://pith.science/pith/QVRPL6EAROXIQZ5KWQO3Z3U3X6/action/replication_record"}},"created_at":"2026-07-05T11:13:19.223549+00:00","updated_at":"2026-07-05T11:13:19.223549+00:00"}