{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:IJKDSCHRUMCNAADMUPXGS762ZG","short_pith_number":"pith:IJKDSCHR","canonical_record":{"source":{"id":"math/0502407","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2005-02-18T20:10:18Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6a8c0b9eafa16b1fe00ff47f6f6bad2fbc71dad3bdaff6543e8a720b694c5d3b","abstract_canon_sha256":"2821b69da4b347570c573f07f5ca3b52fb3e0fc354c63035f3e3aa18473ab0cc"},"schema_version":"1.0"},"canonical_sha256":"42543908f1a304d0006ca3ee697fdac9a759721349730b32c3e2435bf29e87ee","source":{"kind":"arxiv","id":"math/0502407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0502407","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"math/0502407v2","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0502407","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"IJKDSCHRUMCN","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"IJKDSCHRUMCNAADM","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"IJKDSCHR","created_at":"2026-06-03T22:06:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:IJKDSCHRUMCNAADMUPXGS762ZG","target":"record","payload":{"canonical_record":{"source":{"id":"math/0502407","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2005-02-18T20:10:18Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6a8c0b9eafa16b1fe00ff47f6f6bad2fbc71dad3bdaff6543e8a720b694c5d3b","abstract_canon_sha256":"2821b69da4b347570c573f07f5ca3b52fb3e0fc354c63035f3e3aa18473ab0cc"},"schema_version":"1.0"},"canonical_sha256":"42543908f1a304d0006ca3ee697fdac9a759721349730b32c3e2435bf29e87ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:16.416829Z","signature_b64":"ZTMZIuYSJo9JcAS7xhba35MWF+0biFN7w4oZzyT9Hbepyj+zzqljd9bopjtY6tT7LAayetaanDNdaY4z0oc3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42543908f1a304d0006ca3ee697fdac9a759721349730b32c3e2435bf29e87ee","last_reissued_at":"2026-06-03T22:06:16.416400Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:16.416400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0502407","source_version":2,"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:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPLrRYAC32LgL08aqtb7wtG0/gL1RkfjJ+CtihB4AD03P9wB/TSI1OcXy6oUtcRbLz0+tVVDOZ6c3uds+868AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:27:41.725464Z"},"content_sha256":"0d8f3f0310040a3cb4c00704296a894f5fa128bf82b6c46fd3c9b71a851a7524","schema_version":"1.0","event_id":"sha256:0d8f3f0310040a3cb4c00704296a894f5fa128bf82b6c46fd3c9b71a851a7524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:IJKDSCHRUMCNAADMUPXGS762ZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Least Squares Functional for Solving Inverse Sturm-Liouville Problems","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Norbert Roehrl","submitted_at":"2005-02-18T20:10:18Z","abstract_excerpt":"We present a variational algorithm for solving the classical inverse Sturm-Liouville problem in one dimension when two spectra are given. All critical points of the least squares functional are at global minima, which which suggests minimization by a (conjugate) gradient descent algorithm. Numerical examples show that the resulting algorithm works quite reliable without tuning for particular cases, even in the presence of noise. With the right choice of parameters the minimization procedure converges very quickly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0502407","kind":"arxiv","version":2},"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/0502407/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:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFaWR2eM9ksjXs/islglB4+7pqlm0wP8ySjXTJxNZ9x6XPkOBho9SF+z7aJW+kpqPSfzIsodfVPru70OrOu9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:27:41.726158Z"},"content_sha256":"fcdd3bcde16a1e4b11881ce205bb9b8277ff66ac25d405951ff01537f42c4e82","schema_version":"1.0","event_id":"sha256:fcdd3bcde16a1e4b11881ce205bb9b8277ff66ac25d405951ff01537f42c4e82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJKDSCHRUMCNAADMUPXGS762ZG/bundle.json","state_url":"https://pith.science/pith/IJKDSCHRUMCNAADMUPXGS762ZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJKDSCHRUMCNAADMUPXGS762ZG/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-04T05:27:41Z","links":{"resolver":"https://pith.science/pith/IJKDSCHRUMCNAADMUPXGS762ZG","bundle":"https://pith.science/pith/IJKDSCHRUMCNAADMUPXGS762ZG/bundle.json","state":"https://pith.science/pith/IJKDSCHRUMCNAADMUPXGS762ZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJKDSCHRUMCNAADMUPXGS762ZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:IJKDSCHRUMCNAADMUPXGS762ZG","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":"2821b69da4b347570c573f07f5ca3b52fb3e0fc354c63035f3e3aa18473ab0cc","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2005-02-18T20:10:18Z","title_canon_sha256":"6a8c0b9eafa16b1fe00ff47f6f6bad2fbc71dad3bdaff6543e8a720b694c5d3b"},"schema_version":"1.0","source":{"id":"math/0502407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0502407","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"math/0502407v2","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0502407","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"IJKDSCHRUMCN","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"IJKDSCHRUMCNAADM","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"IJKDSCHR","created_at":"2026-06-03T22:06:16Z"}],"graph_snapshots":[{"event_id":"sha256:fcdd3bcde16a1e4b11881ce205bb9b8277ff66ac25d405951ff01537f42c4e82","target":"graph","created_at":"2026-06-03T22:06:16Z","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/0502407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a variational algorithm for solving the classical inverse Sturm-Liouville problem in one dimension when two spectra are given. All critical points of the least squares functional are at global minima, which which suggests minimization by a (conjugate) gradient descent algorithm. Numerical examples show that the resulting algorithm works quite reliable without tuning for particular cases, even in the presence of noise. With the right choice of parameters the minimization procedure converges very quickly.","authors_text":"Norbert Roehrl","cross_cats":["cs.NA"],"headline":"","license":"","primary_cat":"math.NA","submitted_at":"2005-02-18T20:10:18Z","title":"A Least Squares Functional for Solving Inverse Sturm-Liouville Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0502407","kind":"arxiv","version":2},"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:0d8f3f0310040a3cb4c00704296a894f5fa128bf82b6c46fd3c9b71a851a7524","target":"record","created_at":"2026-06-03T22:06:16Z","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":"2821b69da4b347570c573f07f5ca3b52fb3e0fc354c63035f3e3aa18473ab0cc","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2005-02-18T20:10:18Z","title_canon_sha256":"6a8c0b9eafa16b1fe00ff47f6f6bad2fbc71dad3bdaff6543e8a720b694c5d3b"},"schema_version":"1.0","source":{"id":"math/0502407","kind":"arxiv","version":2}},"canonical_sha256":"42543908f1a304d0006ca3ee697fdac9a759721349730b32c3e2435bf29e87ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42543908f1a304d0006ca3ee697fdac9a759721349730b32c3e2435bf29e87ee","first_computed_at":"2026-06-03T22:06:16.416400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:16.416400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZTMZIuYSJo9JcAS7xhba35MWF+0biFN7w4oZzyT9Hbepyj+zzqljd9bopjtY6tT7LAayetaanDNdaY4z0oc3Dw==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:16.416829Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0502407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d8f3f0310040a3cb4c00704296a894f5fa128bf82b6c46fd3c9b71a851a7524","sha256:fcdd3bcde16a1e4b11881ce205bb9b8277ff66ac25d405951ff01537f42c4e82"],"state_sha256":"3a4f7f31897bee7046448d73312fb157ee1ed4d510292d98fc7b70db93d584df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9J66a5+eWKSKUtkhmk35KkW/9aVUdEhEUFP7dH7fMQy5X3nf+I+bc194RKAumNl1Bkd169/9idDUowVl8kS3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:27:41.729366Z","bundle_sha256":"e12ecf3a18f9ba700f22db77637d1f106a3006db8790e36264d4f9d6e8bac995"}}