{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AQALETGQAMMOOUT7565UTKRXGV","short_pith_number":"pith:AQALETGQ","schema_version":"1.0","canonical_sha256":"0400b24cd00318e7527fefbb49aa3735436fce939823b42341d04e42c0a2612c","source":{"kind":"arxiv","id":"1508.01572","version":3},"attestation_state":"computed","paper":{"title":"Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","nlin.AO","physics.soc-ph"],"primary_cat":"cs.DC","authors_text":"Yukio Hayashi","submitted_at":"2015-08-07T00:06:30Z","abstract_excerpt":"An interrelation between a topological design of network and efficient algorithm on it is important for its applications to communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles. As a collective adaptive mechanism, the routing is realized by a relay of cyclic message-ferries corresponded to a concatenation of the triangle cycles and using some good prop"},"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":"1508.01572","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-07T00:06:30Z","cross_cats_sorted":["cs.NI","cs.SI","nlin.AO","physics.soc-ph"],"title_canon_sha256":"d0c093114c15ffebf4a9ffcdf14db0142e0a41bf34745d52d806bcbf3661e0fa","abstract_canon_sha256":"7ad2d484325256ef72cdf6fb6a18410b2082dec91837c1c0d2a7ffaea432c6dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.464330Z","signature_b64":"fCG6TC8QF+pH/NLYyOAdy3QzkKaDmVXA5e6V18IZScQRLi6sr3pyx7HIJ3E8XtoCm2ePO+OGJ38yPO6OrTanAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0400b24cd00318e7527fefbb49aa3735436fce939823b42341d04e42c0a2612c","last_reissued_at":"2026-05-18T00:57:50.463666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.463666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","nlin.AO","physics.soc-ph"],"primary_cat":"cs.DC","authors_text":"Yukio Hayashi","submitted_at":"2015-08-07T00:06:30Z","abstract_excerpt":"An interrelation between a topological design of network and efficient algorithm on it is important for its applications to communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles. As a collective adaptive mechanism, the routing is realized by a relay of cyclic message-ferries corresponded to a concatenation of the triangle cycles and using some good prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01572","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":"1508.01572","created_at":"2026-05-18T00:57:50.463801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01572v3","created_at":"2026-05-18T00:57:50.463801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01572","created_at":"2026-05-18T00:57:50.463801+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQALETGQAMMO","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQALETGQAMMOOUT7","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQALETGQ","created_at":"2026-05-18T12:29:10.953037+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/AQALETGQAMMOOUT7565UTKRXGV","json":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV.json","graph_json":"https://pith.science/api/pith-number/AQALETGQAMMOOUT7565UTKRXGV/graph.json","events_json":"https://pith.science/api/pith-number/AQALETGQAMMOOUT7565UTKRXGV/events.json","paper":"https://pith.science/paper/AQALETGQ"},"agent_actions":{"view_html":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV","download_json":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV.json","view_paper":"https://pith.science/paper/AQALETGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01572&json=true","fetch_graph":"https://pith.science/api/pith-number/AQALETGQAMMOOUT7565UTKRXGV/graph.json","fetch_events":"https://pith.science/api/pith-number/AQALETGQAMMOOUT7565UTKRXGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV/action/storage_attestation","attest_author":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV/action/author_attestation","sign_citation":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV/action/citation_signature","submit_replication":"https://pith.science/pith/AQALETGQAMMOOUT7565UTKRXGV/action/replication_record"}},"created_at":"2026-05-18T00:57:50.463801+00:00","updated_at":"2026-05-18T00:57:50.463801+00:00"}