{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7EDNJUOWQ2QDUA6OIDR6CFZT7O","short_pith_number":"pith:7EDNJUOW","schema_version":"1.0","canonical_sha256":"f906d4d1d686a03a03ce40e3e11733fb88529a752446fe719a78ebf25c0ac3ec","source":{"kind":"arxiv","id":"2607.10170","version":1},"attestation_state":"computed","paper":{"title":"From Non-Rigid to Rigid: Safe Acquisition of Rigid Communication Graphs under Limited Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Pushpak Jagtap, Saharsh, Vedhas Talnikar","submitted_at":"2026-07-11T07:20:20Z","abstract_excerpt":"Communication graph rigidity is a fundamental requirement in many multi robot formation control approaches. However, ensuring and maintaining a rigid communication topology becomes challenging in practice due to limited sensing ranges and dynamic operating conditions. This paper provides a method for achieving an inter robot collision free, rigid time varying communication graph, where communication links are established or broken according to limited sensing ranges, without assuming an initial rigid graph. In addition, the proposed approach guarantees the realization of a rigid graph for hete"},"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":"2607.10170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-07-11T07:20:20Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"e736dd10d777013b43360cb05df19e19e97d754817cc57fc8b78cd5b71a2796a","abstract_canon_sha256":"b3eccf9646ca97639af8e48b1a604c93afea0cae32eeb4c2f7be5edbc054bc84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:28.583269Z","signature_b64":"wPKuqqwb9JsgNhrpwTSjEpzcalElTOzuIpWaqmIztj6gS8hSVSN/rI6yfR+b0JFqHc6q4Tu6gdDo+D+kibZyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f906d4d1d686a03a03ce40e3e11733fb88529a752446fe719a78ebf25c0ac3ec","last_reissued_at":"2026-07-14T01:20:28.582396Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:28.582396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Non-Rigid to Rigid: Safe Acquisition of Rigid Communication Graphs under Limited Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Pushpak Jagtap, Saharsh, Vedhas Talnikar","submitted_at":"2026-07-11T07:20:20Z","abstract_excerpt":"Communication graph rigidity is a fundamental requirement in many multi robot formation control approaches. However, ensuring and maintaining a rigid communication topology becomes challenging in practice due to limited sensing ranges and dynamic operating conditions. This paper provides a method for achieving an inter robot collision free, rigid time varying communication graph, where communication links are established or broken according to limited sensing ranges, without assuming an initial rigid graph. In addition, the proposed approach guarantees the realization of a rigid graph for hete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10170","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.10170/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.10170","created_at":"2026-07-14T01:20:28.582855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10170v1","created_at":"2026-07-14T01:20:28.582855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10170","created_at":"2026-07-14T01:20:28.582855+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EDNJUOWQ2QD","created_at":"2026-07-14T01:20:28.582855+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EDNJUOWQ2QDUA6O","created_at":"2026-07-14T01:20:28.582855+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EDNJUOW","created_at":"2026-07-14T01:20:28.582855+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/7EDNJUOWQ2QDUA6OIDR6CFZT7O","json":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O.json","graph_json":"https://pith.science/api/pith-number/7EDNJUOWQ2QDUA6OIDR6CFZT7O/graph.json","events_json":"https://pith.science/api/pith-number/7EDNJUOWQ2QDUA6OIDR6CFZT7O/events.json","paper":"https://pith.science/paper/7EDNJUOW"},"agent_actions":{"view_html":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O","download_json":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O.json","view_paper":"https://pith.science/paper/7EDNJUOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10170&json=true","fetch_graph":"https://pith.science/api/pith-number/7EDNJUOWQ2QDUA6OIDR6CFZT7O/graph.json","fetch_events":"https://pith.science/api/pith-number/7EDNJUOWQ2QDUA6OIDR6CFZT7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O/action/storage_attestation","attest_author":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O/action/author_attestation","sign_citation":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O/action/citation_signature","submit_replication":"https://pith.science/pith/7EDNJUOWQ2QDUA6OIDR6CFZT7O/action/replication_record"}},"created_at":"2026-07-14T01:20:28.582855+00:00","updated_at":"2026-07-14T01:20:28.582855+00:00"}