{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VXLCWY77YZMRXKKCGIURDRI33R","short_pith_number":"pith:VXLCWY77","canonical_record":{"source":{"id":"2201.09337","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:25:46Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"785e9e570827e2c1623d50b9ce1b948cef1baea55a38fafb8594566d28b059ad","abstract_canon_sha256":"0048e3fe7a115c7831e65bf8d4aceb5b6315ab7d085bfa584c72a3826f8e8a73"},"schema_version":"1.0"},"canonical_sha256":"add62b63ffc6591ba942322911c51bdc56927bcb441c13a1e45c129f8af643d4","source":{"kind":"arxiv","id":"2201.09337","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09337","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09337v3","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09337","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"VXLCWY77YZMR","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"pith_short_16","alias_value":"VXLCWY77YZMRXKKC","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"pith_short_8","alias_value":"VXLCWY77","created_at":"2026-07-05T04:50:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VXLCWY77YZMRXKKCGIURDRI33R","target":"record","payload":{"canonical_record":{"source":{"id":"2201.09337","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:25:46Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"785e9e570827e2c1623d50b9ce1b948cef1baea55a38fafb8594566d28b059ad","abstract_canon_sha256":"0048e3fe7a115c7831e65bf8d4aceb5b6315ab7d085bfa584c72a3826f8e8a73"},"schema_version":"1.0"},"canonical_sha256":"add62b63ffc6591ba942322911c51bdc56927bcb441c13a1e45c129f8af643d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:50:33.173533Z","signature_b64":"DoEiNTX5S3BCBsRC6eOgzRnPmNwVJKmIy6kpznsAKl6INwXz/oQrDQbJS7SGXtbU07gGR0W/2IEiKs1ku7cPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add62b63ffc6591ba942322911c51bdc56927bcb441c13a1e45c129f8af643d4","last_reissued_at":"2026-07-05T04:50:33.173059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:50:33.173059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.09337","source_version":3,"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-07-05T04:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjb9EkhMsoSDfHmiKOQZKOjMl7PlaB3TC/9u3Ag0R2ldrBVSLN8ihtVnpwlPdzNBGdhfOdjMsPNIFIrezYClDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:17:09.713289Z"},"content_sha256":"06d679fc4fc3b49a4b0d4abc0ced93d986a345a4e17eb3b6e006a923c12bb7cb","schema_version":"1.0","event_id":"sha256:06d679fc4fc3b49a4b0d4abc0ced93d986a345a4e17eb3b6e006a923c12bb7cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VXLCWY77YZMRXKKCGIURDRI33R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Congestion control algorithms for robotic swarms with a common target based on the throughput of the target area","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Leandro Soriano Marcolino, Xavier Duquesne, Yuri Tavares dos Passos","submitted_at":"2022-01-23T18:25:46Z","abstract_excerpt":"When a large number of robots try to reach a common area, congestions happen, causing severe delays. To minimise congestion in a robotic swarm system, traffic control algorithms must be employed in a decentralised manner. Based on strategies aimed to maximise the throughput of the common target area, we developed two novel algorithms for robots using artificial potential fields for obstacle avoidance and navigation. One algorithm is inspired by creating a queue to get to the target area (Single Queue Former -- SQF), while the other makes the robots touch the boundary of the circular area by us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09337","kind":"arxiv","version":3},"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/2201.09337/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"},"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-07-05T04:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRseWzaKvj8lVRkj8Jr5f3w9nl+ov831Po292OPmr8nBwvrWP4kcCYlOwJWalf1mVQhoMIGf487r7tL6tpcUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:17:09.713799Z"},"content_sha256":"c1bb24361e3c150a9267637bfd8a6eb7bc34bc8e8c77ffea1c289b4e8492aab1","schema_version":"1.0","event_id":"sha256:c1bb24361e3c150a9267637bfd8a6eb7bc34bc8e8c77ffea1c289b4e8492aab1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXLCWY77YZMRXKKCGIURDRI33R/bundle.json","state_url":"https://pith.science/pith/VXLCWY77YZMRXKKCGIURDRI33R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXLCWY77YZMRXKKCGIURDRI33R/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-08-03T20:17:09Z","links":{"resolver":"https://pith.science/pith/VXLCWY77YZMRXKKCGIURDRI33R","bundle":"https://pith.science/pith/VXLCWY77YZMRXKKCGIURDRI33R/bundle.json","state":"https://pith.science/pith/VXLCWY77YZMRXKKCGIURDRI33R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXLCWY77YZMRXKKCGIURDRI33R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VXLCWY77YZMRXKKCGIURDRI33R","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":"0048e3fe7a115c7831e65bf8d4aceb5b6315ab7d085bfa584c72a3826f8e8a73","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:25:46Z","title_canon_sha256":"785e9e570827e2c1623d50b9ce1b948cef1baea55a38fafb8594566d28b059ad"},"schema_version":"1.0","source":{"id":"2201.09337","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09337","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09337v3","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09337","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"VXLCWY77YZMR","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"pith_short_16","alias_value":"VXLCWY77YZMRXKKC","created_at":"2026-07-05T04:50:33Z"},{"alias_kind":"pith_short_8","alias_value":"VXLCWY77","created_at":"2026-07-05T04:50:33Z"}],"graph_snapshots":[{"event_id":"sha256:c1bb24361e3c150a9267637bfd8a6eb7bc34bc8e8c77ffea1c289b4e8492aab1","target":"graph","created_at":"2026-07-05T04:50:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.09337/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When a large number of robots try to reach a common area, congestions happen, causing severe delays. To minimise congestion in a robotic swarm system, traffic control algorithms must be employed in a decentralised manner. Based on strategies aimed to maximise the throughput of the common target area, we developed two novel algorithms for robots using artificial potential fields for obstacle avoidance and navigation. One algorithm is inspired by creating a queue to get to the target area (Single Queue Former -- SQF), while the other makes the robots touch the boundary of the circular area by us","authors_text":"Leandro Soriano Marcolino, Xavier Duquesne, Yuri Tavares dos Passos","cross_cats":["cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:25:46Z","title":"Congestion control algorithms for robotic swarms with a common target based on the throughput of the target area"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09337","kind":"arxiv","version":3},"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:06d679fc4fc3b49a4b0d4abc0ced93d986a345a4e17eb3b6e006a923c12bb7cb","target":"record","created_at":"2026-07-05T04:50:33Z","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":"0048e3fe7a115c7831e65bf8d4aceb5b6315ab7d085bfa584c72a3826f8e8a73","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:25:46Z","title_canon_sha256":"785e9e570827e2c1623d50b9ce1b948cef1baea55a38fafb8594566d28b059ad"},"schema_version":"1.0","source":{"id":"2201.09337","kind":"arxiv","version":3}},"canonical_sha256":"add62b63ffc6591ba942322911c51bdc56927bcb441c13a1e45c129f8af643d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"add62b63ffc6591ba942322911c51bdc56927bcb441c13a1e45c129f8af643d4","first_computed_at":"2026-07-05T04:50:33.173059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:50:33.173059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DoEiNTX5S3BCBsRC6eOgzRnPmNwVJKmIy6kpznsAKl6INwXz/oQrDQbJS7SGXtbU07gGR0W/2IEiKs1ku7cPAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:50:33.173533Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.09337","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06d679fc4fc3b49a4b0d4abc0ced93d986a345a4e17eb3b6e006a923c12bb7cb","sha256:c1bb24361e3c150a9267637bfd8a6eb7bc34bc8e8c77ffea1c289b4e8492aab1"],"state_sha256":"77793b7e56870891e23de231afa4af71788c0319154aee8e359b765d26436f51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNEn/V1dbE+4u/sC6eZo6DmN/EVVJgaXfFrRbUCL6hjqQA+quwRnaNLdJIgGM2DgCE8Q51QjdaEDmO+gf0ymCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:17:09.717619Z","bundle_sha256":"105f035520c917c037415cc8f5d625f494d96ef712718c0b7f2d445dee5db240"}}