{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J27RTUQJHNPJMATESPCOQR5UBY","short_pith_number":"pith:J27RTUQJ","canonical_record":{"source":{"id":"1801.07108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-19T07:58:40Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"a8909deac4366e7ee723cb22e606f5fa6c668fe13d4a010d6eda9f86331a2446","abstract_canon_sha256":"2d07d4c1a255f9393e81c5345c7ba0ab5e94f3dbedfc11dd6d9790a40ef48752"},"schema_version":"1.0"},"canonical_sha256":"4ebf19d2093b5e96026493c4e847b40e2ddcbac7b5902ccbadc90b961ae38f7b","source":{"kind":"arxiv","id":"1801.07108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07108","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07108v1","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07108","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"J27RTUQJHNPJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J27RTUQJHNPJMATE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J27RTUQJ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J27RTUQJHNPJMATESPCOQR5UBY","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-19T07:58:40Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"a8909deac4366e7ee723cb22e606f5fa6c668fe13d4a010d6eda9f86331a2446","abstract_canon_sha256":"2d07d4c1a255f9393e81c5345c7ba0ab5e94f3dbedfc11dd6d9790a40ef48752"},"schema_version":"1.0"},"canonical_sha256":"4ebf19d2093b5e96026493c4e847b40e2ddcbac7b5902ccbadc90b961ae38f7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:22.229707Z","signature_b64":"Gq+LuT9deEi1jpRhVdEb2IhatH4Y1NuP/ryZmGS9I23WGwUvGpEaKEB9MmL/DWG+tAtTGUoBHtiIbjG91NrJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ebf19d2093b5e96026493c4e847b40e2ddcbac7b5902ccbadc90b961ae38f7b","last_reissued_at":"2026-05-18T00:25:22.229104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:22.229104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07108","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-18T00:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9/fYSPx0lts1d/atJUALQKrc8rOzkL1uJIRti4ZkxtqG5sIM9afZMqAF6pS21/4JADq0Ks3OVm/M+G928lODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:37:29.334857Z"},"content_sha256":"a7d5e9fdbd81c6a0c9f6a6e18931166a8c964ae39f2540678f820b7ab78a4f3c","schema_version":"1.0","event_id":"sha256:a7d5e9fdbd81c6a0c9f6a6e18931166a8c964ae39f2540678f820b7ab78a4f3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J27RTUQJHNPJMATESPCOQR5UBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CC","authors_text":"Akitoshi Kawamura, Martin Ziegler","submitted_at":"2018-01-19T07:58:40Z","abstract_excerpt":"While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and efficiency is demonstrated empirically.\n  We advertise REAL COMPLEXITY THEORY: a resource-oriented foundation to rigorous computations over continuous universes such as real numbers, vectors, sequences, continuous functions, and Euclidean subsets: in the bit-model by approximation up to given absolute error. It offers sound semantics (e.g. of comparisons/tests),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07108","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-18T00:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzCJnHuyqWUeK1cizzL7CfHQDKDrLQ02fKKIdi5JXVW2TUZtCKs/KYY55aEJka+qBmds/lDk29wvcRba9XUzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:37:29.335202Z"},"content_sha256":"9c73332a7a65fffa1cd89f4d78776826001338cf22e9ccf749c7db5b207a13fb","schema_version":"1.0","event_id":"sha256:9c73332a7a65fffa1cd89f4d78776826001338cf22e9ccf749c7db5b207a13fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J27RTUQJHNPJMATESPCOQR5UBY/bundle.json","state_url":"https://pith.science/pith/J27RTUQJHNPJMATESPCOQR5UBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J27RTUQJHNPJMATESPCOQR5UBY/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-24T21:37:29Z","links":{"resolver":"https://pith.science/pith/J27RTUQJHNPJMATESPCOQR5UBY","bundle":"https://pith.science/pith/J27RTUQJHNPJMATESPCOQR5UBY/bundle.json","state":"https://pith.science/pith/J27RTUQJHNPJMATESPCOQR5UBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J27RTUQJHNPJMATESPCOQR5UBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J27RTUQJHNPJMATESPCOQR5UBY","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":"2d07d4c1a255f9393e81c5345c7ba0ab5e94f3dbedfc11dd6d9790a40ef48752","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-19T07:58:40Z","title_canon_sha256":"a8909deac4366e7ee723cb22e606f5fa6c668fe13d4a010d6eda9f86331a2446"},"schema_version":"1.0","source":{"id":"1801.07108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07108","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07108v1","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07108","created_at":"2026-05-18T00:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"J27RTUQJHNPJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J27RTUQJHNPJMATE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J27RTUQJ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:9c73332a7a65fffa1cd89f4d78776826001338cf22e9ccf749c7db5b207a13fb","target":"graph","created_at":"2026-05-18T00:25:22Z","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":"While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and efficiency is demonstrated empirically.\n  We advertise REAL COMPLEXITY THEORY: a resource-oriented foundation to rigorous computations over continuous universes such as real numbers, vectors, sequences, continuous functions, and Euclidean subsets: in the bit-model by approximation up to given absolute error. It offers sound semantics (e.g. of comparisons/tests),","authors_text":"Akitoshi Kawamura, Martin Ziegler","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-19T07:58:40Z","title":"Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07108","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:a7d5e9fdbd81c6a0c9f6a6e18931166a8c964ae39f2540678f820b7ab78a4f3c","target":"record","created_at":"2026-05-18T00:25:22Z","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":"2d07d4c1a255f9393e81c5345c7ba0ab5e94f3dbedfc11dd6d9790a40ef48752","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-19T07:58:40Z","title_canon_sha256":"a8909deac4366e7ee723cb22e606f5fa6c668fe13d4a010d6eda9f86331a2446"},"schema_version":"1.0","source":{"id":"1801.07108","kind":"arxiv","version":1}},"canonical_sha256":"4ebf19d2093b5e96026493c4e847b40e2ddcbac7b5902ccbadc90b961ae38f7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ebf19d2093b5e96026493c4e847b40e2ddcbac7b5902ccbadc90b961ae38f7b","first_computed_at":"2026-05-18T00:25:22.229104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:22.229104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gq+LuT9deEi1jpRhVdEb2IhatH4Y1NuP/ryZmGS9I23WGwUvGpEaKEB9MmL/DWG+tAtTGUoBHtiIbjG91NrJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:22.229707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7d5e9fdbd81c6a0c9f6a6e18931166a8c964ae39f2540678f820b7ab78a4f3c","sha256:9c73332a7a65fffa1cd89f4d78776826001338cf22e9ccf749c7db5b207a13fb"],"state_sha256":"7a4c4d2d5555be0b232e518967129241ed18abc0884a1104495483c544a59ccf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02Nm00QbbD8CwA36JMGrVafEE/cOqsQE2vsd7lJIXRhZXDDpBeJDQ4QhWShD3QXp6gWDrVk/OrITM8F/jhMCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:37:29.337243Z","bundle_sha256":"e62d073b2217ca5776568153692a521e7f53f762d0e8843fe92418565e8bf2b1"}}