{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QYAQKPHZVGKG4ILSKFLTFIGU5J","short_pith_number":"pith:QYAQKPHZ","schema_version":"1.0","canonical_sha256":"8601053cf9a9946e2172515732a0d4ea775991cfa39db6e593281a58886cb736","source":{"kind":"arxiv","id":"2305.11465","version":1},"attestation_state":"computed","paper":{"title":"Counterfactual Fairness Filter for Fair-Delay Multi-Robot Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Hikaru Asano, Mai Nishimura, Ryo Yonetani, Tadashi Kozuno","submitted_at":"2023-05-19T06:35:51Z","abstract_excerpt":"Multi-robot navigation is the task of finding trajectories for a team of robotic agents to reach their destinations as quickly as possible without collisions. In this work, we introduce a new problem: fair-delay multi-robot navigation, which aims not only to enable such efficient, safe travels but also to equalize the travel delays among agents in terms of actual trajectories as compared to the best possible trajectories. The learning of a navigation policy to achieve this objective requires resolving a nontrivial credit assignment problem with robotic agents having continuous action spaces. H"},"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":"2305.11465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2023-05-19T06:35:51Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"f35144fb9078bcc4b8540d4416206f3e6839746c33bc1d6c658343d0beff8764","abstract_canon_sha256":"c29221e1ab89a43558ee387a483bf3db7d9c873e925997a67567a7584bef6bd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:47.348197Z","signature_b64":"COovRqqqUoEiDloBEy5tKsT/bH8jI8hoQUsNWs9Jq/sTBQVDZJdJcqjaAlMC5lfKrXI6VklPRn8OnuIsGEyMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8601053cf9a9946e2172515732a0d4ea775991cfa39db6e593281a58886cb736","last_reissued_at":"2026-07-05T06:11:47.347719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:47.347719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counterfactual Fairness Filter for Fair-Delay Multi-Robot Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Hikaru Asano, Mai Nishimura, Ryo Yonetani, Tadashi Kozuno","submitted_at":"2023-05-19T06:35:51Z","abstract_excerpt":"Multi-robot navigation is the task of finding trajectories for a team of robotic agents to reach their destinations as quickly as possible without collisions. In this work, we introduce a new problem: fair-delay multi-robot navigation, which aims not only to enable such efficient, safe travels but also to equalize the travel delays among agents in terms of actual trajectories as compared to the best possible trajectories. The learning of a navigation policy to achieve this objective requires resolving a nontrivial credit assignment problem with robotic agents having continuous action spaces. H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11465","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/2305.11465/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":"2305.11465","created_at":"2026-07-05T06:11:47.347785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.11465v1","created_at":"2026-07-05T06:11:47.347785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11465","created_at":"2026-07-05T06:11:47.347785+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYAQKPHZVGKG","created_at":"2026-07-05T06:11:47.347785+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYAQKPHZVGKG4ILS","created_at":"2026-07-05T06:11:47.347785+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYAQKPHZ","created_at":"2026-07-05T06:11:47.347785+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/QYAQKPHZVGKG4ILSKFLTFIGU5J","json":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J.json","graph_json":"https://pith.science/api/pith-number/QYAQKPHZVGKG4ILSKFLTFIGU5J/graph.json","events_json":"https://pith.science/api/pith-number/QYAQKPHZVGKG4ILSKFLTFIGU5J/events.json","paper":"https://pith.science/paper/QYAQKPHZ"},"agent_actions":{"view_html":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J","download_json":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J.json","view_paper":"https://pith.science/paper/QYAQKPHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.11465&json=true","fetch_graph":"https://pith.science/api/pith-number/QYAQKPHZVGKG4ILSKFLTFIGU5J/graph.json","fetch_events":"https://pith.science/api/pith-number/QYAQKPHZVGKG4ILSKFLTFIGU5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J/action/storage_attestation","attest_author":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J/action/author_attestation","sign_citation":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J/action/citation_signature","submit_replication":"https://pith.science/pith/QYAQKPHZVGKG4ILSKFLTFIGU5J/action/replication_record"}},"created_at":"2026-07-05T06:11:47.347785+00:00","updated_at":"2026-07-05T06:11:47.347785+00:00"}