{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6I7UZSRUOMPVTNLFMPZFCR2BBW","short_pith_number":"pith:6I7UZSRU","schema_version":"1.0","canonical_sha256":"f23f4cca34731f59b56563f25147410da2a5875fa3597882fb395e9c05d538cf","source":{"kind":"arxiv","id":"1907.08423","version":1},"attestation_state":"computed","paper":{"title":"Insertion algorithm for inverting the signature of a path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.PR","authors_text":"Jiawei Chang, Terry Lyons","submitted_at":"2019-07-19T09:26:37Z","abstract_excerpt":"In this article we introduce the insertion method for reconstructing the path from its signature, i.e. inverting the signature of a path. For this purpose, we prove that a converging upper bound exists for the difference between the inserted n-th term and the (n+1)-th term of the normalised signature of a smooth path, and we also show that there exists a constant lower bound for a subsequence of the terms in the normalised signature of a piecewise linear path. We demonstrate our results with numerical examples."},"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":"1907.08423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-07-19T09:26:37Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"64954c5338a2900cada2b672cb8bf380d704509e6894b8cfcad43d70b9094e87","abstract_canon_sha256":"59d8cebd728c27dece6ef029254e5695a3a01c4e6c3ea91a2725806445a83d40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:09.903981Z","signature_b64":"b2wfvhI+JbbtGmW4OCBlXk8IqT6hMS4JIzwnHizbyKOVG8dw9m46xGHJWLN1KLOBzijN6CFkbQhBX8CpMzpUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f23f4cca34731f59b56563f25147410da2a5875fa3597882fb395e9c05d538cf","last_reissued_at":"2026-05-17T23:40:09.903494Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:09.903494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Insertion algorithm for inverting the signature of a path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.PR","authors_text":"Jiawei Chang, Terry Lyons","submitted_at":"2019-07-19T09:26:37Z","abstract_excerpt":"In this article we introduce the insertion method for reconstructing the path from its signature, i.e. inverting the signature of a path. For this purpose, we prove that a converging upper bound exists for the difference between the inserted n-th term and the (n+1)-th term of the normalised signature of a smooth path, and we also show that there exists a constant lower bound for a subsequence of the terms in the normalised signature of a piecewise linear path. We demonstrate our results with numerical examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08423","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":"1907.08423","created_at":"2026-05-17T23:40:09.903563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08423v1","created_at":"2026-05-17T23:40:09.903563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08423","created_at":"2026-05-17T23:40:09.903563+00:00"},{"alias_kind":"pith_short_12","alias_value":"6I7UZSRUOMPV","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6I7UZSRUOMPVTNLF","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6I7UZSRU","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19227","citing_title":"SignatureTensors.jl: A Package for Signature Tensors in Julia","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW","json":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW.json","graph_json":"https://pith.science/api/pith-number/6I7UZSRUOMPVTNLFMPZFCR2BBW/graph.json","events_json":"https://pith.science/api/pith-number/6I7UZSRUOMPVTNLFMPZFCR2BBW/events.json","paper":"https://pith.science/paper/6I7UZSRU"},"agent_actions":{"view_html":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW","download_json":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW.json","view_paper":"https://pith.science/paper/6I7UZSRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08423&json=true","fetch_graph":"https://pith.science/api/pith-number/6I7UZSRUOMPVTNLFMPZFCR2BBW/graph.json","fetch_events":"https://pith.science/api/pith-number/6I7UZSRUOMPVTNLFMPZFCR2BBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW/action/storage_attestation","attest_author":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW/action/author_attestation","sign_citation":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW/action/citation_signature","submit_replication":"https://pith.science/pith/6I7UZSRUOMPVTNLFMPZFCR2BBW/action/replication_record"}},"created_at":"2026-05-17T23:40:09.903563+00:00","updated_at":"2026-05-17T23:40:09.903563+00:00"}