{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H7J4Y2APJAV3L2DOFZWTJSYT6H","short_pith_number":"pith:H7J4Y2AP","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"},"canonical_sha256":"3fd3cc680f482bb5e86e2e6d34cb13f1da11c45c542a7666ece7ccfbfa5f1f6a","source":{"kind":"arxiv","id":"1809.08695","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08695","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08695v3","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08695","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"H7J4Y2APJAV3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7J4Y2APJAV3L2DO","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7J4Y2AP","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H7J4Y2APJAV3L2DOFZWTJSYT6H","target":"record","payload":{"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"},"canonical_sha256":"3fd3cc680f482bb5e86e2e6d34cb13f1da11c45c542a7666ece7ccfbfa5f1f6a","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"},"source_kind":"arxiv","source_id":"1809.08695","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1DCnKUjJQ4Ln+ypbeOSGdR3uP9UsMv8aME7WCaMqniGdV2DjqUALZd99a6VuC2AoyDKg3H6zlLmpidKI998AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:51:09.027237Z"},"content_sha256":"a0ee9a0902f77de3e0039e7a130bbaa8cdb99b83caeab9e90f4f8544f7f0d21a","schema_version":"1.0","event_id":"sha256:a0ee9a0902f77de3e0039e7a130bbaa8cdb99b83caeab9e90f4f8544f7f0d21a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H7J4Y2APJAV3L2DOFZWTJSYT6H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8thgjUdsMm9MTKoYKdzjl8BasuMg2tmkcz6ula/GyvlBK52NjDhs7zlbMhJ04orUNYlpUhi13Ey33CBWm9vDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:51:09.027609Z"},"content_sha256":"8b1781aee7f43d772f0a60bc2a7377ec0244942306292f717b57b52fc6dfc880","schema_version":"1.0","event_id":"sha256:8b1781aee7f43d772f0a60bc2a7377ec0244942306292f717b57b52fc6dfc880"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/bundle.json","state_url":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T17:51:09Z","links":{"resolver":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H","bundle":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/bundle.json","state":"https://pith.science/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7J4Y2APJAV3L2DOFZWTJSYT6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H7J4Y2APJAV3L2DOFZWTJSYT6H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3d701293cc60b41fee46557eb6a6666ba9d7bfec1db998ed6eeb19fd20eabab7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-23T23:09:49Z","title_canon_sha256":"6c0546a243fb7cf3b3373ec82d4c24cf9d310efa269ba36a410d46bcf42e6e09"},"schema_version":"1.0","source":{"id":"1809.08695","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08695","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08695v3","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08695","created_at":"2026-05-17T23:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"H7J4Y2APJAV3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7J4Y2APJAV3L2DO","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7J4Y2AP","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:8b1781aee7f43d772f0a60bc2a7377ec0244942306292f717b57b52fc6dfc880","target":"graph","created_at":"2026-05-17T23:58:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Akitoshi Kawamura, Donghyun Lim, Martin Ziegler, Svetlana Selivanova","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-23T23:09:49Z","title":"Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08695","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a0ee9a0902f77de3e0039e7a130bbaa8cdb99b83caeab9e90f4f8544f7f0d21a","target":"record","created_at":"2026-05-17T23:58:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3d701293cc60b41fee46557eb6a6666ba9d7bfec1db998ed6eeb19fd20eabab7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-23T23:09:49Z","title_canon_sha256":"6c0546a243fb7cf3b3373ec82d4c24cf9d310efa269ba36a410d46bcf42e6e09"},"schema_version":"1.0","source":{"id":"1809.08695","kind":"arxiv","version":3}},"canonical_sha256":"3fd3cc680f482bb5e86e2e6d34cb13f1da11c45c542a7666ece7ccfbfa5f1f6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fd3cc680f482bb5e86e2e6d34cb13f1da11c45c542a7666ece7ccfbfa5f1f6a","first_computed_at":"2026-05-17T23:58:47.511176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:47.511176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cteLrMW98bCCCtM2hblOZAM99a5AhppmlQd7doaQDBMUF6QI9SFrAXnQJnAerqARIxqbsds3ox/7EojsTvzwBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:47.511645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08695","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0ee9a0902f77de3e0039e7a130bbaa8cdb99b83caeab9e90f4f8544f7f0d21a","sha256:8b1781aee7f43d772f0a60bc2a7377ec0244942306292f717b57b52fc6dfc880"],"state_sha256":"497d5a135d77959d557a949a4c5722a788d0265aecd36c07e168601167bf9eb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5TfQEUMluPuhCdw0xm9t1gkmYl26LmdqGSG+JBUtToGaBwBxJoQjiBS1u2ISaY4DqRwT1h9iDbbD5uXljzHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:51:09.029571Z","bundle_sha256":"bbe591395a9c657519faadbb18535873a3df98a4611c1418bc7a81c350d54d84"}}