{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YHUQUVWU5BO6IN5R457FKRCKM3","short_pith_number":"pith:YHUQUVWU","canonical_record":{"source":{"id":"1305.0453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-02T14:47:26Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"311534a91ffc8b01f0d17db1e7cc4e74abf100aa8a34a418f68510e2530302ba","abstract_canon_sha256":"5794123f1a4268c248cc9b0351901ab700a5c2f4b21cf3d452f8186fb9138872"},"schema_version":"1.0"},"canonical_sha256":"c1e90a56d4e85de437b1e77e55444a66ea5d8d255cf613213ba3fbe10b325f2e","source":{"kind":"arxiv","id":"1305.0453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0453","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0453v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0453","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"YHUQUVWU5BO6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YHUQUVWU5BO6IN5R","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YHUQUVWU","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YHUQUVWU5BO6IN5R457FKRCKM3","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-02T14:47:26Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"311534a91ffc8b01f0d17db1e7cc4e74abf100aa8a34a418f68510e2530302ba","abstract_canon_sha256":"5794123f1a4268c248cc9b0351901ab700a5c2f4b21cf3d452f8186fb9138872"},"schema_version":"1.0"},"canonical_sha256":"c1e90a56d4e85de437b1e77e55444a66ea5d8d255cf613213ba3fbe10b325f2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.268421Z","signature_b64":"RahB/JqxIZwdrd9bDVzcRFKiXUfphNKrS69dGUQg+HdurrSY58ejUQfkG1Fzs5KIYxZT4amunF4k/vYtEM0OBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e90a56d4e85de437b1e77e55444a66ea5d8d255cf613213ba3fbe10b325f2e","last_reissued_at":"2026-05-18T03:26:40.267923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.267923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0453","source_version":1,"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-18T03:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bf5TSVDRd7wNzJhK5ZQtvUZLczcdZY1CR2e+lIn2BAoxERlJRxxsyKzmTd9aiiA/KSw/Q0JbuLEvy4buojcIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:25:23.494471Z"},"content_sha256":"2e2352a16e1f2a20b0ad4540e093ac7de12e2916bf9f31b5d18197434b0c2904","schema_version":"1.0","event_id":"sha256:2e2352a16e1f2a20b0ad4540e093ac7de12e2916bf9f31b5d18197434b0c2904"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YHUQUVWU5BO6IN5R457FKRCKM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Theory for Operators in Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CC","authors_text":"Akitoshi Kawamura, Stephen Cook","submitted_at":"2013-05-02T14:47:26Z","abstract_excerpt":"We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea is to use (a certain class of) string functions as names representing these objects. These are more expressive than infinite sequences, which served as names in prior work that formulated complexity in more restricted settings. An advantage of using string functions is that we can define their \"size\" in the way inspired by higher-type complexity theory. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0453","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":""},"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-18T03:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DaW2C9VyK5/z9e5c6uSTtzg61aRb+W53kGyPE+QcnQA1VHYlA9t+RmxrV5ylvAInwyrqjcFVbkxdORLcdNBeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:25:23.494813Z"},"content_sha256":"882fe4fdf5693e6060226f9196fba49151c8cea3c9f9eefe181461871c7dc7eb","schema_version":"1.0","event_id":"sha256:882fe4fdf5693e6060226f9196fba49151c8cea3c9f9eefe181461871c7dc7eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHUQUVWU5BO6IN5R457FKRCKM3/bundle.json","state_url":"https://pith.science/pith/YHUQUVWU5BO6IN5R457FKRCKM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHUQUVWU5BO6IN5R457FKRCKM3/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-24T19:25:23Z","links":{"resolver":"https://pith.science/pith/YHUQUVWU5BO6IN5R457FKRCKM3","bundle":"https://pith.science/pith/YHUQUVWU5BO6IN5R457FKRCKM3/bundle.json","state":"https://pith.science/pith/YHUQUVWU5BO6IN5R457FKRCKM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHUQUVWU5BO6IN5R457FKRCKM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YHUQUVWU5BO6IN5R457FKRCKM3","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":"5794123f1a4268c248cc9b0351901ab700a5c2f4b21cf3d452f8186fb9138872","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-02T14:47:26Z","title_canon_sha256":"311534a91ffc8b01f0d17db1e7cc4e74abf100aa8a34a418f68510e2530302ba"},"schema_version":"1.0","source":{"id":"1305.0453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0453","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0453v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0453","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"YHUQUVWU5BO6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YHUQUVWU5BO6IN5R","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YHUQUVWU","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:882fe4fdf5693e6060226f9196fba49151c8cea3c9f9eefe181461871c7dc7eb","target":"graph","created_at":"2026-05-18T03:26:40Z","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":"We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea is to use (a certain class of) string functions as names representing these objects. These are more expressive than infinite sequences, which served as names in prior work that formulated complexity in more restricted settings. An advantage of using string functions is that we can define their \"size\" in the way inspired by higher-type complexity theory. This","authors_text":"Akitoshi Kawamura, Stephen Cook","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-02T14:47:26Z","title":"Complexity Theory for Operators in Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0453","kind":"arxiv","version":1},"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:2e2352a16e1f2a20b0ad4540e093ac7de12e2916bf9f31b5d18197434b0c2904","target":"record","created_at":"2026-05-18T03:26:40Z","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":"5794123f1a4268c248cc9b0351901ab700a5c2f4b21cf3d452f8186fb9138872","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-02T14:47:26Z","title_canon_sha256":"311534a91ffc8b01f0d17db1e7cc4e74abf100aa8a34a418f68510e2530302ba"},"schema_version":"1.0","source":{"id":"1305.0453","kind":"arxiv","version":1}},"canonical_sha256":"c1e90a56d4e85de437b1e77e55444a66ea5d8d255cf613213ba3fbe10b325f2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e90a56d4e85de437b1e77e55444a66ea5d8d255cf613213ba3fbe10b325f2e","first_computed_at":"2026-05-18T03:26:40.267923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:40.267923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RahB/JqxIZwdrd9bDVzcRFKiXUfphNKrS69dGUQg+HdurrSY58ejUQfkG1Fzs5KIYxZT4amunF4k/vYtEM0OBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:40.268421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e2352a16e1f2a20b0ad4540e093ac7de12e2916bf9f31b5d18197434b0c2904","sha256:882fe4fdf5693e6060226f9196fba49151c8cea3c9f9eefe181461871c7dc7eb"],"state_sha256":"341233a7a66435bbf71fe80b7aa86c0effe6b8c675bcdb3daa0da0040540bdae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URUtv22CWx2rN8VWYqtzQGAJK2Qhp+KLDEUOGg25g364Wg3U3bj5M3vjo0SpE97dGY46w+52LtJP8k88OIYrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:25:23.496693Z","bundle_sha256":"bbfa9be969af4a1cc58ed81a11cb9ece8e2043d0425934dc1968ee3570760893"}}