{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HJKZTRJNRMFMHZBSQ7JDPUHJSY","short_pith_number":"pith:HJKZTRJN","schema_version":"1.0","canonical_sha256":"3a5599c52d8b0ac3e43287d237d0e99629aad39339458c61318dd438c22e00b8","source":{"kind":"arxiv","id":"1903.09259","version":1},"attestation_state":"computed","paper":{"title":"Local Interactions for Cohesive Flexible Swarms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Alfred M. Bruckstein, Ariel Barel, Rotem Manor","submitted_at":"2019-03-21T22:14:46Z","abstract_excerpt":"Distributed gathering algorithms aim to achieve complete visibility graphs via a \"never lose a neighbour\" policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order n. This allows to achieve different goals and swarming behaviours: the system remains connected but flexible, hence can maneuver in environments that are replete with obstacles and narrow passages, etc."},"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":"1903.09259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-21T22:14:46Z","cross_cats_sorted":[],"title_canon_sha256":"1ebe36b141bb3f4d5b4557faf02b515a7a8f513cb75f26ea2294bad557dd5556","abstract_canon_sha256":"0d3b4a558d3e68ee416e7b00accdd71338a586071b2b92706a240e04dc961bd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:40.183950Z","signature_b64":"tUq9GRON5mSV9Sgv+OsGUhma7eLXB9tksFCLtaGw5TbIy/c9BdOzo1d3Wp7u5hyVQASdWdtqXYGkDcZKvxLvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a5599c52d8b0ac3e43287d237d0e99629aad39339458c61318dd438c22e00b8","last_reissued_at":"2026-05-17T23:50:40.183425Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:40.183425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Interactions for Cohesive Flexible Swarms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Alfred M. Bruckstein, Ariel Barel, Rotem Manor","submitted_at":"2019-03-21T22:14:46Z","abstract_excerpt":"Distributed gathering algorithms aim to achieve complete visibility graphs via a \"never lose a neighbour\" policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order n. This allows to achieve different goals and swarming behaviours: the system remains connected but flexible, hence can maneuver in environments that are replete with obstacles and narrow passages, etc."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09259","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.09259","created_at":"2026-05-17T23:50:40.183518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09259v1","created_at":"2026-05-17T23:50:40.183518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09259","created_at":"2026-05-17T23:50:40.183518+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJKZTRJNRMFM","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJKZTRJNRMFMHZBS","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJKZTRJN","created_at":"2026-05-18T12:33:18.533446+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/HJKZTRJNRMFMHZBSQ7JDPUHJSY","json":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY.json","graph_json":"https://pith.science/api/pith-number/HJKZTRJNRMFMHZBSQ7JDPUHJSY/graph.json","events_json":"https://pith.science/api/pith-number/HJKZTRJNRMFMHZBSQ7JDPUHJSY/events.json","paper":"https://pith.science/paper/HJKZTRJN"},"agent_actions":{"view_html":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY","download_json":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY.json","view_paper":"https://pith.science/paper/HJKZTRJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09259&json=true","fetch_graph":"https://pith.science/api/pith-number/HJKZTRJNRMFMHZBSQ7JDPUHJSY/graph.json","fetch_events":"https://pith.science/api/pith-number/HJKZTRJNRMFMHZBSQ7JDPUHJSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY/action/storage_attestation","attest_author":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY/action/author_attestation","sign_citation":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY/action/citation_signature","submit_replication":"https://pith.science/pith/HJKZTRJNRMFMHZBSQ7JDPUHJSY/action/replication_record"}},"created_at":"2026-05-17T23:50:40.183518+00:00","updated_at":"2026-05-17T23:50:40.183518+00:00"}