{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ECC4MHMWPYKUHXK5HPTECT4TA5","short_pith_number":"pith:ECC4MHMW","canonical_record":{"source":{"id":"2201.09335","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:16:12Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"8e1fefe48f739f359adccc204979f8be51a57f84707a6943f8b7514fbd712dea","abstract_canon_sha256":"dda0ccd2bbb8318051e7db943db14bc07d24ea5280bc868814027651efae0ba4"},"schema_version":"1.0"},"canonical_sha256":"2085c61d967e1543dd5d3be6414f93077afea7cf2b925136b61aea1e60a193fc","source":{"kind":"arxiv","id":"2201.09335","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09335","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09335v3","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09335","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"ECC4MHMWPYKU","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"pith_short_16","alias_value":"ECC4MHMWPYKUHXK5","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"pith_short_8","alias_value":"ECC4MHMW","created_at":"2026-07-05T04:10:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ECC4MHMWPYKUHXK5HPTECT4TA5","target":"record","payload":{"canonical_record":{"source":{"id":"2201.09335","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:16:12Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"8e1fefe48f739f359adccc204979f8be51a57f84707a6943f8b7514fbd712dea","abstract_canon_sha256":"dda0ccd2bbb8318051e7db943db14bc07d24ea5280bc868814027651efae0ba4"},"schema_version":"1.0"},"canonical_sha256":"2085c61d967e1543dd5d3be6414f93077afea7cf2b925136b61aea1e60a193fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:00.765260Z","signature_b64":"1WxYfUf2E6DOBE4PTh5Kwkt4D8qaZzZmcJi/tLIblK8rGrhInMeBS8y9cddctqgYCukbWVltUFi6H8zSOf21Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2085c61d967e1543dd5d3be6414f93077afea7cf2b925136b61aea1e60a193fc","last_reissued_at":"2026-07-05T04:10:00.764847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:00.764847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.09335","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:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kEXoe4ZiDosRVCJf9D/k4TcfwZm+LebSlAW/VArprZGi3sK/98yjMQ7FQfT+3pox/krZizSLvqy9sBbx2n5UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:04:10.249829Z"},"content_sha256":"454f7158a82b6ea758ee10b11a75212283ef75d26e67232c6e81e885e2ffebcc","schema_version":"1.0","event_id":"sha256:454f7158a82b6ea758ee10b11a75212283ef75d26e67232c6e81e885e2ffebcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ECC4MHMWPYKUHXK5HPTECT4TA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the throughput of the common target area for robotic swarm strategies -- extended version","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:16:12Z","abstract_excerpt":"A robotic swarm may encounter traffic congestion when many robots simultaneously attempt to reach the same area. For solving that efficiently, robots must execute decentralised traffic control algorithms. In this work, we propose a measure for evaluating the access efficiency of a common target area as the number of robots in the swarm rises: the common target area throughput. We also employ here the target area asymptotic throughput -- that is, the throughput of a target region with a limited area as the time tends to infinity -- because it is always finite as the number of robots grows, oppo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09335","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.09335/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:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAZFCO1Xao2NyC/MG48nArccaLaLyEnSZ3DJL0nT55s8H7wqo5ckjAL/jvHhVoD/MkdpboUJxnM1PWkiAhR3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:04:10.250494Z"},"content_sha256":"6df0e8d0e8f2f7b994e13acaae1e0a3a0e917965940d4c8d7e7e3fb1fbe2c119","schema_version":"1.0","event_id":"sha256:6df0e8d0e8f2f7b994e13acaae1e0a3a0e917965940d4c8d7e7e3fb1fbe2c119"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECC4MHMWPYKUHXK5HPTECT4TA5/bundle.json","state_url":"https://pith.science/pith/ECC4MHMWPYKUHXK5HPTECT4TA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECC4MHMWPYKUHXK5HPTECT4TA5/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-07-09T05:04:10Z","links":{"resolver":"https://pith.science/pith/ECC4MHMWPYKUHXK5HPTECT4TA5","bundle":"https://pith.science/pith/ECC4MHMWPYKUHXK5HPTECT4TA5/bundle.json","state":"https://pith.science/pith/ECC4MHMWPYKUHXK5HPTECT4TA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECC4MHMWPYKUHXK5HPTECT4TA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ECC4MHMWPYKUHXK5HPTECT4TA5","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":"dda0ccd2bbb8318051e7db943db14bc07d24ea5280bc868814027651efae0ba4","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:16:12Z","title_canon_sha256":"8e1fefe48f739f359adccc204979f8be51a57f84707a6943f8b7514fbd712dea"},"schema_version":"1.0","source":{"id":"2201.09335","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09335","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09335v3","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09335","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"ECC4MHMWPYKU","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"pith_short_16","alias_value":"ECC4MHMWPYKUHXK5","created_at":"2026-07-05T04:10:00Z"},{"alias_kind":"pith_short_8","alias_value":"ECC4MHMW","created_at":"2026-07-05T04:10:00Z"}],"graph_snapshots":[{"event_id":"sha256:6df0e8d0e8f2f7b994e13acaae1e0a3a0e917965940d4c8d7e7e3fb1fbe2c119","target":"graph","created_at":"2026-07-05T04:10:00Z","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.09335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A robotic swarm may encounter traffic congestion when many robots simultaneously attempt to reach the same area. For solving that efficiently, robots must execute decentralised traffic control algorithms. In this work, we propose a measure for evaluating the access efficiency of a common target area as the number of robots in the swarm rises: the common target area throughput. We also employ here the target area asymptotic throughput -- that is, the throughput of a target region with a limited area as the time tends to infinity -- because it is always finite as the number of robots grows, oppo","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:16:12Z","title":"On the throughput of the common target area for robotic swarm strategies -- extended version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09335","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:454f7158a82b6ea758ee10b11a75212283ef75d26e67232c6e81e885e2ffebcc","target":"record","created_at":"2026-07-05T04:10:00Z","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":"dda0ccd2bbb8318051e7db943db14bc07d24ea5280bc868814027651efae0ba4","cross_cats_sorted":["cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-01-23T18:16:12Z","title_canon_sha256":"8e1fefe48f739f359adccc204979f8be51a57f84707a6943f8b7514fbd712dea"},"schema_version":"1.0","source":{"id":"2201.09335","kind":"arxiv","version":3}},"canonical_sha256":"2085c61d967e1543dd5d3be6414f93077afea7cf2b925136b61aea1e60a193fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2085c61d967e1543dd5d3be6414f93077afea7cf2b925136b61aea1e60a193fc","first_computed_at":"2026-07-05T04:10:00.764847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:10:00.764847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1WxYfUf2E6DOBE4PTh5Kwkt4D8qaZzZmcJi/tLIblK8rGrhInMeBS8y9cddctqgYCukbWVltUFi6H8zSOf21Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:10:00.765260Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.09335","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:454f7158a82b6ea758ee10b11a75212283ef75d26e67232c6e81e885e2ffebcc","sha256:6df0e8d0e8f2f7b994e13acaae1e0a3a0e917965940d4c8d7e7e3fb1fbe2c119"],"state_sha256":"c72e93ec2ace3ce4d40d45d5ba86bce8d346a49859e28b0fb1c190ecd3a48b14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYI1xB3eZXp+D5foPtAU/nlYkD8mKWhnxef+yoEveEDAPbvl+qNJd4EM/PDd3oEurcUTyjiCmuN+sD3avbrqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:04:10.252850Z","bundle_sha256":"1781ced8a3cc20d960d95f2a6db11ec418500b694c816106d59a18ce65aaff99"}}