{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:QFBRK2QHBE2FUPQJJ6RSC2KUGC","short_pith_number":"pith:QFBRK2QH","canonical_record":{"source":{"id":"math/0510516","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2005-10-24T22:21:01Z","cross_cats_sorted":["cs.NA","math.CV"],"title_canon_sha256":"b2d44ec7689c29849b557f99278a578d95e4f1bb6d51c21109a21d50b712c3a5","abstract_canon_sha256":"c241ba30886dfb29ea8a1a5b4d0889a413e039d51f400f110f5ff9fe418cbc35"},"schema_version":"1.0"},"canonical_sha256":"8143156a0709345a3e094fa321695430ba68f5e360f73ace0873731555f3f420","source":{"kind":"arxiv","id":"math/0510516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0510516","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"math/0510516v1","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0510516","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"QFBRK2QHBE2F","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"QFBRK2QHBE2FUPQJ","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"QFBRK2QH","created_at":"2026-06-03T22:06:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:QFBRK2QHBE2FUPQJJ6RSC2KUGC","target":"record","payload":{"canonical_record":{"source":{"id":"math/0510516","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2005-10-24T22:21:01Z","cross_cats_sorted":["cs.NA","math.CV"],"title_canon_sha256":"b2d44ec7689c29849b557f99278a578d95e4f1bb6d51c21109a21d50b712c3a5","abstract_canon_sha256":"c241ba30886dfb29ea8a1a5b4d0889a413e039d51f400f110f5ff9fe418cbc35"},"schema_version":"1.0"},"canonical_sha256":"8143156a0709345a3e094fa321695430ba68f5e360f73ace0873731555f3f420","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:18.280863Z","signature_b64":"no7aL9qPbXEikYH4zE/khTJXGBOiAZQy5B6TZ6ABAVkrnI0rr6t2X4VTWaVGN9IIJ9WRtiixzrBJvP/qABQJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8143156a0709345a3e094fa321695430ba68f5e360f73ace0873731555f3f420","last_reissued_at":"2026-06-03T22:06:18.280481Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:18.280481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0510516","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-06-03T22:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Set8qmLYGAeL2cdj5N03zBzjydqv0rK33sTubuzicZHOXblJ4l6vkYzaGcFP0PqfhULi3HbmFTgY3YmM2OhWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:55:11.729324Z"},"content_sha256":"a963945d829dde8ec11b571f512c49b9ffb18ecc6d620b60c358ed2c83cd61f6","schema_version":"1.0","event_id":"sha256:a963945d829dde8ec11b571f512c49b9ffb18ecc6d620b60c358ed2c83cd61f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:QFBRK2QHBE2FUPQJJ6RSC2KUGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Numerical Algorithms for the Solution of a Beltrami Equation","license":"","headline":"","cross_cats":["cs.NA","math.CV"],"primary_cat":"math.NA","authors_text":"Denis Gaydashev, Dmitry Khmelev","submitted_at":"2005-10-24T22:21:01Z","abstract_excerpt":"The paper concerns numerical algorithms for solving the Beltrami equation $f_{\\bar{z}}(z)=\\mu(z) f_z(z)$ for a compactly supported $\\mu$. First, we study an efficient algorithm that has been proposed in the literature, and present its rigorous justification. We then propose a different scheme for solving the Beltrami equation which has a comparable speed and accuracy, but has the virtue of a greater simplicity of implementation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0510516","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/math/0510516/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"},"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-06-03T22:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQ6wmjxYi7otbr5n5qa4+6Cp+ZIhTmWHzK+bxgUb+eG4HiuR6pNV/OKIeD/VnN8wK0ec21jRXWrBwv9HenXoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:55:11.729699Z"},"content_sha256":"1091774a0df03822032d7715e550d7a30f78f5c7ca1fa8bff036955fcad4a317","schema_version":"1.0","event_id":"sha256:1091774a0df03822032d7715e550d7a30f78f5c7ca1fa8bff036955fcad4a317"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFBRK2QHBE2FUPQJJ6RSC2KUGC/bundle.json","state_url":"https://pith.science/pith/QFBRK2QHBE2FUPQJJ6RSC2KUGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFBRK2QHBE2FUPQJJ6RSC2KUGC/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-27T10:55:11Z","links":{"resolver":"https://pith.science/pith/QFBRK2QHBE2FUPQJJ6RSC2KUGC","bundle":"https://pith.science/pith/QFBRK2QHBE2FUPQJJ6RSC2KUGC/bundle.json","state":"https://pith.science/pith/QFBRK2QHBE2FUPQJJ6RSC2KUGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFBRK2QHBE2FUPQJJ6RSC2KUGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:QFBRK2QHBE2FUPQJJ6RSC2KUGC","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":"c241ba30886dfb29ea8a1a5b4d0889a413e039d51f400f110f5ff9fe418cbc35","cross_cats_sorted":["cs.NA","math.CV"],"license":"","primary_cat":"math.NA","submitted_at":"2005-10-24T22:21:01Z","title_canon_sha256":"b2d44ec7689c29849b557f99278a578d95e4f1bb6d51c21109a21d50b712c3a5"},"schema_version":"1.0","source":{"id":"math/0510516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0510516","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"math/0510516v1","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0510516","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"QFBRK2QHBE2F","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"QFBRK2QHBE2FUPQJ","created_at":"2026-06-03T22:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"QFBRK2QH","created_at":"2026-06-03T22:06:18Z"}],"graph_snapshots":[{"event_id":"sha256:1091774a0df03822032d7715e550d7a30f78f5c7ca1fa8bff036955fcad4a317","target":"graph","created_at":"2026-06-03T22:06:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0510516/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The paper concerns numerical algorithms for solving the Beltrami equation $f_{\\bar{z}}(z)=\\mu(z) f_z(z)$ for a compactly supported $\\mu$. First, we study an efficient algorithm that has been proposed in the literature, and present its rigorous justification. We then propose a different scheme for solving the Beltrami equation which has a comparable speed and accuracy, but has the virtue of a greater simplicity of implementation.","authors_text":"Denis Gaydashev, Dmitry Khmelev","cross_cats":["cs.NA","math.CV"],"headline":"","license":"","primary_cat":"math.NA","submitted_at":"2005-10-24T22:21:01Z","title":"On Numerical Algorithms for the Solution of a Beltrami Equation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0510516","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:a963945d829dde8ec11b571f512c49b9ffb18ecc6d620b60c358ed2c83cd61f6","target":"record","created_at":"2026-06-03T22:06:18Z","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":"c241ba30886dfb29ea8a1a5b4d0889a413e039d51f400f110f5ff9fe418cbc35","cross_cats_sorted":["cs.NA","math.CV"],"license":"","primary_cat":"math.NA","submitted_at":"2005-10-24T22:21:01Z","title_canon_sha256":"b2d44ec7689c29849b557f99278a578d95e4f1bb6d51c21109a21d50b712c3a5"},"schema_version":"1.0","source":{"id":"math/0510516","kind":"arxiv","version":1}},"canonical_sha256":"8143156a0709345a3e094fa321695430ba68f5e360f73ace0873731555f3f420","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8143156a0709345a3e094fa321695430ba68f5e360f73ace0873731555f3f420","first_computed_at":"2026-06-03T22:06:18.280481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:18.280481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"no7aL9qPbXEikYH4zE/khTJXGBOiAZQy5B6TZ6ABAVkrnI0rr6t2X4VTWaVGN9IIJ9WRtiixzrBJvP/qABQJDg==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:18.280863Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0510516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a963945d829dde8ec11b571f512c49b9ffb18ecc6d620b60c358ed2c83cd61f6","sha256:1091774a0df03822032d7715e550d7a30f78f5c7ca1fa8bff036955fcad4a317"],"state_sha256":"0a91c0e348ea5a8ad9249286d0fb8e303b51e4322e6acb6281ecd737a7536d23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANBOAQnSnm01eOhbZBTaXPSayhYPWmrTllMkcN41rFQvUzi7engxLrIoNzBl/oRRci4+jFrHxv81OygXH7o5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:55:11.731549Z","bundle_sha256":"7823e8478f675a03e613f7c3f5bd2f6c311489b7eaf706c51cc07f04878515d0"}}