{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5DJQNZOS5ID4ZH53EUULD5S3SA","short_pith_number":"pith:5DJQNZOS","canonical_record":{"source":{"id":"1506.02676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-08T20:08:27Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2fc783b42a44abf0c2abfcd3e739882bcfc2d608e3bb2c9170a27ebeac9d7db8","abstract_canon_sha256":"24a91576b4e64a1706d3d790bd52cb62b1abf661cf6e229364d76d03d8db1fa3"},"schema_version":"1.0"},"canonical_sha256":"e8d306e5d2ea07cc9fbb2528b1f65b903cee4bd101ea6b92cbc78f2c4ee5d55a","source":{"kind":"arxiv","id":"1506.02676","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02676","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02676v3","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02676","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"5DJQNZOS5ID4","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5DJQNZOS5ID4ZH53","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5DJQNZOS","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5DJQNZOS5ID4ZH53EUULD5S3SA","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-08T20:08:27Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2fc783b42a44abf0c2abfcd3e739882bcfc2d608e3bb2c9170a27ebeac9d7db8","abstract_canon_sha256":"24a91576b4e64a1706d3d790bd52cb62b1abf661cf6e229364d76d03d8db1fa3"},"schema_version":"1.0"},"canonical_sha256":"e8d306e5d2ea07cc9fbb2528b1f65b903cee4bd101ea6b92cbc78f2c4ee5d55a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:12.809959Z","signature_b64":"A54GbFrMiy9of1df/57tqyBcn0jeNHbgC63RoWeaPOgy9MdCn49OV/Qwp1gRGGP2AhVXM0k+a6IfiZXAW9YPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8d306e5d2ea07cc9fbb2528b1f65b903cee4bd101ea6b92cbc78f2c4ee5d55a","last_reissued_at":"2026-05-18T01:00:12.809284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:12.809284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02676","source_version":3,"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-05-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aE0et94/6A3d6LyT25y7xGshaY0Ifh0SR6o+RowELrefbG0Ww7XsNolbXsxhoAm1cXBiqKW2IgTzd33CL3DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:56:29.420661Z"},"content_sha256":"5ea8df64290da869bde219c13de13a6b8dcdf5e6fc63aaf98d3aadfa6634396a","schema_version":"1.0","event_id":"sha256:5ea8df64290da869bde219c13de13a6b8dcdf5e6fc63aaf98d3aadfa6634396a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5DJQNZOS5ID4ZH53EUULD5S3SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence and Rates for Fixed-Interval Multiple-Track Smoothing Using $k$-Means Type Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Adam M. Johansen, Matthew Thorpe","submitted_at":"2015-06-08T20:08:27Z","abstract_excerpt":"We address the task of estimating multiple trajectories from unlabeled data. This problem arises in many settings, one could think of the construction of maps of transport networks from passive observation of travellers, or the reconstruction of the behaviour of uncooperative vehicles from external observations, for example. There are two coupled problems. The first is a data association problem: how to map data points onto individual trajectories. The second is, given a solution to the data association problem, to estimate those trajectories. We construct estimators as a solution to a regular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02676","kind":"arxiv","version":3},"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"},"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-05-18T01:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEatUSBPoxwiUtTico1CBcbHHf4yq9waoesguuPbGwgZ8z/2kCuACX2aVJ6AP/szQ7kXkBJN0J5WuWC3a/mTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:56:29.421008Z"},"content_sha256":"9e273637d3630f03399f7ee38ac30fbb4a095bfdb13b8112ae1ee28c7084f1cc","schema_version":"1.0","event_id":"sha256:9e273637d3630f03399f7ee38ac30fbb4a095bfdb13b8112ae1ee28c7084f1cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DJQNZOS5ID4ZH53EUULD5S3SA/bundle.json","state_url":"https://pith.science/pith/5DJQNZOS5ID4ZH53EUULD5S3SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DJQNZOS5ID4ZH53EUULD5S3SA/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-06-03T10:56:29Z","links":{"resolver":"https://pith.science/pith/5DJQNZOS5ID4ZH53EUULD5S3SA","bundle":"https://pith.science/pith/5DJQNZOS5ID4ZH53EUULD5S3SA/bundle.json","state":"https://pith.science/pith/5DJQNZOS5ID4ZH53EUULD5S3SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DJQNZOS5ID4ZH53EUULD5S3SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5DJQNZOS5ID4ZH53EUULD5S3SA","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":"24a91576b4e64a1706d3d790bd52cb62b1abf661cf6e229364d76d03d8db1fa3","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-08T20:08:27Z","title_canon_sha256":"2fc783b42a44abf0c2abfcd3e739882bcfc2d608e3bb2c9170a27ebeac9d7db8"},"schema_version":"1.0","source":{"id":"1506.02676","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02676","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02676v3","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02676","created_at":"2026-05-18T01:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"5DJQNZOS5ID4","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5DJQNZOS5ID4ZH53","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5DJQNZOS","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:9e273637d3630f03399f7ee38ac30fbb4a095bfdb13b8112ae1ee28c7084f1cc","target":"graph","created_at":"2026-05-18T01:00:12Z","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"},"paper":{"abstract_excerpt":"We address the task of estimating multiple trajectories from unlabeled data. This problem arises in many settings, one could think of the construction of maps of transport networks from passive observation of travellers, or the reconstruction of the behaviour of uncooperative vehicles from external observations, for example. There are two coupled problems. The first is a data association problem: how to map data points onto individual trajectories. The second is, given a solution to the data association problem, to estimate those trajectories. We construct estimators as a solution to a regular","authors_text":"Adam M. Johansen, Matthew Thorpe","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-08T20:08:27Z","title":"Convergence and Rates for Fixed-Interval Multiple-Track Smoothing Using $k$-Means Type Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02676","kind":"arxiv","version":3},"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:5ea8df64290da869bde219c13de13a6b8dcdf5e6fc63aaf98d3aadfa6634396a","target":"record","created_at":"2026-05-18T01:00:12Z","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":"24a91576b4e64a1706d3d790bd52cb62b1abf661cf6e229364d76d03d8db1fa3","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-08T20:08:27Z","title_canon_sha256":"2fc783b42a44abf0c2abfcd3e739882bcfc2d608e3bb2c9170a27ebeac9d7db8"},"schema_version":"1.0","source":{"id":"1506.02676","kind":"arxiv","version":3}},"canonical_sha256":"e8d306e5d2ea07cc9fbb2528b1f65b903cee4bd101ea6b92cbc78f2c4ee5d55a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8d306e5d2ea07cc9fbb2528b1f65b903cee4bd101ea6b92cbc78f2c4ee5d55a","first_computed_at":"2026-05-18T01:00:12.809284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:12.809284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A54GbFrMiy9of1df/57tqyBcn0jeNHbgC63RoWeaPOgy9MdCn49OV/Qwp1gRGGP2AhVXM0k+a6IfiZXAW9YPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:12.809959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02676","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ea8df64290da869bde219c13de13a6b8dcdf5e6fc63aaf98d3aadfa6634396a","sha256:9e273637d3630f03399f7ee38ac30fbb4a095bfdb13b8112ae1ee28c7084f1cc"],"state_sha256":"e228d03d72e174d1a4d429d80c72e7c8f4bfa8f437b26f39319609121b1af6b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmZep93KVdS2jg4caSB/DU8jWmIX1bs7yICZHpoY7ufkePp6RJKJ1bvybowCm3f9ekiVDTh58uc6sCgcmfLxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:56:29.423041Z","bundle_sha256":"9517e705d31060ce77ac9fdf0eda0385d00495030985e0017dc84c32c4148b21"}}