{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:APHDKAAZYSRTB5SCMDFBREZI66","short_pith_number":"pith:APHDKAAZ","canonical_record":{"source":{"id":"1211.4441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-19T14:39:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11dbac34bb5236c0efa19d03a99fb923670ff9b3aa23c7185e246ea8192afc1c","abstract_canon_sha256":"b5eec20db8c1c963643db398332ff062f794a6fcd7e2d2553da9c1d4155a906d"},"schema_version":"1.0"},"canonical_sha256":"03ce350019c4a330f64260ca189328f784ea326f7a0d99545b1ad3e6938d2f2b","source":{"kind":"arxiv","id":"1211.4441","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4441","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4441v1","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4441","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"pith_short_12","alias_value":"APHDKAAZYSRT","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"APHDKAAZYSRTB5SC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"APHDKAAZ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:APHDKAAZYSRTB5SCMDFBREZI66","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-19T14:39:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11dbac34bb5236c0efa19d03a99fb923670ff9b3aa23c7185e246ea8192afc1c","abstract_canon_sha256":"b5eec20db8c1c963643db398332ff062f794a6fcd7e2d2553da9c1d4155a906d"},"schema_version":"1.0"},"canonical_sha256":"03ce350019c4a330f64260ca189328f784ea326f7a0d99545b1ad3e6938d2f2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:26.903557Z","signature_b64":"xuoY8W2mRzl0vLH3a/RBPMG9awa+Nnuo295AEPAiaxyVbYGdpDImZz7qFf+9E77lRuohmAH/PwEc9wthE9dcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03ce350019c4a330f64260ca189328f784ea326f7a0d99545b1ad3e6938d2f2b","last_reissued_at":"2026-05-18T03:40:26.902842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:26.902842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4441","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-18T03:40:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pcNjQKiaPyCNb85sXW6mBiKJw5mBxEaOlTM0AELN2o6MYSlTlSbNDT+9lbqDWBsrK2PQA1WgkDLl08DANe1VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:33:52.375930Z"},"content_sha256":"3b095585fbbdd1bb0da6fb71f27339d92ea281afacb09554281639b53a021099","schema_version":"1.0","event_id":"sha256:3b095585fbbdd1bb0da6fb71f27339d92ea281afacb09554281639b53a021099"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:APHDKAAZYSRTB5SCMDFBREZI66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Separability of Targets Using Binary Proximity Sensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Animesh Kumar, Bikash K. Dey, B. Santhana Krishnan, D. Manjunath","submitted_at":"2012-11-19T14:39:56Z","abstract_excerpt":"We consider the problem where a network of sensors has to detect the presence of targets at any of $n$ possible locations in a finite region. All such locations may not be occupied by a target. The data from sensors is fused to determine the set of locations that have targets. We term this the separability problem. In this paper, we address the separability of an asymptotically large number of static target locations by using binary proximity sensors. Two models for target locations are considered: (i) when target locations lie on a uniformly spaced grid; and, (ii) when target locations are i."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4441","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-18T03:40:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rid+jWS5HQxdLqTbtvFvQcdKsRqqMz228uLiIe+tHA9YX8oMsV1vuRo7GJfZGps6ScyE8g1EuzWCW5xtkc9rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:33:52.376310Z"},"content_sha256":"8fcd00e19135fdfacaecea83d05919d2b41f3e8baf66b25349f650caf6c07252","schema_version":"1.0","event_id":"sha256:8fcd00e19135fdfacaecea83d05919d2b41f3e8baf66b25349f650caf6c07252"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APHDKAAZYSRTB5SCMDFBREZI66/bundle.json","state_url":"https://pith.science/pith/APHDKAAZYSRTB5SCMDFBREZI66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APHDKAAZYSRTB5SCMDFBREZI66/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-03T07:33:52Z","links":{"resolver":"https://pith.science/pith/APHDKAAZYSRTB5SCMDFBREZI66","bundle":"https://pith.science/pith/APHDKAAZYSRTB5SCMDFBREZI66/bundle.json","state":"https://pith.science/pith/APHDKAAZYSRTB5SCMDFBREZI66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APHDKAAZYSRTB5SCMDFBREZI66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:APHDKAAZYSRTB5SCMDFBREZI66","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":"b5eec20db8c1c963643db398332ff062f794a6fcd7e2d2553da9c1d4155a906d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-19T14:39:56Z","title_canon_sha256":"11dbac34bb5236c0efa19d03a99fb923670ff9b3aa23c7185e246ea8192afc1c"},"schema_version":"1.0","source":{"id":"1211.4441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4441","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4441v1","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4441","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"pith_short_12","alias_value":"APHDKAAZYSRT","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"APHDKAAZYSRTB5SC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"APHDKAAZ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:8fcd00e19135fdfacaecea83d05919d2b41f3e8baf66b25349f650caf6c07252","target":"graph","created_at":"2026-05-18T03:40:26Z","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 consider the problem where a network of sensors has to detect the presence of targets at any of $n$ possible locations in a finite region. All such locations may not be occupied by a target. The data from sensors is fused to determine the set of locations that have targets. We term this the separability problem. In this paper, we address the separability of an asymptotically large number of static target locations by using binary proximity sensors. Two models for target locations are considered: (i) when target locations lie on a uniformly spaced grid; and, (ii) when target locations are i.","authors_text":"Animesh Kumar, Bikash K. Dey, B. Santhana Krishnan, D. Manjunath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-19T14:39:56Z","title":"On the Separability of Targets Using Binary Proximity Sensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4441","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:3b095585fbbdd1bb0da6fb71f27339d92ea281afacb09554281639b53a021099","target":"record","created_at":"2026-05-18T03:40:26Z","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":"b5eec20db8c1c963643db398332ff062f794a6fcd7e2d2553da9c1d4155a906d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-19T14:39:56Z","title_canon_sha256":"11dbac34bb5236c0efa19d03a99fb923670ff9b3aa23c7185e246ea8192afc1c"},"schema_version":"1.0","source":{"id":"1211.4441","kind":"arxiv","version":1}},"canonical_sha256":"03ce350019c4a330f64260ca189328f784ea326f7a0d99545b1ad3e6938d2f2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03ce350019c4a330f64260ca189328f784ea326f7a0d99545b1ad3e6938d2f2b","first_computed_at":"2026-05-18T03:40:26.902842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:26.902842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xuoY8W2mRzl0vLH3a/RBPMG9awa+Nnuo295AEPAiaxyVbYGdpDImZz7qFf+9E77lRuohmAH/PwEc9wthE9dcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:26.903557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b095585fbbdd1bb0da6fb71f27339d92ea281afacb09554281639b53a021099","sha256:8fcd00e19135fdfacaecea83d05919d2b41f3e8baf66b25349f650caf6c07252"],"state_sha256":"e802fc1cbb7f46fe5b25b0c7d2c6e524fb3805f7276f3fbc0ed7bf386ad6546e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"djkgXg38k5w3TkOBOaT5puRnS62OgpwImVnirAqa+1MEJ/Y9PJ6pCNECQ537SwzeaTkZgCAnXXSFQIxd0hsPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:33:52.378251Z","bundle_sha256":"0ba8594995db71b0fb50436c343e2887780675ede988ca82940277e1bdb650b0"}}