{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A2LVNTSA3SZCNFWM63MRDZR3A5","short_pith_number":"pith:A2LVNTSA","schema_version":"1.0","canonical_sha256":"069756ce40dcb22696ccf6d911e63b0763a1fdf9b6ab8d2e393299085bbe38f3","source":{"kind":"arxiv","id":"1412.0321","version":2},"attestation_state":"computed","paper":{"title":"Bounded Quadrant System: Error-bounded Trajectory Compression on the Go","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Brano Kusy, Jiajun Liu, Kun Zhao, Philipp Sommer, Raja Jurdak, Shuo Shang","submitted_at":"2014-12-01T01:14:42Z","abstract_excerpt":"Long-term location tracking, where trajectory compression is commonly used, has gained high interest for many applications in transport, ecology, and wearable computing. However, state-of-the-art compression methods involve high space-time complexity or achieve unsatisfactory compression rate, leading to rapid exhaustion of memory, computation, storage and energy resources. We propose a novel online algorithm for error-bounded trajectory compression called the Bounded Quadrant System (BQS), which compresses trajectories with extremely small costs in space and time using convex-hulls. In this a"},"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":"1412.0321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-01T01:14:42Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"100962d9b6bd225582fb73ce2d6ea6e56ee5d7e052be53e72a043da85cbdd7e9","abstract_canon_sha256":"0131256575fb12f60ecc8994007e04b125dc8cc60a04f33b1ee2dc9dd4a508c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:58.893443Z","signature_b64":"V7WprnxUT+wJ+4cXzcGVTPx0iVkLEt21BjBO2Ab5r/Bqmu+zyPgELww0tJEaHnAXMHD9YDY29G87kle0N0FxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"069756ce40dcb22696ccf6d911e63b0763a1fdf9b6ab8d2e393299085bbe38f3","last_reissued_at":"2026-05-18T02:31:58.892864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:58.892864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Quadrant System: Error-bounded Trajectory Compression on the Go","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Brano Kusy, Jiajun Liu, Kun Zhao, Philipp Sommer, Raja Jurdak, Shuo Shang","submitted_at":"2014-12-01T01:14:42Z","abstract_excerpt":"Long-term location tracking, where trajectory compression is commonly used, has gained high interest for many applications in transport, ecology, and wearable computing. However, state-of-the-art compression methods involve high space-time complexity or achieve unsatisfactory compression rate, leading to rapid exhaustion of memory, computation, storage and energy resources. We propose a novel online algorithm for error-bounded trajectory compression called the Bounded Quadrant System (BQS), which compresses trajectories with extremely small costs in space and time using convex-hulls. In this a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0321","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":""},"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":"1412.0321","created_at":"2026-05-18T02:31:58.892951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0321v2","created_at":"2026-05-18T02:31:58.892951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0321","created_at":"2026-05-18T02:31:58.892951+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2LVNTSA3SZC","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2LVNTSA3SZCNFWM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2LVNTSA","created_at":"2026-05-18T12:28:19.803747+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/A2LVNTSA3SZCNFWM63MRDZR3A5","json":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5.json","graph_json":"https://pith.science/api/pith-number/A2LVNTSA3SZCNFWM63MRDZR3A5/graph.json","events_json":"https://pith.science/api/pith-number/A2LVNTSA3SZCNFWM63MRDZR3A5/events.json","paper":"https://pith.science/paper/A2LVNTSA"},"agent_actions":{"view_html":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5","download_json":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5.json","view_paper":"https://pith.science/paper/A2LVNTSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0321&json=true","fetch_graph":"https://pith.science/api/pith-number/A2LVNTSA3SZCNFWM63MRDZR3A5/graph.json","fetch_events":"https://pith.science/api/pith-number/A2LVNTSA3SZCNFWM63MRDZR3A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5/action/storage_attestation","attest_author":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5/action/author_attestation","sign_citation":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5/action/citation_signature","submit_replication":"https://pith.science/pith/A2LVNTSA3SZCNFWM63MRDZR3A5/action/replication_record"}},"created_at":"2026-05-18T02:31:58.892951+00:00","updated_at":"2026-05-18T02:31:58.892951+00:00"}