{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BSB6GQXQYNIVLVLGV2XRQMFBXH","short_pith_number":"pith:BSB6GQXQ","schema_version":"1.0","canonical_sha256":"0c83e342f0c35155d566aeaf1830a1b9f90eb0e9f04afd657c71812d56748e3f","source":{"kind":"arxiv","id":"1709.07310","version":1},"attestation_state":"computed","paper":{"title":"Constant Bearing Pursuit on Branching Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.SY","authors_text":"Biswadip Dey, Kevin S. Galloway","submitted_at":"2017-09-21T13:27:30Z","abstract_excerpt":"Cyclic pursuit frameworks provide an efficient way to create useful global behaviors out of pairwise interactions in a collective of autonomous robots. Earlier work studied cyclic pursuit with a constant bearing (CB) pursuit law, and has demonstrated the existence of a variety of interesting behaviors for the corresponding dynamics. In this work, by attaching multiple branches to a single cycle, we introduce a modified version of this framework which allows us to consider any weakly connected pursuit graph where each node has an outdegree of 1. This provides a further generalization of the cyc"},"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":"1709.07310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-21T13:27:30Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"6739bc72195e303967d24b9bdef8e8cb14db173b6d740456ec5db1b9853f5714","abstract_canon_sha256":"8d0b18e7c5c51ff04dca4b59eec7ff55a4225d063a86392c3c81cfde060e3f9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:36.077522Z","signature_b64":"w3O0WuDYDRFF7veNPMHFoBgBf3ehxmXr9VskhQWohL5J8Y81k7KYqCBHJ3/jmNyd6hRiDsnqS8yoUgb5HjpQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c83e342f0c35155d566aeaf1830a1b9f90eb0e9f04afd657c71812d56748e3f","last_reissued_at":"2026-05-18T00:34:36.077069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:36.077069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Bearing Pursuit on Branching Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.SY","authors_text":"Biswadip Dey, Kevin S. Galloway","submitted_at":"2017-09-21T13:27:30Z","abstract_excerpt":"Cyclic pursuit frameworks provide an efficient way to create useful global behaviors out of pairwise interactions in a collective of autonomous robots. Earlier work studied cyclic pursuit with a constant bearing (CB) pursuit law, and has demonstrated the existence of a variety of interesting behaviors for the corresponding dynamics. In this work, by attaching multiple branches to a single cycle, we introduce a modified version of this framework which allows us to consider any weakly connected pursuit graph where each node has an outdegree of 1. This provides a further generalization of the cyc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07310","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":"1709.07310","created_at":"2026-05-18T00:34:36.077138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07310v1","created_at":"2026-05-18T00:34:36.077138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07310","created_at":"2026-05-18T00:34:36.077138+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSB6GQXQYNIV","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSB6GQXQYNIVLVLG","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSB6GQXQ","created_at":"2026-05-18T12:31:08.081275+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/BSB6GQXQYNIVLVLGV2XRQMFBXH","json":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH.json","graph_json":"https://pith.science/api/pith-number/BSB6GQXQYNIVLVLGV2XRQMFBXH/graph.json","events_json":"https://pith.science/api/pith-number/BSB6GQXQYNIVLVLGV2XRQMFBXH/events.json","paper":"https://pith.science/paper/BSB6GQXQ"},"agent_actions":{"view_html":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH","download_json":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH.json","view_paper":"https://pith.science/paper/BSB6GQXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07310&json=true","fetch_graph":"https://pith.science/api/pith-number/BSB6GQXQYNIVLVLGV2XRQMFBXH/graph.json","fetch_events":"https://pith.science/api/pith-number/BSB6GQXQYNIVLVLGV2XRQMFBXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH/action/storage_attestation","attest_author":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH/action/author_attestation","sign_citation":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH/action/citation_signature","submit_replication":"https://pith.science/pith/BSB6GQXQYNIVLVLGV2XRQMFBXH/action/replication_record"}},"created_at":"2026-05-18T00:34:36.077138+00:00","updated_at":"2026-05-18T00:34:36.077138+00:00"}