{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6SAVDTPWMB5T7IGD2YS627GIE7","short_pith_number":"pith:6SAVDTPW","schema_version":"1.0","canonical_sha256":"f48151cdf6607b3fa0c3d625ed7cc827ec1602241a947e9248be37accb6047dc","source":{"kind":"arxiv","id":"2607.26281","version":1},"attestation_state":"computed","paper":{"title":"Concise $(\\varepsilon,r)$-representations of a path","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.PR"],"primary_cat":"math.NA","authors_text":"Emilio Ferrucci, Oliver Perr\\'ee, Terry Lyons","submitted_at":"2026-07-28T21:22:29Z","abstract_excerpt":"Paths $X \\colon [0,T] \\to \\mathbb R^d$ are traditionally stored in finite memory as time series. Recent research has underscored the benefits of instead representing them as collections of iterated integrals $\\{\\int_{0 < u_1 < \\ldots < u_n < T} \\mathrm{d} X_{u_1} \\otimes \\cdots \\otimes \\mathrm{d} X_{u_n}\\}_{n = 0}^N$. These two encodings can be viewed as the extrema on a two-parameter spectrum of representations of the path as degree-$N$ signatures on $m$ intervals in a partition of $[0,T]$. We ask the question of which such representation takes up the least amount of memory, measured as numbe"},"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":"2607.26281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-28T21:22:29Z","cross_cats_sorted":["cs.NA","math.PR"],"title_canon_sha256":"d1bb28ca24d0ee128dc2a85d68b6341f13cd8bbd6231b5e10bb0408f6d151927","abstract_canon_sha256":"2b25e77a1fbfaefd7d6194fbc459b31c6f5ad1eec8ec320fa0a1e18d52988c60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f48151cdf6607b3fa0c3d625ed7cc827ec1602241a947e9248be37accb6047dc","last_reissued_at":"2026-07-30T01:17:54.659538Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:17:54.659538Z"},"graph_snapshot":{"paper":{"title":"Concise $(\\varepsilon,r)$-representations of a path","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.PR"],"primary_cat":"math.NA","authors_text":"Emilio Ferrucci, Oliver Perr\\'ee, Terry Lyons","submitted_at":"2026-07-28T21:22:29Z","abstract_excerpt":"Paths $X \\colon [0,T] \\to \\mathbb R^d$ are traditionally stored in finite memory as time series. Recent research has underscored the benefits of instead representing them as collections of iterated integrals $\\{\\int_{0 < u_1 < \\ldots < u_n < T} \\mathrm{d} X_{u_1} \\otimes \\cdots \\otimes \\mathrm{d} X_{u_n}\\}_{n = 0}^N$. These two encodings can be viewed as the extrema on a two-parameter spectrum of representations of the path as degree-$N$ signatures on $m$ intervals in a partition of $[0,T]$. We ask the question of which such representation takes up the least amount of memory, measured as numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26281","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/2607.26281/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.26281","created_at":"2026-07-30T01:17:54.664748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26281v1","created_at":"2026-07-30T01:17:54.664748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26281","created_at":"2026-07-30T01:17:54.664748+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SAVDTPWMB5T","created_at":"2026-07-30T01:17:54.664748+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SAVDTPWMB5T7IGD","created_at":"2026-07-30T01:17:54.664748+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SAVDTPW","created_at":"2026-07-30T01:17:54.664748+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/6SAVDTPWMB5T7IGD2YS627GIE7","json":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7.json","graph_json":"https://pith.science/api/pith-number/6SAVDTPWMB5T7IGD2YS627GIE7/graph.json","events_json":"https://pith.science/api/pith-number/6SAVDTPWMB5T7IGD2YS627GIE7/events.json","paper":"https://pith.science/paper/6SAVDTPW"},"agent_actions":{"view_html":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7","download_json":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7.json","view_paper":"https://pith.science/paper/6SAVDTPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26281&json=true","fetch_graph":"https://pith.science/api/pith-number/6SAVDTPWMB5T7IGD2YS627GIE7/graph.json","fetch_events":"https://pith.science/api/pith-number/6SAVDTPWMB5T7IGD2YS627GIE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/action/storage_attestation","attest_author":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/action/author_attestation","sign_citation":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/action/citation_signature","submit_replication":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/action/replication_record"}},"created_at":"2026-07-30T01:17:54.664748+00:00","updated_at":"2026-07-30T01:17:54.664748+00:00"}