{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:23A6CRO5ULNSNIYJI5RX2XADAA","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":"ec34e9e87d5e69be764d5d8d839248ff2d4541a585dab37dea4a4ab15ebc34d2","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:30:33Z","title_canon_sha256":"441539aa7bb31de6bc4558266043a7cda0665ac07d4ceee85a8eb5b78490ab62"},"schema_version":"1.0","source":{"id":"1404.6151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6151","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6151v1","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6151","created_at":"2026-05-18T02:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"23A6CRO5ULNS","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"23A6CRO5ULNSNIYJ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"23A6CRO5","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:233829bc986e83e6d2e813b5646d45493acb36e3b867e8780fae2f6c148a46ce","target":"graph","created_at":"2026-05-18T02:53:18Z","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":"Some mobile sensor network applications require the sensor nodes to transfer their trajectories to a data sink. This paper proposes an adaptive trajectory (lossy) compression algorithm based on compressive sensing. The algorithm has two innovative elements. First, we propose a method to compute a deterministic projection matrix from a learnt dictionary. Second, we propose a method for the mobile nodes to adaptively predict the number of projections needed based on the speed of the mobile nodes. Extensive evaluation of the proposed algorithm using 6 datasets shows that our proposed algorithm ca","authors_text":"Chun Tung Chou, Mingrui Yang, Rajib Rana, Tim Wark, Wen Hu","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:30:33Z","title":"SimpleTrack:Adaptive Trajectory Compression with Deterministic Projection Matrix for Mobile Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6151","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:0eb7b3e3e34c29fc9aa889b9c07fec2159b880c38cb3956509d80d0557cedb04","target":"record","created_at":"2026-05-18T02:53:18Z","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":"ec34e9e87d5e69be764d5d8d839248ff2d4541a585dab37dea4a4ab15ebc34d2","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:30:33Z","title_canon_sha256":"441539aa7bb31de6bc4558266043a7cda0665ac07d4ceee85a8eb5b78490ab62"},"schema_version":"1.0","source":{"id":"1404.6151","kind":"arxiv","version":1}},"canonical_sha256":"d6c1e145dda2db26a30947637d5c0300017580ff0970dc0314406d4580e11526","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6c1e145dda2db26a30947637d5c0300017580ff0970dc0314406d4580e11526","first_computed_at":"2026-05-18T02:53:18.216377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:18.216377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Ok7lyyZyo/WDeScrLGYfMfF1eFaUayqECCaqR14Xovch9K8UCW0Agn7NIodjYDmDm4lAdt21L7pLmYYe+zwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:18.216937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eb7b3e3e34c29fc9aa889b9c07fec2159b880c38cb3956509d80d0557cedb04","sha256:233829bc986e83e6d2e813b5646d45493acb36e3b867e8780fae2f6c148a46ce"],"state_sha256":"ed226158f60bcc5dd45a91173369c7806f3263fea591a162fd5dcde6b71d1bfa"}