{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QFENVSDMDZ52466UAVP2M7YRUL","short_pith_number":"pith:QFENVSDM","schema_version":"1.0","canonical_sha256":"8148dac86c1e7bae7bd4055fa67f11a2c0ce7fb6f7692689970e0bcafda5bdac","source":{"kind":"arxiv","id":"1505.06596","version":3},"attestation_state":"computed","paper":{"title":"Partial Gathering of Mobile Agents in Asynchronous Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fukuhito Ooshita, Hirotsugu Kakugawa, Masahiro Shibata, Shinji Kawai, Toshimitsu Masuzawa","submitted_at":"2015-05-25T11:29:29Z","abstract_excerpt":"In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is a new generalization of the total gathering problem. The partial gathering problem requires, for a given integer $g$, that each agent should move to a node and terminate so that at least $g$ agents should meet at the same node. The requirement for the partial gathering problem is weaker than that for the (well-investigated) total gathering problem, and thus, we have interests in clarifying the difference on the move "},"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":"1505.06596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-25T11:29:29Z","cross_cats_sorted":[],"title_canon_sha256":"253711133ffeada81db6e033f784e13a39bbb096eb6bea8467bb6cca44b86913","abstract_canon_sha256":"76f10ffe5d60d8472dd5de74c7ba1b1c16304234c7577de7f98f944653cfc9b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.070769Z","signature_b64":"mui1tKzUC2nQh9jRSm5CuBujLb41ovajUJZ93l/FAqz1OS1D9teDPE4jrCdxsjLoveznBfiyU/XJZt8FiasVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8148dac86c1e7bae7bd4055fa67f11a2c0ce7fb6f7692689970e0bcafda5bdac","last_reissued_at":"2026-05-18T01:33:32.070213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.070213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Gathering of Mobile Agents in Asynchronous Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fukuhito Ooshita, Hirotsugu Kakugawa, Masahiro Shibata, Shinji Kawai, Toshimitsu Masuzawa","submitted_at":"2015-05-25T11:29:29Z","abstract_excerpt":"In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is a new generalization of the total gathering problem. The partial gathering problem requires, for a given integer $g$, that each agent should move to a node and terminate so that at least $g$ agents should meet at the same node. The requirement for the partial gathering problem is weaker than that for the (well-investigated) total gathering problem, and thus, we have interests in clarifying the difference on the move "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06596","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":""},"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":"1505.06596","created_at":"2026-05-18T01:33:32.070291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06596v3","created_at":"2026-05-18T01:33:32.070291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06596","created_at":"2026-05-18T01:33:32.070291+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFENVSDMDZ52","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFENVSDMDZ52466U","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFENVSDM","created_at":"2026-05-18T12:29:37.295048+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/QFENVSDMDZ52466UAVP2M7YRUL","json":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL.json","graph_json":"https://pith.science/api/pith-number/QFENVSDMDZ52466UAVP2M7YRUL/graph.json","events_json":"https://pith.science/api/pith-number/QFENVSDMDZ52466UAVP2M7YRUL/events.json","paper":"https://pith.science/paper/QFENVSDM"},"agent_actions":{"view_html":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL","download_json":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL.json","view_paper":"https://pith.science/paper/QFENVSDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06596&json=true","fetch_graph":"https://pith.science/api/pith-number/QFENVSDMDZ52466UAVP2M7YRUL/graph.json","fetch_events":"https://pith.science/api/pith-number/QFENVSDMDZ52466UAVP2M7YRUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL/action/storage_attestation","attest_author":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL/action/author_attestation","sign_citation":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL/action/citation_signature","submit_replication":"https://pith.science/pith/QFENVSDMDZ52466UAVP2M7YRUL/action/replication_record"}},"created_at":"2026-05-18T01:33:32.070291+00:00","updated_at":"2026-05-18T01:33:32.070291+00:00"}