{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H7J4Y2APJAV3L2DOFZWTJSYT6H","short_pith_number":"pith:H7J4Y2AP","schema_version":"1.0","canonical_sha256":"3fd3cc680f482bb5e86e2e6d34cb13f1da11c45c542a7666ece7ccfbfa5f1f6a","source":{"kind":"arxiv","id":"1809.08695","version":3},"attestation_state":"computed","paper":{"title":"Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LO","authors_text":"Akitoshi Kawamura, Donghyun Lim, Martin Ziegler, Svetlana Selivanova","submitted_at":"2018-09-23T23:09:49Z","abstract_excerpt":"Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational complexity -- already regarding real numbers, not to mention more advanced (e.g. Sobolev) spaces. For a general theory of computational complexity over continuous data we introduce and justify QUANTITATIVE admissibility as requirement for sensible encodings of arbitrary compact metric spaces, a refinement of qualitative 'admissibility' due to [Kreitz&Weihrauch'8"},"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":"1809.08695","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-23T23:09:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6c0546a243fb7cf3b3373ec82d4c24cf9d310efa269ba36a410d46bcf42e6e09","abstract_canon_sha256":"3d701293cc60b41fee46557eb6a6666ba9d7bfec1db998ed6eeb19fd20eabab7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:47.511645Z","signature_b64":"cteLrMW98bCCCtM2hblOZAM99a5AhppmlQd7doaQDBMUF6QI9SFrAXnQJnAerqARIxqbsds3ox/7EojsTvzwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fd3cc680f482bb5e86e2e6d34cb13f1da11c45c542a7666ece7ccfbfa5f1f6a","last_reissued_at":"2026-05-17T23:58:47.511176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:47.511176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LO","authors_text":"Akitoshi Kawamura, Donghyun Lim, Martin Ziegler, Svetlana Selivanova","submitted_at":"2018-09-23T23:09:49Z","abstract_excerpt":"Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational complexity -- already regarding real numbers, not to mention more advanced (e.g. Sobolev) spaces. For a general theory of computational complexity over continuous data we introduce and justify QUANTITATIVE admissibility as requirement for sensible encodings of arbitrary compact metric spaces, a refinement of qualitative 'admissibility' due to [Kreitz&Weihrauch'8"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08695","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1809.08695","created_at":"2026-05-17T23:58:47.511241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08695v3","created_at":"2026-05-17T23:58:47.511241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08695","created_at":"2026-05-17T23:58:47.511241+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7J4Y2APJAV3","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7J4Y2APJAV3L2DO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7J4Y2AP","created_at":"2026-05-18T12:32:28.185984+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/H7J4Y2APJAV3L2DOFZWTJSYT6H","json":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H.json","graph_json":"https://pith.science/api/pith-number/H7J4Y2APJAV3L2DOFZWTJSYT6H/graph.json","events_json":"https://pith.science/api/pith-number/H7J4Y2APJAV3L2DOFZWTJSYT6H/events.json","paper":"https://pith.science/paper/H7J4Y2AP"},"agent_actions":{"view_html":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H","download_json":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H.json","view_paper":"https://pith.science/paper/H7J4Y2AP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08695&json=true","fetch_graph":"https://pith.science/api/pith-number/H7J4Y2APJAV3L2DOFZWTJSYT6H/graph.json","fetch_events":"https://pith.science/api/pith-number/H7J4Y2APJAV3L2DOFZWTJSYT6H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/action/storage_attestation","attest_author":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/action/author_attestation","sign_citation":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/action/citation_signature","submit_replication":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/action/replication_record"}},"created_at":"2026-05-17T23:58:47.511241+00:00","updated_at":"2026-05-17T23:58:47.511241+00:00"}