{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:23A6CRO5ULNSNIYJI5RX2XADAA","short_pith_number":"pith:23A6CRO5","canonical_record":{"source":{"id":"1404.6151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:30:33Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"441539aa7bb31de6bc4558266043a7cda0665ac07d4ceee85a8eb5b78490ab62","abstract_canon_sha256":"ec34e9e87d5e69be764d5d8d839248ff2d4541a585dab37dea4a4ab15ebc34d2"},"schema_version":"1.0"},"canonical_sha256":"d6c1e145dda2db26a30947637d5c0300017580ff0970dc0314406d4580e11526","source":{"kind":"arxiv","id":"1404.6151","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:23A6CRO5ULNSNIYJI5RX2XADAA","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T04:30:33Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"441539aa7bb31de6bc4558266043a7cda0665ac07d4ceee85a8eb5b78490ab62","abstract_canon_sha256":"ec34e9e87d5e69be764d5d8d839248ff2d4541a585dab37dea4a4ab15ebc34d2"},"schema_version":"1.0"},"canonical_sha256":"d6c1e145dda2db26a30947637d5c0300017580ff0970dc0314406d4580e11526","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:18.216937Z","signature_b64":"8Ok7lyyZyo/WDeScrLGYfMfF1eFaUayqECCaqR14Xovch9K8UCW0Agn7NIodjYDmDm4lAdt21L7pLmYYe+zwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6c1e145dda2db26a30947637d5c0300017580ff0970dc0314406d4580e11526","last_reissued_at":"2026-05-18T02:53:18.216377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:18.216377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6151","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-18T02:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjDMdik4b33GCKHgk+57essh51G9zbdVAkbqdv6foHyjfZ75+q0rQ01kgfHCr53xVA44Hrb+vvSBrgbU7zBnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:14:40.629728Z"},"content_sha256":"0eb7b3e3e34c29fc9aa889b9c07fec2159b880c38cb3956509d80d0557cedb04","schema_version":"1.0","event_id":"sha256:0eb7b3e3e34c29fc9aa889b9c07fec2159b880c38cb3956509d80d0557cedb04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:23A6CRO5ULNSNIYJI5RX2XADAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SimpleTrack:Adaptive Trajectory Compression with Deterministic Projection Matrix for Mobile Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Chun Tung Chou, Mingrui Yang, Rajib Rana, Tim Wark, Wen Hu","submitted_at":"2014-04-23T04:30:33Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6151","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-18T02:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XcsDuJjqsn/F6dSWJLHHcAQ56JqKTJADGMBPzPx4xns+18XXjtcbk8nzMvDXKB7W/1/YBrkATEZkIkS/g8HPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:14:40.630083Z"},"content_sha256":"233829bc986e83e6d2e813b5646d45493acb36e3b867e8780fae2f6c148a46ce","schema_version":"1.0","event_id":"sha256:233829bc986e83e6d2e813b5646d45493acb36e3b867e8780fae2f6c148a46ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23A6CRO5ULNSNIYJI5RX2XADAA/bundle.json","state_url":"https://pith.science/pith/23A6CRO5ULNSNIYJI5RX2XADAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23A6CRO5ULNSNIYJI5RX2XADAA/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-06-23T08:14:40Z","links":{"resolver":"https://pith.science/pith/23A6CRO5ULNSNIYJI5RX2XADAA","bundle":"https://pith.science/pith/23A6CRO5ULNSNIYJI5RX2XADAA/bundle.json","state":"https://pith.science/pith/23A6CRO5ULNSNIYJI5RX2XADAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23A6CRO5ULNSNIYJI5RX2XADAA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFF73yiohHGQ5r8xOy/u4OVV9uEIwuSbQaQIQVrk8rpmBeH+jYzCCzp4OeZRyafkJxWOd8D6QEgIppeyl6TlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:14:40.632099Z","bundle_sha256":"c725c85c7617e30cf91c103f6f65007623981414a3b749470c253c1f2c708b2d"}}