{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AXJVV5KRLFNN2OHLEYVWUATLLL","short_pith_number":"pith:AXJVV5KR","schema_version":"1.0","canonical_sha256":"05d35af551595add38eb262b6a026b5ad9ef9d977a6f7c21e41e22cce4350b2e","source":{"kind":"arxiv","id":"1209.2759","version":1},"attestation_state":"computed","paper":{"title":"Multi-track Map Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.AP"],"primary_cat":"cs.LG","authors_text":"Adel Javanmard, Li Zhang, Maya Haridasan","submitted_at":"2012-09-13T01:44:12Z","abstract_excerpt":"We study algorithms for matching user tracks, consisting of time-ordered location points, to paths in the road network. Previous work has focused on the scenario where the location data is linearly ordered and consists of fairly dense and regular samples. In this work, we consider the \\emph{multi-track map matching}, where the location data comes from different trips on the same route, each with very sparse samples. This captures the realistic scenario where users repeatedly travel on regular routes and samples are sparsely collected, either due to energy consumption constraints or because sam"},"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":"1209.2759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-13T01:44:12Z","cross_cats_sorted":["cs.DS","stat.AP"],"title_canon_sha256":"39f81b6f1abf6ce823ae0a8544d1536f8ba5e4850ccf1426af7a2457375cc672","abstract_canon_sha256":"5666527dcf24d1ccbc8d380952031e16d58277a87c2e50cbdb0834e22a7b0440"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:41.048633Z","signature_b64":"vigbnR86I4hUJO4d1hR77PooNIpnh33898Joc5xMkS49a4jCH7wsVH08bv4gnQjW0FTF7PcPh+3CfEij1+1XDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05d35af551595add38eb262b6a026b5ad9ef9d977a6f7c21e41e22cce4350b2e","last_reissued_at":"2026-05-18T03:45:41.047898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:41.047898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-track Map Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.AP"],"primary_cat":"cs.LG","authors_text":"Adel Javanmard, Li Zhang, Maya Haridasan","submitted_at":"2012-09-13T01:44:12Z","abstract_excerpt":"We study algorithms for matching user tracks, consisting of time-ordered location points, to paths in the road network. Previous work has focused on the scenario where the location data is linearly ordered and consists of fairly dense and regular samples. In this work, we consider the \\emph{multi-track map matching}, where the location data comes from different trips on the same route, each with very sparse samples. This captures the realistic scenario where users repeatedly travel on regular routes and samples are sparsely collected, either due to energy consumption constraints or because sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2759","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":"1209.2759","created_at":"2026-05-18T03:45:41.047996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2759v1","created_at":"2026-05-18T03:45:41.047996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2759","created_at":"2026-05-18T03:45:41.047996+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXJVV5KRLFNN","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXJVV5KRLFNN2OHL","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXJVV5KR","created_at":"2026-05-18T12:26:58.693483+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/AXJVV5KRLFNN2OHLEYVWUATLLL","json":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL.json","graph_json":"https://pith.science/api/pith-number/AXJVV5KRLFNN2OHLEYVWUATLLL/graph.json","events_json":"https://pith.science/api/pith-number/AXJVV5KRLFNN2OHLEYVWUATLLL/events.json","paper":"https://pith.science/paper/AXJVV5KR"},"agent_actions":{"view_html":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL","download_json":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL.json","view_paper":"https://pith.science/paper/AXJVV5KR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2759&json=true","fetch_graph":"https://pith.science/api/pith-number/AXJVV5KRLFNN2OHLEYVWUATLLL/graph.json","fetch_events":"https://pith.science/api/pith-number/AXJVV5KRLFNN2OHLEYVWUATLLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL/action/storage_attestation","attest_author":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL/action/author_attestation","sign_citation":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL/action/citation_signature","submit_replication":"https://pith.science/pith/AXJVV5KRLFNN2OHLEYVWUATLLL/action/replication_record"}},"created_at":"2026-05-18T03:45:41.047996+00:00","updated_at":"2026-05-18T03:45:41.047996+00:00"}