{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BG32LHTLFT24TZGFW5GEICE7SF","short_pith_number":"pith:BG32LHTL","canonical_record":{"source":{"id":"2512.14218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-12-16T09:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"7971579ea0dfa138516384d5931ad24a7c0a2020c17a533f543849f6effafb49","abstract_canon_sha256":"110b32128bd0c2fa2511f5ca1d92c7d608d75611052175334b3a191e6d30f7cd"},"schema_version":"1.0"},"canonical_sha256":"09b7a59e6b2cf5c9e4c5b74c44089f915289ca1e9e1db6969a32a71ab851c81a","source":{"kind":"arxiv","id":"2512.14218","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.14218","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2512.14218v2","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.14218","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"BG32LHTLFT24","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"BG32LHTLFT24TZGF","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"BG32LHTL","created_at":"2026-06-19T16:11:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BG32LHTLFT24TZGFW5GEICE7SF","target":"record","payload":{"canonical_record":{"source":{"id":"2512.14218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-12-16T09:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"7971579ea0dfa138516384d5931ad24a7c0a2020c17a533f543849f6effafb49","abstract_canon_sha256":"110b32128bd0c2fa2511f5ca1d92c7d608d75611052175334b3a191e6d30f7cd"},"schema_version":"1.0"},"canonical_sha256":"09b7a59e6b2cf5c9e4c5b74c44089f915289ca1e9e1db6969a32a71ab851c81a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:18.505061Z","signature_b64":"pY/x0lymWwXX9uD4xRVv1kMz+QIe3KWruob7Gx1abFTexBnR/jiDrJk7M9JYcQVzhGkN1IfINLzy1feds1x1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09b7a59e6b2cf5c9e4c5b74c44089f915289ca1e9e1db6969a32a71ab851c81a","last_reissued_at":"2026-06-19T16:11:18.504623Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:18.504623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.14218","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-19T16:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fttC/zpT6xvhmgkQAiIwc/zjxs1Gfqx9hCCuTWf61nApLX2XNsaSIKi6AfD4fYa1H458sYPZwmzdrpMc/8YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:38:01.421743Z"},"content_sha256":"318e3f6c01b020c54ed6730c28cb91d817a1e075c5f6de9f491f92aaf3966cac","schema_version":"1.0","event_id":"sha256:318e3f6c01b020c54ed6730c28cb91d817a1e075c5f6de9f491f92aaf3966cac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BG32LHTLFT24TZGFW5GEICE7SF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Path Recovery from Signature Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Leonard Schmitz","submitted_at":"2025-12-16T09:11:48Z","abstract_excerpt":"We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this recovery problem and improves upon current approaches by an order of magnitude. It relies on generalized normal forms and stabilizers of group actions via matrix-tensor congruence. We apply randomized transformation techniques that avoid the task of solving nonlinear polynomial systems associated to degenerate paths, and accompany our methods with an efficient implementation in the computer algebra system OSCAR."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.14218","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/2512.14218/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-19T16:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjtzvFLGwY6jNqILZTopQcFTLbsaCoCme7Z0FKGDan0LbQ0oMoixwRQ3j4mx+ce10biO8S1Kl5PWPVZtI01+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T06:38:01.422472Z"},"content_sha256":"7e9f0be0dcfbfc2985ded6b5ce7f256f85b0809d385b5ecb2f9f7bb7b88fcb21","schema_version":"1.0","event_id":"sha256:7e9f0be0dcfbfc2985ded6b5ce7f256f85b0809d385b5ecb2f9f7bb7b88fcb21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BG32LHTLFT24TZGFW5GEICE7SF/bundle.json","state_url":"https://pith.science/pith/BG32LHTLFT24TZGFW5GEICE7SF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BG32LHTLFT24TZGFW5GEICE7SF/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-13T06:38:01Z","links":{"resolver":"https://pith.science/pith/BG32LHTLFT24TZGFW5GEICE7SF","bundle":"https://pith.science/pith/BG32LHTLFT24TZGFW5GEICE7SF/bundle.json","state":"https://pith.science/pith/BG32LHTLFT24TZGFW5GEICE7SF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BG32LHTLFT24TZGFW5GEICE7SF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BG32LHTLFT24TZGFW5GEICE7SF","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":"110b32128bd0c2fa2511f5ca1d92c7d608d75611052175334b3a191e6d30f7cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-12-16T09:11:48Z","title_canon_sha256":"7971579ea0dfa138516384d5931ad24a7c0a2020c17a533f543849f6effafb49"},"schema_version":"1.0","source":{"id":"2512.14218","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.14218","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2512.14218v2","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.14218","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"BG32LHTLFT24","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"BG32LHTLFT24TZGF","created_at":"2026-06-19T16:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"BG32LHTL","created_at":"2026-06-19T16:11:18Z"}],"graph_snapshots":[{"event_id":"sha256:7e9f0be0dcfbfc2985ded6b5ce7f256f85b0809d385b5ecb2f9f7bb7b88fcb21","target":"graph","created_at":"2026-06-19T16:11:18Z","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/2512.14218/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this recovery problem and improves upon current approaches by an order of magnitude. It relies on generalized normal forms and stabilizers of group actions via matrix-tensor congruence. We apply randomized transformation techniques that avoid the task of solving nonlinear polynomial systems associated to degenerate paths, and accompany our methods with an efficient implementation in the computer algebra system OSCAR.","authors_text":"Leonard Schmitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-12-16T09:11:48Z","title":"An Efficient Algorithm for Path Recovery from Signature Tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.14218","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:318e3f6c01b020c54ed6730c28cb91d817a1e075c5f6de9f491f92aaf3966cac","target":"record","created_at":"2026-06-19T16:11:18Z","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":"110b32128bd0c2fa2511f5ca1d92c7d608d75611052175334b3a191e6d30f7cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2025-12-16T09:11:48Z","title_canon_sha256":"7971579ea0dfa138516384d5931ad24a7c0a2020c17a533f543849f6effafb49"},"schema_version":"1.0","source":{"id":"2512.14218","kind":"arxiv","version":2}},"canonical_sha256":"09b7a59e6b2cf5c9e4c5b74c44089f915289ca1e9e1db6969a32a71ab851c81a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09b7a59e6b2cf5c9e4c5b74c44089f915289ca1e9e1db6969a32a71ab851c81a","first_computed_at":"2026-06-19T16:11:18.504623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:18.504623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pY/x0lymWwXX9uD4xRVv1kMz+QIe3KWruob7Gx1abFTexBnR/jiDrJk7M9JYcQVzhGkN1IfINLzy1feds1x1AA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:18.505061Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.14218","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:318e3f6c01b020c54ed6730c28cb91d817a1e075c5f6de9f491f92aaf3966cac","sha256:7e9f0be0dcfbfc2985ded6b5ce7f256f85b0809d385b5ecb2f9f7bb7b88fcb21"],"state_sha256":"b4de4d2ac2ca482e7484ae20917c7355ab8b44aec13faf3e9b797543bd1feca8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bHxz8l8f1L5R4UeH4c5R/Qj9VTGZZHZhM26M25ahDU8v4T+b9ZV+bRHsqzKIp+EyDxxbgKOsgh6SGq39qeQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T06:38:01.431384Z","bundle_sha256":"bf448fc6051b1dcc84f7745cf95762c8787a80fda7960d37b90406aca60b2d62"}}