{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JVKXISFGOKNXXXGJGX423MWPH6","short_pith_number":"pith:JVKXISFG","schema_version":"1.0","canonical_sha256":"4d557448a6729b7bdcc935f9adb2cf3f9867af6afdc509d113303d566981ccb6","source":{"kind":"arxiv","id":"1210.6198","version":2},"attestation_state":"computed","paper":{"title":"Network Localization by Shadow Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SY","authors_text":"Federica Pascucci, Gabriele Oliva, Roberto Setola, Stefano Panzieri","submitted_at":"2012-10-23T11:08:27Z","abstract_excerpt":"Localization is a fundamental task for sensor networks. Traditional network construction approaches allow to obtain localized networks requiring the nodes to be at least tri-connected (in 2D), i.e., the communication graph needs to be globally rigid. In this paper we exploit, besides the information on the neighbors sensed by each robot/sensor, also the information about the lack of communication among nodes. The result is a framework where the nodes are required to be bi-connected and the communication graph has to be rigid. This is possible considering a novel typology of link, namely Shadow"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.6198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-10-23T11:08:27Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"0d9dc3feb36f0eb1c1ee3331046a7b41a59b9c1a426babd5a5c64d8cd06a76cb","abstract_canon_sha256":"abe2be392e2e54e86fca3425e38edc8f2507718f492f0d717e6a2a0312190985"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:07.930216Z","signature_b64":"Cnx6wOrXuJ8cTYdpAx5EvBFrc7bHEhNpdVKke+Vq7EQpbusuij3Fj6pQb+U1n3+HfZaOVX5jmpVrsqFWkOGmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d557448a6729b7bdcc935f9adb2cf3f9867af6afdc509d113303d566981ccb6","last_reissued_at":"2026-05-18T03:37:07.929483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:07.929483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Localization by Shadow Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.SY","authors_text":"Federica Pascucci, Gabriele Oliva, Roberto Setola, Stefano Panzieri","submitted_at":"2012-10-23T11:08:27Z","abstract_excerpt":"Localization is a fundamental task for sensor networks. Traditional network construction approaches allow to obtain localized networks requiring the nodes to be at least tri-connected (in 2D), i.e., the communication graph needs to be globally rigid. In this paper we exploit, besides the information on the neighbors sensed by each robot/sensor, also the information about the lack of communication among nodes. The result is a framework where the nodes are required to be bi-connected and the communication graph has to be rigid. This is possible considering a novel typology of link, namely Shadow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6198","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.6198","created_at":"2026-05-18T03:37:07.929605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6198v2","created_at":"2026-05-18T03:37:07.929605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6198","created_at":"2026-05-18T03:37:07.929605+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVKXISFGOKNX","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVKXISFGOKNXXXGJ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVKXISFG","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6","json":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6.json","graph_json":"https://pith.science/api/pith-number/JVKXISFGOKNXXXGJGX423MWPH6/graph.json","events_json":"https://pith.science/api/pith-number/JVKXISFGOKNXXXGJGX423MWPH6/events.json","paper":"https://pith.science/paper/JVKXISFG"},"agent_actions":{"view_html":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6","download_json":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6.json","view_paper":"https://pith.science/paper/JVKXISFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6198&json=true","fetch_graph":"https://pith.science/api/pith-number/JVKXISFGOKNXXXGJGX423MWPH6/graph.json","fetch_events":"https://pith.science/api/pith-number/JVKXISFGOKNXXXGJGX423MWPH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6/action/storage_attestation","attest_author":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6/action/author_attestation","sign_citation":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6/action/citation_signature","submit_replication":"https://pith.science/pith/JVKXISFGOKNXXXGJGX423MWPH6/action/replication_record"}},"created_at":"2026-05-18T03:37:07.929605+00:00","updated_at":"2026-05-18T03:37:07.929605+00:00"}