{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WMQDGCMARUIULGOF3LUH4M4AYA","short_pith_number":"pith:WMQDGCMA","canonical_record":{"source":{"id":"1605.02337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T17:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"7a3bb36f67050e26719eea2ab62d6c52b242cc58f272d4c042ac664f921ae7a3","abstract_canon_sha256":"00093b6d56e7ffa35cf357a00970542c82eef474378340bf2bbd15663e0c9ba3"},"schema_version":"1.0"},"canonical_sha256":"b3203309808d114599c5dae87e3380c02114f13b8433c66585978b4517774e22","source":{"kind":"arxiv","id":"1605.02337","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02337","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02337v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02337","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"WMQDGCMARUIU","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WMQDGCMARUIULGOF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WMQDGCMA","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WMQDGCMARUIULGOF3LUH4M4AYA","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T17:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"7a3bb36f67050e26719eea2ab62d6c52b242cc58f272d4c042ac664f921ae7a3","abstract_canon_sha256":"00093b6d56e7ffa35cf357a00970542c82eef474378340bf2bbd15663e0c9ba3"},"schema_version":"1.0"},"canonical_sha256":"b3203309808d114599c5dae87e3380c02114f13b8433c66585978b4517774e22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.259347Z","signature_b64":"cmUiEDyjAFohCyC9jbJhLM1MjzoE2Jep37gSBFFzJOWbY7FoJ2rYJNMQGMBuepjDdvaqQsxxyZ9Mok4r+kLwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3203309808d114599c5dae87e3380c02114f13b8433c66585978b4517774e22","last_reissued_at":"2026-05-18T01:15:21.258696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.258696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02337","source_version":1,"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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaM+tRlQiMk+H/ZvpJHhnIL5MVlxJj1ck8NTlqgzSXYoWB4sLNcAioqQYt6C7D/T9Tl9U3dDLpj0u864YTRfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:12:38.492291Z"},"content_sha256":"960cd9471573a5f806a5eb4959107fef58dd630f6cae0261174d5ff7fb870a70","schema_version":"1.0","event_id":"sha256:960cd9471573a5f806a5eb4959107fef58dd630f6cae0261174d5ff7fb870a70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WMQDGCMARUIULGOF3LUH4M4AYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Framework for Online Amnesic Trajectory Compression in Resource-constrained Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brano Kusy, Jae-Gil Lee, Jiajun Liu, Kun Zhao, Philipp Sommer, Raja Jurdak, Shuo Shang","submitted_at":"2016-05-08T17:14:19Z","abstract_excerpt":"State-of-the-art trajectory compression methods usually involve high space-time complexity or yield unsatisfactory compression rates, leading to rapid exhaustion of memory, computation, storage and energy resources. Their ability is commonly limited when operating in a resource-constrained environment especially when the data volume (even when compressed) far exceeds the storage limit. Hence we propose a novel online framework for error-bounded trajectory compression and ageing called the Amnesic Bounded Quadrant System (ABQS), whose core is the Bounded Quadrant System (BQS) algorithm family t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02337","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"},"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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KOH+ThQMh5/N4WEknBadpfLqF28FcqrRAlVDyia/iIhC2Gf4/TcUB9BEjfLqwWVM5xZoI5nAvVoUdem3YyfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:12:38.492725Z"},"content_sha256":"b90a23f06e8c11ae9a932e1a9cfb3f13ddcdb3a987fa5439bca122080b7e850c","schema_version":"1.0","event_id":"sha256:b90a23f06e8c11ae9a932e1a9cfb3f13ddcdb3a987fa5439bca122080b7e850c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMQDGCMARUIULGOF3LUH4M4AYA/bundle.json","state_url":"https://pith.science/pith/WMQDGCMARUIULGOF3LUH4M4AYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMQDGCMARUIULGOF3LUH4M4AYA/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-05-31T12:12:38Z","links":{"resolver":"https://pith.science/pith/WMQDGCMARUIULGOF3LUH4M4AYA","bundle":"https://pith.science/pith/WMQDGCMARUIULGOF3LUH4M4AYA/bundle.json","state":"https://pith.science/pith/WMQDGCMARUIULGOF3LUH4M4AYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMQDGCMARUIULGOF3LUH4M4AYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WMQDGCMARUIULGOF3LUH4M4AYA","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":"00093b6d56e7ffa35cf357a00970542c82eef474378340bf2bbd15663e0c9ba3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T17:14:19Z","title_canon_sha256":"7a3bb36f67050e26719eea2ab62d6c52b242cc58f272d4c042ac664f921ae7a3"},"schema_version":"1.0","source":{"id":"1605.02337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02337","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02337v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02337","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"WMQDGCMARUIU","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WMQDGCMARUIULGOF","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WMQDGCMA","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:b90a23f06e8c11ae9a932e1a9cfb3f13ddcdb3a987fa5439bca122080b7e850c","target":"graph","created_at":"2026-05-18T01:15:21Z","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":"State-of-the-art trajectory compression methods usually involve high space-time complexity or yield unsatisfactory compression rates, leading to rapid exhaustion of memory, computation, storage and energy resources. Their ability is commonly limited when operating in a resource-constrained environment especially when the data volume (even when compressed) far exceeds the storage limit. Hence we propose a novel online framework for error-bounded trajectory compression and ageing called the Amnesic Bounded Quadrant System (ABQS), whose core is the Bounded Quadrant System (BQS) algorithm family t","authors_text":"Brano Kusy, Jae-Gil Lee, Jiajun Liu, Kun Zhao, Philipp Sommer, Raja Jurdak, Shuo Shang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T17:14:19Z","title":"A Novel Framework for Online Amnesic Trajectory Compression in Resource-constrained Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02337","kind":"arxiv","version":1},"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:960cd9471573a5f806a5eb4959107fef58dd630f6cae0261174d5ff7fb870a70","target":"record","created_at":"2026-05-18T01:15:21Z","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":"00093b6d56e7ffa35cf357a00970542c82eef474378340bf2bbd15663e0c9ba3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-08T17:14:19Z","title_canon_sha256":"7a3bb36f67050e26719eea2ab62d6c52b242cc58f272d4c042ac664f921ae7a3"},"schema_version":"1.0","source":{"id":"1605.02337","kind":"arxiv","version":1}},"canonical_sha256":"b3203309808d114599c5dae87e3380c02114f13b8433c66585978b4517774e22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3203309808d114599c5dae87e3380c02114f13b8433c66585978b4517774e22","first_computed_at":"2026-05-18T01:15:21.258696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:21.258696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cmUiEDyjAFohCyC9jbJhLM1MjzoE2Jep37gSBFFzJOWbY7FoJ2rYJNMQGMBuepjDdvaqQsxxyZ9Mok4r+kLwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:21.259347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:960cd9471573a5f806a5eb4959107fef58dd630f6cae0261174d5ff7fb870a70","sha256:b90a23f06e8c11ae9a932e1a9cfb3f13ddcdb3a987fa5439bca122080b7e850c"],"state_sha256":"6c80712e0687741600c613ef19f490a0e9cdde5fb5d6cbd5a449bf84889161a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIYeRXu8/JzIRreKN8Ey5W1h4tOiDpy/J82Xl8wAlP9i041Y/bE4JRbyjmrcYY3VCHVRyOTkweziCFmOZVtUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:12:38.496540Z","bundle_sha256":"414986c27e3bc6869bbae65574871a7082b31ebe5da88de7ac1fbcc9b8c8068c"}}