{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4ROHLVPAQEJ6F7SVSKQV27VHJP","short_pith_number":"pith:4ROHLVPA","canonical_record":{"source":{"id":"1112.4773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-20T17:12:08Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"ac6afb43dffb62d5491702ee601873b2df0a395e92344b8758ebcfed8ac865b6","abstract_canon_sha256":"3888034d364ac4431cac8c324c8e297b780da9be1bea28689ff31aaec5323c3f"},"schema_version":"1.0"},"canonical_sha256":"e45c75d5e08113e2fe5592a15d7ea74bf4ff94651e3918bc5f5d76b1bebf95cd","source":{"kind":"arxiv","id":"1112.4773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4773","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4773v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4773","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"4ROHLVPAQEJ6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4ROHLVPAQEJ6F7SV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4ROHLVPA","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4ROHLVPAQEJ6F7SVSKQV27VHJP","target":"record","payload":{"canonical_record":{"source":{"id":"1112.4773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-20T17:12:08Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"ac6afb43dffb62d5491702ee601873b2df0a395e92344b8758ebcfed8ac865b6","abstract_canon_sha256":"3888034d364ac4431cac8c324c8e297b780da9be1bea28689ff31aaec5323c3f"},"schema_version":"1.0"},"canonical_sha256":"e45c75d5e08113e2fe5592a15d7ea74bf4ff94651e3918bc5f5d76b1bebf95cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:58.089269Z","signature_b64":"V4+Sh7Nxjmtp9lzlpCn7u3wY+l2NekyigCVf1rDRwzCpTOrM+o0+XfyanBV3pgVip68cmEZ8T4892n5pUNtYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e45c75d5e08113e2fe5592a15d7ea74bf4ff94651e3918bc5f5d76b1bebf95cd","last_reissued_at":"2026-05-18T04:05:58.088793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:58.088793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.4773","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-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dq+MGqJa4K3rtqmmJNKiSPxOFFLfgIWsLWtE5wR2tGHpFYfO0huHNWQ9Ea+12A4G5kKKfZ6PpjQFjN1kRfxJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:30:07.017991Z"},"content_sha256":"616a34043b31f2932e712ff409d07f8408839109d085b6ecde78724215ae74cf","schema_version":"1.0","event_id":"sha256:616a34043b31f2932e712ff409d07f8408839109d085b6ecde78724215ae74cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4ROHLVPAQEJ6F7SVSKQV27VHJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy routing on networks of mobile agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cs.NI","authors_text":"Bing-Hong Wang, Han-Xin Yang, Wen-Xu Wang, Ying-Cheng Lai","submitted_at":"2011-12-20T17:12:08Z","abstract_excerpt":"In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent $i$ is delivered to the agent $j$ whose distance from the destination is shortest among searched neighbors of agent $i$. Based on the greedy routing, we study the traffic dynamics and traffic-driven epidemic spreading on networks of mobile agents. We find that the transportation capacity of networks and the epidemic threshold increase as the communication radius increases. For moderate moving speed, the transportation capacity of networks is the highest and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4773","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-18T04:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdzGlm2IkLY9KjLD0rQ0V3waQPvH1dZJIYG9Nyc+iPxLa/RUvegIDiSXxMxRImfEp395zpqd0mBWhFIL7ZFnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:30:07.018767Z"},"content_sha256":"4597fb5955fe8fe2f93fb2681a99d4f079fef03983a1ad3d730a4a6cdae27058","schema_version":"1.0","event_id":"sha256:4597fb5955fe8fe2f93fb2681a99d4f079fef03983a1ad3d730a4a6cdae27058"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ROHLVPAQEJ6F7SVSKQV27VHJP/bundle.json","state_url":"https://pith.science/pith/4ROHLVPAQEJ6F7SVSKQV27VHJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ROHLVPAQEJ6F7SVSKQV27VHJP/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-06-08T06:30:07Z","links":{"resolver":"https://pith.science/pith/4ROHLVPAQEJ6F7SVSKQV27VHJP","bundle":"https://pith.science/pith/4ROHLVPAQEJ6F7SVSKQV27VHJP/bundle.json","state":"https://pith.science/pith/4ROHLVPAQEJ6F7SVSKQV27VHJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ROHLVPAQEJ6F7SVSKQV27VHJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4ROHLVPAQEJ6F7SVSKQV27VHJP","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":"3888034d364ac4431cac8c324c8e297b780da9be1bea28689ff31aaec5323c3f","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-20T17:12:08Z","title_canon_sha256":"ac6afb43dffb62d5491702ee601873b2df0a395e92344b8758ebcfed8ac865b6"},"schema_version":"1.0","source":{"id":"1112.4773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4773","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4773v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4773","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"4ROHLVPAQEJ6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4ROHLVPAQEJ6F7SV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4ROHLVPA","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:4597fb5955fe8fe2f93fb2681a99d4f079fef03983a1ad3d730a4a6cdae27058","target":"graph","created_at":"2026-05-18T04:05:58Z","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":"In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent $i$ is delivered to the agent $j$ whose distance from the destination is shortest among searched neighbors of agent $i$. Based on the greedy routing, we study the traffic dynamics and traffic-driven epidemic spreading on networks of mobile agents. We find that the transportation capacity of networks and the epidemic threshold increase as the communication radius increases. For moderate moving speed, the transportation capacity of networks is the highest and","authors_text":"Bing-Hong Wang, Han-Xin Yang, Wen-Xu Wang, Ying-Cheng Lai","cross_cats":["physics.data-an"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-20T17:12:08Z","title":"Greedy routing on networks of mobile agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4773","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:616a34043b31f2932e712ff409d07f8408839109d085b6ecde78724215ae74cf","target":"record","created_at":"2026-05-18T04:05:58Z","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":"3888034d364ac4431cac8c324c8e297b780da9be1bea28689ff31aaec5323c3f","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-20T17:12:08Z","title_canon_sha256":"ac6afb43dffb62d5491702ee601873b2df0a395e92344b8758ebcfed8ac865b6"},"schema_version":"1.0","source":{"id":"1112.4773","kind":"arxiv","version":1}},"canonical_sha256":"e45c75d5e08113e2fe5592a15d7ea74bf4ff94651e3918bc5f5d76b1bebf95cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e45c75d5e08113e2fe5592a15d7ea74bf4ff94651e3918bc5f5d76b1bebf95cd","first_computed_at":"2026-05-18T04:05:58.088793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:58.088793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V4+Sh7Nxjmtp9lzlpCn7u3wY+l2NekyigCVf1rDRwzCpTOrM+o0+XfyanBV3pgVip68cmEZ8T4892n5pUNtYBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:58.089269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:616a34043b31f2932e712ff409d07f8408839109d085b6ecde78724215ae74cf","sha256:4597fb5955fe8fe2f93fb2681a99d4f079fef03983a1ad3d730a4a6cdae27058"],"state_sha256":"93859ed2d940529498752a257c8e456514ba7fee2f1605af467127829b747718"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33kRVh2VSaWvX2qJ9sYymHP6bDf3E9H+hlv+0XMlRgT4ikVer8KX8/mQD986iPbuSJ3w9UX2oXLXwPJDaq3cAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:30:07.023047Z","bundle_sha256":"c026ac5a020009ac7171e50ec450547d2511000a4e13a7564d1f6da3d7bcf179"}}