{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AZJ7MPSGSQ4AWRUE2C6LDDY7AO","short_pith_number":"pith:AZJ7MPSG","schema_version":"1.0","canonical_sha256":"0653f63e4694380b4684d0bcb18f1f038f37b661a4c974e94a93fd2a40db47f4","source":{"kind":"arxiv","id":"1905.08526","version":1},"attestation_state":"computed","paper":{"title":"Coding theory for noiseless channels realized by anonymous oblivious mobile robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Masafumi Yamashita, Yukiko Yamauchi","submitted_at":"2019-05-21T10:02:49Z","abstract_excerpt":"We propose an information transmission scheme by a swarm of anonymous oblivious mobile robots on a graph. The swarm of robots travel from a sender vertex to a receiver vertex to transmit a symbol generated at the sender. The codeword for a symbol is a pair of an initial configuration at the sender and a set of terminal configurations at the receiver. The set of such codewords forms a code. We analyze the performance of the proposed scheme in terms of its code size and transmission delay. We first demonstrate that a lower bound of the transmission delay depends on the size of the swarm, and the"},"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":"1905.08526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-21T10:02:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"f04fae09ce7e1692f4751c16a0566b966031bb40a165e2f5a1320cf9e9ea9b67","abstract_canon_sha256":"d995ef0b09cd5789549d93a1ecb6b07e8d5532d6c54d34a2ea6c9199cb3ffa20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:42.932160Z","signature_b64":"TpJpzkmO6TtIG7sB3/bLW+HI/+lF97hPONPvGs7o3WIeEHDnzYVgi/elolDFQwt/vUMq+UdyUe+zWzT2n3MNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0653f63e4694380b4684d0bcb18f1f038f37b661a4c974e94a93fd2a40db47f4","last_reissued_at":"2026-05-17T23:45:42.931436Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:42.931436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding theory for noiseless channels realized by anonymous oblivious mobile robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Masafumi Yamashita, Yukiko Yamauchi","submitted_at":"2019-05-21T10:02:49Z","abstract_excerpt":"We propose an information transmission scheme by a swarm of anonymous oblivious mobile robots on a graph. The swarm of robots travel from a sender vertex to a receiver vertex to transmit a symbol generated at the sender. The codeword for a symbol is a pair of an initial configuration at the sender and a set of terminal configurations at the receiver. The set of such codewords forms a code. We analyze the performance of the proposed scheme in terms of its code size and transmission delay. We first demonstrate that a lower bound of the transmission delay depends on the size of the swarm, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08526","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":"1905.08526","created_at":"2026-05-17T23:45:42.931551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08526v1","created_at":"2026-05-17T23:45:42.931551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08526","created_at":"2026-05-17T23:45:42.931551+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZJ7MPSGSQ4A","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZJ7MPSGSQ4AWRUE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZJ7MPSG","created_at":"2026-05-18T12:33:12.712433+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/AZJ7MPSGSQ4AWRUE2C6LDDY7AO","json":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO.json","graph_json":"https://pith.science/api/pith-number/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/graph.json","events_json":"https://pith.science/api/pith-number/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/events.json","paper":"https://pith.science/paper/AZJ7MPSG"},"agent_actions":{"view_html":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO","download_json":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO.json","view_paper":"https://pith.science/paper/AZJ7MPSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08526&json=true","fetch_graph":"https://pith.science/api/pith-number/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/graph.json","fetch_events":"https://pith.science/api/pith-number/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/action/storage_attestation","attest_author":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/action/author_attestation","sign_citation":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/action/citation_signature","submit_replication":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/action/replication_record"}},"created_at":"2026-05-17T23:45:42.931551+00:00","updated_at":"2026-05-17T23:45:42.931551+00:00"}