{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BZRMM44I3NNH6RUXF4JBGCYG2U","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":"30e7ed2b3ca4eaf2874fcb8391b5e229b2c0ddb03b0223af33f39de9bcf0ed0e","cross_cats_sorted":["cs.NI","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-22T09:43:37Z","title_canon_sha256":"b74b86ac3cca0259020d4835e38ceecbb7cfd177b726e31d5b4ad6c37449328a"},"schema_version":"1.0","source":{"id":"1205.4856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4856","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4856v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4856","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"BZRMM44I3NNH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BZRMM44I3NNH6RUX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BZRMM44I","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:8b9ea0db8068a3d175f4f772c8008c435a626ee400225570f16afa89b02487b6","target":"graph","created_at":"2026-05-18T03:55:11Z","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":"Iterated localization is considered where each node of a network needs to get localized (find its location on 2-D plane), when initially only a subset of nodes have their location information. The iterated localization process proceeds as follows. Starting with a subset of nodes that have their location information, possibly using global positioning system (GPS) devices, any other node gets localized if it has three or more localized nodes in its radio range. The newly localized nodes are included in the subset of nodes that have their location information for the next iteration. This process ","authors_text":"Piyush Gupta, Rahul Vaze","cross_cats":["cs.NI","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-22T09:43:37Z","title":"Bounds on Minimum Number of Anchors for Iterative Localization and its Connections to Bootstrap Percolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4856","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:c37548cb4fd01cafd622227046fc459c9b73560998a4600651adde8119f5218a","target":"record","created_at":"2026-05-18T03:55:11Z","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":"30e7ed2b3ca4eaf2874fcb8391b5e229b2c0ddb03b0223af33f39de9bcf0ed0e","cross_cats_sorted":["cs.NI","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-22T09:43:37Z","title_canon_sha256":"b74b86ac3cca0259020d4835e38ceecbb7cfd177b726e31d5b4ad6c37449328a"},"schema_version":"1.0","source":{"id":"1205.4856","kind":"arxiv","version":1}},"canonical_sha256":"0e62c67388db5a7f46972f12130b06d51e0530f4f69a5642c295da715084cd07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e62c67388db5a7f46972f12130b06d51e0530f4f69a5642c295da715084cd07","first_computed_at":"2026-05-18T03:55:11.488863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:11.488863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E9CRnDBwFbW1NJ607nsaIDSu15NMfWyFi4tIBGXgRbgaoAq6HWppHV8xJssoAZ/Tg06Ujt9GB9XBaVheCE0oAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:11.489550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c37548cb4fd01cafd622227046fc459c9b73560998a4600651adde8119f5218a","sha256:8b9ea0db8068a3d175f4f772c8008c435a626ee400225570f16afa89b02487b6"],"state_sha256":"712bd9dde92520b4b0a77143e2decae5fb3a3913ade65c49da95baf4295a3d0c"}