{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AZJ7MPSGSQ4AWRUE2C6LDDY7AO","short_pith_number":"pith:AZJ7MPSG","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"},"canonical_sha256":"0653f63e4694380b4684d0bcb18f1f038f37b661a4c974e94a93fd2a40db47f4","source":{"kind":"arxiv","id":"1905.08526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08526","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08526v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08526","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"AZJ7MPSGSQ4A","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AZJ7MPSGSQ4AWRUE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AZJ7MPSG","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AZJ7MPSGSQ4AWRUE2C6LDDY7AO","target":"record","payload":{"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"},"canonical_sha256":"0653f63e4694380b4684d0bcb18f1f038f37b661a4c974e94a93fd2a40db47f4","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"},"source_kind":"arxiv","source_id":"1905.08526","source_version":1,"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-05-17T23:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1BLJ6Rvz7iQfWv38DTqZxZ3Xshmpv7EjBAXoNdvfwC4q+VCxsfsAJuJtqo1DAUd5EHNmpExBbQlkq/RMwulAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:14:14.592582Z"},"content_sha256":"e1a9ef9d37f00de24ac83a2fd3b402d3bfcf86ad309a9eda86de966924a3efad","schema_version":"1.0","event_id":"sha256:e1a9ef9d37f00de24ac83a2fd3b402d3bfcf86ad309a9eda86de966924a3efad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AZJ7MPSGSQ4AWRUE2C6LDDY7AO","target":"graph","payload":{"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"},"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-05-17T23:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NskpHwFu1PYHl6DcHYgPiRh4ob3huyhmvChs9f3yc67fKM426OLIu2ig7adREdYtGvq6LlaqQ+VxdJuJi0fUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:14:14.593300Z"},"content_sha256":"dc662811717c1ca126f2c56bf95eddeab7f1524936e1344889b5738a54f8f694","schema_version":"1.0","event_id":"sha256:dc662811717c1ca126f2c56bf95eddeab7f1524936e1344889b5738a54f8f694"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/bundle.json","state_url":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/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-05-26T13:14:14Z","links":{"resolver":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO","bundle":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/bundle.json","state":"https://pith.science/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZJ7MPSGSQ4AWRUE2C6LDDY7AO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AZJ7MPSGSQ4AWRUE2C6LDDY7AO","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":"d995ef0b09cd5789549d93a1ecb6b07e8d5532d6c54d34a2ea6c9199cb3ffa20","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-21T10:02:49Z","title_canon_sha256":"f04fae09ce7e1692f4751c16a0566b966031bb40a165e2f5a1320cf9e9ea9b67"},"schema_version":"1.0","source":{"id":"1905.08526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08526","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08526v1","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08526","created_at":"2026-05-17T23:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"AZJ7MPSGSQ4A","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AZJ7MPSGSQ4AWRUE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AZJ7MPSG","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:dc662811717c1ca126f2c56bf95eddeab7f1524936e1344889b5738a54f8f694","target":"graph","created_at":"2026-05-17T23:45:42Z","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"},"paper":{"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","authors_text":"Masafumi Yamashita, Yukiko Yamauchi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-21T10:02:49Z","title":"Coding theory for noiseless channels realized by anonymous oblivious mobile robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08526","kind":"arxiv","version":1},"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:e1a9ef9d37f00de24ac83a2fd3b402d3bfcf86ad309a9eda86de966924a3efad","target":"record","created_at":"2026-05-17T23:45:42Z","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":"d995ef0b09cd5789549d93a1ecb6b07e8d5532d6c54d34a2ea6c9199cb3ffa20","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-21T10:02:49Z","title_canon_sha256":"f04fae09ce7e1692f4751c16a0566b966031bb40a165e2f5a1320cf9e9ea9b67"},"schema_version":"1.0","source":{"id":"1905.08526","kind":"arxiv","version":1}},"canonical_sha256":"0653f63e4694380b4684d0bcb18f1f038f37b661a4c974e94a93fd2a40db47f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0653f63e4694380b4684d0bcb18f1f038f37b661a4c974e94a93fd2a40db47f4","first_computed_at":"2026-05-17T23:45:42.931436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:42.931436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TpJpzkmO6TtIG7sB3/bLW+HI/+lF97hPONPvGs7o3WIeEHDnzYVgi/elolDFQwt/vUMq+UdyUe+zWzT2n3MNCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:42.932160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1a9ef9d37f00de24ac83a2fd3b402d3bfcf86ad309a9eda86de966924a3efad","sha256:dc662811717c1ca126f2c56bf95eddeab7f1524936e1344889b5738a54f8f694"],"state_sha256":"48189f502e4c047f358e2b72ed6c3ca6836129c6f1c53066bee33c8177b1dab9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGB8TGA9DfseYY3JkaW9M7U9MtgW1fTvsK7oK0QhWrAnJtOeqZQ77qCIZcOtnuGE54P9D2NYMbLQsuBSCw4pAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:14:14.597122Z","bundle_sha256":"1fe4f145535604c777651c097ec5a3a7fc12045e2a15df611c262240ad85267e"}}