{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NGRWIXAZSMU5YA6AJXOUFLMJKP","short_pith_number":"pith:NGRWIXAZ","canonical_record":{"source":{"id":"1706.00871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-02T22:44:13Z","cross_cats_sorted":[],"title_canon_sha256":"ad534a547de12de972180ec72c67d87d3d79bfbf9e905aa472778c722c708b01","abstract_canon_sha256":"a8f4ab5c4c1d061dcbdee64395e675318d94e0c48b0610fabd4053afb2062da3"},"schema_version":"1.0"},"canonical_sha256":"69a3645c199329dc03c04ddd42ad8953d3ee4454aa270ba3ce757cd95a274db9","source":{"kind":"arxiv","id":"1706.00871","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00871","created_at":"2026-05-18T00:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00871v2","created_at":"2026-05-18T00:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00871","created_at":"2026-05-18T00:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"NGRWIXAZSMU5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NGRWIXAZSMU5YA6A","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NGRWIXAZ","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NGRWIXAZSMU5YA6AJXOUFLMJKP","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-02T22:44:13Z","cross_cats_sorted":[],"title_canon_sha256":"ad534a547de12de972180ec72c67d87d3d79bfbf9e905aa472778c722c708b01","abstract_canon_sha256":"a8f4ab5c4c1d061dcbdee64395e675318d94e0c48b0610fabd4053afb2062da3"},"schema_version":"1.0"},"canonical_sha256":"69a3645c199329dc03c04ddd42ad8953d3ee4454aa270ba3ce757cd95a274db9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:30.853385Z","signature_b64":"JBVGec20o8hjH4XNY8dpB3fJnK3aLZbddmeDKnRqVOyNlqJ2cismLNf5j2Ro5MISVVXI94cmXaghYBFxJW7TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a3645c199329dc03c04ddd42ad8953d3ee4454aa270ba3ce757cd95a274db9","last_reissued_at":"2026-05-18T00:32:30.852681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:30.852681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00871","source_version":2,"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-18T00:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+intJs5kmraVM//VwqUxk6ugqp8xCNU/fT2ujGjjMSrHxUkfan68MQBcytX5Oc7faIKdp/XtQbYw+/lNCLTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:01:37.678519Z"},"content_sha256":"96bfd68a60cf18ee14939af4fbe1ad5c28b8a350a27feca3bb7668e933d45ef0","schema_version":"1.0","event_id":"sha256:96bfd68a60cf18ee14939af4fbe1ad5c28b8a350a27feca3bb7668e933d45ef0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NGRWIXAZSMU5YA6AJXOUFLMJKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower Bound on Observability for Target Tracking with Range Sensors and its Application to Sensor Assignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Lifeng Zhou, Pratap Tokekar","submitted_at":"2017-06-02T22:44:13Z","abstract_excerpt":"We study two sensor assignment problems for multi-target tracking with the goal of improving the observability of the underlying estimator. In the restricted version of the problem, we focus on assigning unique pairs of sensors to each target. We present a 1/3-approximation algorithm for this problem. We use the inverse of the condition number as the value function. If the target's motion model is not known, the inverse cannot be computed exactly. Instead, we present a lower bound for range-only sensing.\n  In the general version, the sensors must form teams to track individual targets. We do n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00871","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"},"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-18T00:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i19JoLmDV24kbSDvgryITRFSsTJYuIMWxCIhlduv4QCzvLPnqVY8pAncEU+x4tdi9gzTyYwSwlpPfow/v6A4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:01:37.678874Z"},"content_sha256":"886de2e619fc6e5631c556eaafa7b53ef05abe9fa5b0b5b870d3c9b278bc5c7a","schema_version":"1.0","event_id":"sha256:886de2e619fc6e5631c556eaafa7b53ef05abe9fa5b0b5b870d3c9b278bc5c7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGRWIXAZSMU5YA6AJXOUFLMJKP/bundle.json","state_url":"https://pith.science/pith/NGRWIXAZSMU5YA6AJXOUFLMJKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGRWIXAZSMU5YA6AJXOUFLMJKP/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-01T17:01:37Z","links":{"resolver":"https://pith.science/pith/NGRWIXAZSMU5YA6AJXOUFLMJKP","bundle":"https://pith.science/pith/NGRWIXAZSMU5YA6AJXOUFLMJKP/bundle.json","state":"https://pith.science/pith/NGRWIXAZSMU5YA6AJXOUFLMJKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGRWIXAZSMU5YA6AJXOUFLMJKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NGRWIXAZSMU5YA6AJXOUFLMJKP","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":"a8f4ab5c4c1d061dcbdee64395e675318d94e0c48b0610fabd4053afb2062da3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-02T22:44:13Z","title_canon_sha256":"ad534a547de12de972180ec72c67d87d3d79bfbf9e905aa472778c722c708b01"},"schema_version":"1.0","source":{"id":"1706.00871","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00871","created_at":"2026-05-18T00:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00871v2","created_at":"2026-05-18T00:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00871","created_at":"2026-05-18T00:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"NGRWIXAZSMU5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NGRWIXAZSMU5YA6A","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NGRWIXAZ","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:886de2e619fc6e5631c556eaafa7b53ef05abe9fa5b0b5b870d3c9b278bc5c7a","target":"graph","created_at":"2026-05-18T00:32:30Z","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":"We study two sensor assignment problems for multi-target tracking with the goal of improving the observability of the underlying estimator. In the restricted version of the problem, we focus on assigning unique pairs of sensors to each target. We present a 1/3-approximation algorithm for this problem. We use the inverse of the condition number as the value function. If the target's motion model is not known, the inverse cannot be computed exactly. Instead, we present a lower bound for range-only sensing.\n  In the general version, the sensors must form teams to track individual targets. We do n","authors_text":"Lifeng Zhou, Pratap Tokekar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-02T22:44:13Z","title":"A Lower Bound on Observability for Target Tracking with Range Sensors and its Application to Sensor Assignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00871","kind":"arxiv","version":2},"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:96bfd68a60cf18ee14939af4fbe1ad5c28b8a350a27feca3bb7668e933d45ef0","target":"record","created_at":"2026-05-18T00:32:30Z","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":"a8f4ab5c4c1d061dcbdee64395e675318d94e0c48b0610fabd4053afb2062da3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-02T22:44:13Z","title_canon_sha256":"ad534a547de12de972180ec72c67d87d3d79bfbf9e905aa472778c722c708b01"},"schema_version":"1.0","source":{"id":"1706.00871","kind":"arxiv","version":2}},"canonical_sha256":"69a3645c199329dc03c04ddd42ad8953d3ee4454aa270ba3ce757cd95a274db9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69a3645c199329dc03c04ddd42ad8953d3ee4454aa270ba3ce757cd95a274db9","first_computed_at":"2026-05-18T00:32:30.852681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:30.852681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JBVGec20o8hjH4XNY8dpB3fJnK3aLZbddmeDKnRqVOyNlqJ2cismLNf5j2Ro5MISVVXI94cmXaghYBFxJW7TBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:30.853385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00871","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96bfd68a60cf18ee14939af4fbe1ad5c28b8a350a27feca3bb7668e933d45ef0","sha256:886de2e619fc6e5631c556eaafa7b53ef05abe9fa5b0b5b870d3c9b278bc5c7a"],"state_sha256":"9ee9424a730d0f3462e19da8075b6c85faa5782a376fe33cc9b3dbae7db4e95a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SsI7NGlfzXle/cQYME2Y9iNEkSvIZw1G7WH846F+pnnBkW6X23odQiByMAdF+VqJ1YviTFYVm1OCiLwuqMGtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:01:37.680836Z","bundle_sha256":"064faf2b692dac549446dffea98a255952c715929f4379d1e9518bdbbead8615"}}