{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6SAVDTPWMB5T7IGD2YS627GIE7","short_pith_number":"pith:6SAVDTPW","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"},"canonical_sha256":"f48151cdf6607b3fa0c3d625ed7cc827ec1602241a947e9248be37accb6047dc","source":{"kind":"arxiv","id":"2607.26281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26281","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26281v1","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26281","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"6SAVDTPWMB5T","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"6SAVDTPWMB5T7IGD","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"6SAVDTPW","created_at":"2026-07-30T01:17:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6SAVDTPWMB5T7IGD2YS627GIE7","target":"record","payload":{"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"},"canonical_sha256":"f48151cdf6607b3fa0c3d625ed7cc827ec1602241a947e9248be37accb6047dc","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"},"source_kind":"arxiv","source_id":"2607.26281","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-07-30T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSLUmUpd4Pdr5xZ6Lonix0Ip9FWJOT8HZF4IpuVPCTYkAE/ZOFDKOe3Z3fxXG1Q7HivqDOwuj3iqPamvtzmZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:03:18.387350Z"},"content_sha256":"8e13a183ee1cb7b7ea0f049cbf4041bf34b7498a6d46122cd945156aec0335fe","schema_version":"1.0","event_id":"sha256:8e13a183ee1cb7b7ea0f049cbf4041bf34b7498a6d46122cd945156aec0335fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6SAVDTPWMB5T7IGD2YS627GIE7","target":"graph","payload":{"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"},"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-07-30T01:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GV3yi89QeWMkV6lZkMe/iMzMA9Id79jITmwCY6jWx8B1xcyGD8g1KiD7TQ7nNnW5/erg7+OMD8j4M93wrYTgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:03:18.388002Z"},"content_sha256":"4d58125b0489abffb52a460d5055a4ca1de5697d8e4b54d40ce5ee4e0358e859","schema_version":"1.0","event_id":"sha256:4d58125b0489abffb52a460d5055a4ca1de5697d8e4b54d40ce5ee4e0358e859"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/bundle.json","state_url":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SAVDTPWMB5T7IGD2YS627GIE7/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-08-04T17:03:18Z","links":{"resolver":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7","bundle":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/bundle.json","state":"https://pith.science/pith/6SAVDTPWMB5T7IGD2YS627GIE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SAVDTPWMB5T7IGD2YS627GIE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6SAVDTPWMB5T7IGD2YS627GIE7","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":"2b25e77a1fbfaefd7d6194fbc459b31c6f5ad1eec8ec320fa0a1e18d52988c60","cross_cats_sorted":["cs.NA","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-28T21:22:29Z","title_canon_sha256":"d1bb28ca24d0ee128dc2a85d68b6341f13cd8bbd6231b5e10bb0408f6d151927"},"schema_version":"1.0","source":{"id":"2607.26281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26281","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26281v1","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26281","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"6SAVDTPWMB5T","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"6SAVDTPWMB5T7IGD","created_at":"2026-07-30T01:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"6SAVDTPW","created_at":"2026-07-30T01:17:54Z"}],"graph_snapshots":[{"event_id":"sha256:4d58125b0489abffb52a460d5055a4ca1de5697d8e4b54d40ce5ee4e0358e859","target":"graph","created_at":"2026-07-30T01:17:54Z","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/2607.26281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Emilio Ferrucci, Oliver Perr\\'ee, Terry Lyons","cross_cats":["cs.NA","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-28T21:22:29Z","title":"Concise $(\\varepsilon,r)$-representations of a path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26281","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:8e13a183ee1cb7b7ea0f049cbf4041bf34b7498a6d46122cd945156aec0335fe","target":"record","created_at":"2026-07-30T01:17:54Z","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":"2b25e77a1fbfaefd7d6194fbc459b31c6f5ad1eec8ec320fa0a1e18d52988c60","cross_cats_sorted":["cs.NA","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-28T21:22:29Z","title_canon_sha256":"d1bb28ca24d0ee128dc2a85d68b6341f13cd8bbd6231b5e10bb0408f6d151927"},"schema_version":"1.0","source":{"id":"2607.26281","kind":"arxiv","version":1}},"canonical_sha256":"f48151cdf6607b3fa0c3d625ed7cc827ec1602241a947e9248be37accb6047dc","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f48151cdf6607b3fa0c3d625ed7cc827ec1602241a947e9248be37accb6047dc","first_computed_at":"2026-07-30T01:17:54.659538Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:17:54.659538Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e13a183ee1cb7b7ea0f049cbf4041bf34b7498a6d46122cd945156aec0335fe","sha256:4d58125b0489abffb52a460d5055a4ca1de5697d8e4b54d40ce5ee4e0358e859"],"state_sha256":"2d39c46130eab6d0894f709ff56b48392026a4e63bbc5ad17db716ef32971356"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5eLhtXIUYrRnNxg4Bp5ghEI5EMORHZbpwbF38r+yesx2vkL6uzk4E5m4Xy1hoFEeHejwIOyxl9O+oZBdD7oDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:03:18.393346Z","bundle_sha256":"05c4987783482252852c2e68d1d94501a953f8857c8ad9da284d66cee62cbaaf"}}