{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LFAQ5TUIF5SMDLVU6VMEJTOQAC","short_pith_number":"pith:LFAQ5TUI","schema_version":"1.0","canonical_sha256":"59410ece882f64c1aeb4f55844cdd000ba365ba2578e8b61fba9f248cdcfb554","source":{"kind":"arxiv","id":"1509.04321","version":1},"attestation_state":"computed","paper":{"title":"Numerical Methods for the Inverse Nonlinear Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","physics.optics"],"primary_cat":"math.NA","authors_text":"Luigi Barletti, Marco Secondini, Stella Civelli","submitted_at":"2015-08-29T16:51:15Z","abstract_excerpt":"We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the proposed method requires the lowest number of operations"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.04321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-29T16:51:15Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT","physics.optics"],"title_canon_sha256":"a7469de3ccc440b44f5bc49baca0558f50ea3fd32f5dad924e16e5c393639bea","abstract_canon_sha256":"3019aafc5c0a5912a93028062b15f1c91cac4de315332d8337600fc796ac004a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.538296Z","signature_b64":"XGYQx4dA0GMDuo98xFRXRRrgRN36CKdIGB1kiy4fWIsE96NQAy15XizSdcDIYZPaa2J4HG+UGicHHfl06uq4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59410ece882f64c1aeb4f55844cdd000ba365ba2578e8b61fba9f248cdcfb554","last_reissued_at":"2026-05-18T01:26:02.537706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.537706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Methods for the Inverse Nonlinear Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","physics.optics"],"primary_cat":"math.NA","authors_text":"Luigi Barletti, Marco Secondini, Stella Civelli","submitted_at":"2015-08-29T16:51:15Z","abstract_excerpt":"We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the proposed method requires the lowest number of operations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04321","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.04321","created_at":"2026-05-18T01:26:02.537803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04321v1","created_at":"2026-05-18T01:26:02.537803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04321","created_at":"2026-05-18T01:26:02.537803+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFAQ5TUIF5SM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFAQ5TUIF5SMDLVU","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFAQ5TUI","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC","json":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC.json","graph_json":"https://pith.science/api/pith-number/LFAQ5TUIF5SMDLVU6VMEJTOQAC/graph.json","events_json":"https://pith.science/api/pith-number/LFAQ5TUIF5SMDLVU6VMEJTOQAC/events.json","paper":"https://pith.science/paper/LFAQ5TUI"},"agent_actions":{"view_html":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC","download_json":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC.json","view_paper":"https://pith.science/paper/LFAQ5TUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04321&json=true","fetch_graph":"https://pith.science/api/pith-number/LFAQ5TUIF5SMDLVU6VMEJTOQAC/graph.json","fetch_events":"https://pith.science/api/pith-number/LFAQ5TUIF5SMDLVU6VMEJTOQAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC/action/storage_attestation","attest_author":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC/action/author_attestation","sign_citation":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC/action/citation_signature","submit_replication":"https://pith.science/pith/LFAQ5TUIF5SMDLVU6VMEJTOQAC/action/replication_record"}},"created_at":"2026-05-18T01:26:02.537803+00:00","updated_at":"2026-05-18T01:26:02.537803+00:00"}