{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4E57BDTF5BG77T6EALOU2YK43H","short_pith_number":"pith:4E57BDTF","canonical_record":{"source":{"id":"1602.06375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-20T07:06:08Z","cross_cats_sorted":["cs.RO","math.IT","math.OC","stat.AP"],"title_canon_sha256":"065a3cad8e6bffecbe875cf260bee73fb8dc30547d819af5243bde7ca333ca93","abstract_canon_sha256":"6ef06ff9aea5ee7576b136cba90315b3b595ace9a4070a8de36c0bc436e458c2"},"schema_version":"1.0"},"canonical_sha256":"e13bf08e65e84dffcfc402dd4d615cd9f42bd80f352f8462a69c453b9473ab1d","source":{"kind":"arxiv","id":"1602.06375","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06375","created_at":"2026-05-18T01:20:14Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06375v1","created_at":"2026-05-18T01:20:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06375","created_at":"2026-05-18T01:20:14Z"},{"alias_kind":"pith_short_12","alias_value":"4E57BDTF5BG7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4E57BDTF5BG77T6E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4E57BDTF","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4E57BDTF5BG77T6EALOU2YK43H","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-20T07:06:08Z","cross_cats_sorted":["cs.RO","math.IT","math.OC","stat.AP"],"title_canon_sha256":"065a3cad8e6bffecbe875cf260bee73fb8dc30547d819af5243bde7ca333ca93","abstract_canon_sha256":"6ef06ff9aea5ee7576b136cba90315b3b595ace9a4070a8de36c0bc436e458c2"},"schema_version":"1.0"},"canonical_sha256":"e13bf08e65e84dffcfc402dd4d615cd9f42bd80f352f8462a69c453b9473ab1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:14.226989Z","signature_b64":"SwAJE8NapzDbIPzGNUI1VWNU1c8rWAd038SBAquWD857VryPKBUIHLxt8znqBw+vvo+BI2ivAjp+ctGG1okDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e13bf08e65e84dffcfc402dd4d615cd9f42bd80f352f8462a69c453b9473ab1d","last_reissued_at":"2026-05-18T01:20:14.226270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:14.226270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06375","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:20:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLtHZDWkNhjWPeL+sgk+CnFh2s++/ULJVqfNbcXxPvw25nzjj03RGOKBT2sV0AdsA8ahvf5pfhMv1QeJTWe3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:05:20.125555Z"},"content_sha256":"74bce276a69de31dc96ddf2c483e272e363e8f441a7a98fcf88db198d75cd328","schema_version":"1.0","event_id":"sha256:74bce276a69de31dc96ddf2c483e272e363e8f441a7a98fcf88db198d75cd328"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4E57BDTF5BG77T6EALOU2YK43H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power-Distortion Metrics for Path Planning over Gaussian Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.IT","math.OC","stat.AP"],"primary_cat":"cs.IT","authors_text":"Emrah Akyol, Urbashi Mitra","submitted_at":"2016-02-20T07:06:08Z","abstract_excerpt":"Path planning is an important component of au- tonomous mobile sensing systems. This paper studies upper and lower bounds of communication performance over Gaussian sen- sor networks, to drive power-distortion metrics for path planning problems. The Gaussian multiple-access channel is employed as a channel model and two source models are considered. In the first setting, the underlying source is estimated with minimum mean squared error, while in the second, reconstruction of a random spatial field is considered. For both problem settings, the upper and the lower bounds of sensor power-distort"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06375","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:20:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdKjnYW3yCeUiPvrgaZFmn6fe6es/RIto5sLMCS2exCzZ1hekBOVLWI7o46wzZwL8UDF5qe53lFu5WMSYvFdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:05:20.125920Z"},"content_sha256":"9e659628485be9b3b8561cef103094bf6549f8d3dafbc3f38f271f04a5ced292","schema_version":"1.0","event_id":"sha256:9e659628485be9b3b8561cef103094bf6549f8d3dafbc3f38f271f04a5ced292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4E57BDTF5BG77T6EALOU2YK43H/bundle.json","state_url":"https://pith.science/pith/4E57BDTF5BG77T6EALOU2YK43H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4E57BDTF5BG77T6EALOU2YK43H/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-22T21:05:20Z","links":{"resolver":"https://pith.science/pith/4E57BDTF5BG77T6EALOU2YK43H","bundle":"https://pith.science/pith/4E57BDTF5BG77T6EALOU2YK43H/bundle.json","state":"https://pith.science/pith/4E57BDTF5BG77T6EALOU2YK43H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4E57BDTF5BG77T6EALOU2YK43H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4E57BDTF5BG77T6EALOU2YK43H","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":"6ef06ff9aea5ee7576b136cba90315b3b595ace9a4070a8de36c0bc436e458c2","cross_cats_sorted":["cs.RO","math.IT","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-20T07:06:08Z","title_canon_sha256":"065a3cad8e6bffecbe875cf260bee73fb8dc30547d819af5243bde7ca333ca93"},"schema_version":"1.0","source":{"id":"1602.06375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06375","created_at":"2026-05-18T01:20:14Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06375v1","created_at":"2026-05-18T01:20:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06375","created_at":"2026-05-18T01:20:14Z"},{"alias_kind":"pith_short_12","alias_value":"4E57BDTF5BG7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4E57BDTF5BG77T6E","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4E57BDTF","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:9e659628485be9b3b8561cef103094bf6549f8d3dafbc3f38f271f04a5ced292","target":"graph","created_at":"2026-05-18T01:20:14Z","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":"Path planning is an important component of au- tonomous mobile sensing systems. This paper studies upper and lower bounds of communication performance over Gaussian sen- sor networks, to drive power-distortion metrics for path planning problems. The Gaussian multiple-access channel is employed as a channel model and two source models are considered. In the first setting, the underlying source is estimated with minimum mean squared error, while in the second, reconstruction of a random spatial field is considered. For both problem settings, the upper and the lower bounds of sensor power-distort","authors_text":"Emrah Akyol, Urbashi Mitra","cross_cats":["cs.RO","math.IT","math.OC","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-20T07:06:08Z","title":"Power-Distortion Metrics for Path Planning over Gaussian Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06375","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:74bce276a69de31dc96ddf2c483e272e363e8f441a7a98fcf88db198d75cd328","target":"record","created_at":"2026-05-18T01:20:14Z","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":"6ef06ff9aea5ee7576b136cba90315b3b595ace9a4070a8de36c0bc436e458c2","cross_cats_sorted":["cs.RO","math.IT","math.OC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-20T07:06:08Z","title_canon_sha256":"065a3cad8e6bffecbe875cf260bee73fb8dc30547d819af5243bde7ca333ca93"},"schema_version":"1.0","source":{"id":"1602.06375","kind":"arxiv","version":1}},"canonical_sha256":"e13bf08e65e84dffcfc402dd4d615cd9f42bd80f352f8462a69c453b9473ab1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e13bf08e65e84dffcfc402dd4d615cd9f42bd80f352f8462a69c453b9473ab1d","first_computed_at":"2026-05-18T01:20:14.226270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:14.226270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SwAJE8NapzDbIPzGNUI1VWNU1c8rWAd038SBAquWD857VryPKBUIHLxt8znqBw+vvo+BI2ivAjp+ctGG1okDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:14.226989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74bce276a69de31dc96ddf2c483e272e363e8f441a7a98fcf88db198d75cd328","sha256:9e659628485be9b3b8561cef103094bf6549f8d3dafbc3f38f271f04a5ced292"],"state_sha256":"726d7c92f85fe04ee0bf2c6e1e7ee47fa22048ef8bb4ab2c51a8cd366ca7295e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSizSmGXEMhbNreno93fSqEnbq1ojBqCGJvg5m2fBXA/ZpzeDbk1KQ9E8jXD/cQbpSBEUWZwwSukb3RMSPZ9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:05:20.128508Z","bundle_sha256":"09f3a2484b1e239851a6d1ad115b86fa975feadbe0f8dd2244702f534f16765b"}}