{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K2YFXEQV6LPQNRBTXMC2BG5TGV","short_pith_number":"pith:K2YFXEQV","schema_version":"1.0","canonical_sha256":"56b05b9215f2df06c433bb05a09bb33569f2fd82f5960bdc8ab8793c6f7f3158","source":{"kind":"arxiv","id":"1501.01822","version":1},"attestation_state":"computed","paper":{"title":"Central Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Maarten Loffler, Marc van Kreveld","submitted_at":"2015-01-08T12:57:57Z","abstract_excerpt":"An important task in trajectory analysis is clustering. The results of a clustering are often summarized by a single representative trajectory and an associated size of each cluster. We study the problem of computing a suitable representative of a set of similar trajectories. To this end we define a central trajectory $\\mathcal{C}$, which consists of pieces of the input trajectories, switches from one entity to another only if they are within a small distance of each other, and such that at any time $t$, the point $\\mathcal{C}(t)$ is as central as possible. We measure centrality in terms of th"},"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":"1501.01822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-08T12:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"cc6085b4914d10dfffd97f22a4c3d9609d8c7b6b31184bb6b46597bfda335fdb","abstract_canon_sha256":"6fef5761a7c51b331ce01850e8ad9039b0aca5778bf1f37f5213d9da46ca4031"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:46.323617Z","signature_b64":"5tufc3OWuWsUDiAj3IFcqZw2zgOQZdKyr4U+kiuNSIEMo+G5jVHRaXpz4C3cNCT5L05YeiwuXfTFupYVkhI+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56b05b9215f2df06c433bb05a09bb33569f2fd82f5960bdc8ab8793c6f7f3158","last_reissued_at":"2026-05-18T02:29:46.323157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:46.323157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Central Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Maarten Loffler, Marc van Kreveld","submitted_at":"2015-01-08T12:57:57Z","abstract_excerpt":"An important task in trajectory analysis is clustering. The results of a clustering are often summarized by a single representative trajectory and an associated size of each cluster. We study the problem of computing a suitable representative of a set of similar trajectories. To this end we define a central trajectory $\\mathcal{C}$, which consists of pieces of the input trajectories, switches from one entity to another only if they are within a small distance of each other, and such that at any time $t$, the point $\\mathcal{C}(t)$ is as central as possible. We measure centrality in terms of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01822","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":"1501.01822","created_at":"2026-05-18T02:29:46.323221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01822v1","created_at":"2026-05-18T02:29:46.323221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01822","created_at":"2026-05-18T02:29:46.323221+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2YFXEQV6LPQ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2YFXEQV6LPQNRBT","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2YFXEQV","created_at":"2026-05-18T12:29:27.538025+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/K2YFXEQV6LPQNRBTXMC2BG5TGV","json":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV.json","graph_json":"https://pith.science/api/pith-number/K2YFXEQV6LPQNRBTXMC2BG5TGV/graph.json","events_json":"https://pith.science/api/pith-number/K2YFXEQV6LPQNRBTXMC2BG5TGV/events.json","paper":"https://pith.science/paper/K2YFXEQV"},"agent_actions":{"view_html":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV","download_json":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV.json","view_paper":"https://pith.science/paper/K2YFXEQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01822&json=true","fetch_graph":"https://pith.science/api/pith-number/K2YFXEQV6LPQNRBTXMC2BG5TGV/graph.json","fetch_events":"https://pith.science/api/pith-number/K2YFXEQV6LPQNRBTXMC2BG5TGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV/action/storage_attestation","attest_author":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV/action/author_attestation","sign_citation":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV/action/citation_signature","submit_replication":"https://pith.science/pith/K2YFXEQV6LPQNRBTXMC2BG5TGV/action/replication_record"}},"created_at":"2026-05-18T02:29:46.323221+00:00","updated_at":"2026-05-18T02:29:46.323221+00:00"}