{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N27LWX64MOHSMKQVDSJ4BB6XBW","short_pith_number":"pith:N27LWX64","schema_version":"1.0","canonical_sha256":"6ebebb5fdc638f262a151c93c087d70da99a69309abbc5347b142e967070b0b7","source":{"kind":"arxiv","id":"2607.05016","version":1},"attestation_state":"computed","paper":{"title":"Algorithmically Presented Numbers and Canonical Representations in Cryptographic Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Arslan Br\\\"omme","submitted_at":"2026-07-06T12:56:58Z","abstract_excerpt":"This paper develops a representation-theoretic perspective on cryptographic protocols. The focus is not solely on the computability of the abstract value as an extensional property, but on the algorithmic structure of its presentation in a representation system: for operational use in protocols, algorithmic accessibility of the value does not suffice; its fixed presentation is also decisive. We distinguish three representation-theoretic notions -- algorithmically approximable (A_app, the computable real numbers), finitely exactly describable in a system (A_fin(S)), and canonical normalizabilit"},"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":"2607.05016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-07-06T12:56:58Z","cross_cats_sorted":[],"title_canon_sha256":"b2c4e93a97c133644a466bccad10f120fd65346296b5a5082084a507f1472c21","abstract_canon_sha256":"076d49069bc6d9918219ec8fb29a79cb730318dee16343bea8871a9b17032bea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:20:18.512185Z","signature_b64":"it/XxlWzCW6uD53ZhOwiC/HNcKeb6irNqjFG3KFzw2lZifTXSpUBEwzfivB2sh3jKjUodCEbs+L+92Azus5ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ebebb5fdc638f262a151c93c087d70da99a69309abbc5347b142e967070b0b7","last_reissued_at":"2026-07-07T02:20:18.511114Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:20:18.511114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmically Presented Numbers and Canonical Representations in Cryptographic Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Arslan Br\\\"omme","submitted_at":"2026-07-06T12:56:58Z","abstract_excerpt":"This paper develops a representation-theoretic perspective on cryptographic protocols. The focus is not solely on the computability of the abstract value as an extensional property, but on the algorithmic structure of its presentation in a representation system: for operational use in protocols, algorithmic accessibility of the value does not suffice; its fixed presentation is also decisive. We distinguish three representation-theoretic notions -- algorithmically approximable (A_app, the computable real numbers), finitely exactly describable in a system (A_fin(S)), and canonical normalizabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05016","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/2607.05016/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":"2607.05016","created_at":"2026-07-07T02:20:18.511379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05016v1","created_at":"2026-07-07T02:20:18.511379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05016","created_at":"2026-07-07T02:20:18.511379+00:00"},{"alias_kind":"pith_short_12","alias_value":"N27LWX64MOHS","created_at":"2026-07-07T02:20:18.511379+00:00"},{"alias_kind":"pith_short_16","alias_value":"N27LWX64MOHSMKQV","created_at":"2026-07-07T02:20:18.511379+00:00"},{"alias_kind":"pith_short_8","alias_value":"N27LWX64","created_at":"2026-07-07T02:20:18.511379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06508","citing_title":"Canonicalization Failures as a Recurring Vulnerability Class: Representation Divergence in Cryptographic Systems and Its Avoidance","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW","json":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW.json","graph_json":"https://pith.science/api/pith-number/N27LWX64MOHSMKQVDSJ4BB6XBW/graph.json","events_json":"https://pith.science/api/pith-number/N27LWX64MOHSMKQVDSJ4BB6XBW/events.json","paper":"https://pith.science/paper/N27LWX64"},"agent_actions":{"view_html":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW","download_json":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW.json","view_paper":"https://pith.science/paper/N27LWX64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05016&json=true","fetch_graph":"https://pith.science/api/pith-number/N27LWX64MOHSMKQVDSJ4BB6XBW/graph.json","fetch_events":"https://pith.science/api/pith-number/N27LWX64MOHSMKQVDSJ4BB6XBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW/action/storage_attestation","attest_author":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW/action/author_attestation","sign_citation":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW/action/citation_signature","submit_replication":"https://pith.science/pith/N27LWX64MOHSMKQVDSJ4BB6XBW/action/replication_record"}},"created_at":"2026-07-07T02:20:18.511379+00:00","updated_at":"2026-07-07T02:20:18.511379+00:00"}