{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SBXCIJUJSB5V6MNUC6FXAPKSTM","short_pith_number":"pith:SBXCIJUJ","schema_version":"1.0","canonical_sha256":"906e242689907b5f31b4178b703d529b13f6dc6e71b0c3946c103064399cbe64","source":{"kind":"arxiv","id":"0912.3441","version":1},"attestation_state":"computed","paper":{"title":"On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bernard Mans, Georgios Rodolakis, Philippe Jacquet","submitted_at":"2009-12-17T16:27:59Z","abstract_excerpt":"We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carry-forward routing. We define the capacity of a journey (i.e., a path in space and time, from a source to a destination) as the maximum amount of data that can be transferred from the source to the destination in the given journey. Combining a stochastic model (conveying all possible journeys) and an analysis of the durations of the nodes' encounters, we study the properties of journ"},"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":"0912.3441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-12-17T16:27:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"24cb443c690d385f53de1737d3b3df8a8193e77f4a00d609bf3540f591a8895f","abstract_canon_sha256":"8bbe8017a811d2e2a1ada7947749398030dcf3d8d5aedbc0e0c29d4f0dbecfda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.956632Z","signature_b64":"iupEZlk9cXHDRR5i2apPjIk/JcE6y47Zv32yYdhQn0scyPcy7NSkcbMfFjTzSPcQxQSImUfIRgvjx8w4JcdODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"906e242689907b5f31b4178b703d529b13f6dc6e71b0c3946c103064399cbe64","last_reissued_at":"2026-05-18T00:57:57.956063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.956063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bernard Mans, Georgios Rodolakis, Philippe Jacquet","submitted_at":"2009-12-17T16:27:59Z","abstract_excerpt":"We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carry-forward routing. We define the capacity of a journey (i.e., a path in space and time, from a source to a destination) as the maximum amount of data that can be transferred from the source to the destination in the given journey. Combining a stochastic model (conveying all possible journeys) and an analysis of the durations of the nodes' encounters, we study the properties of journ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.3441","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":"0912.3441","created_at":"2026-05-18T00:57:57.956149+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.3441v1","created_at":"2026-05-18T00:57:57.956149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.3441","created_at":"2026-05-18T00:57:57.956149+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBXCIJUJSB5V","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBXCIJUJSB5V6MNU","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBXCIJUJ","created_at":"2026-05-18T12:26:01.383474+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/SBXCIJUJSB5V6MNUC6FXAPKSTM","json":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM.json","graph_json":"https://pith.science/api/pith-number/SBXCIJUJSB5V6MNUC6FXAPKSTM/graph.json","events_json":"https://pith.science/api/pith-number/SBXCIJUJSB5V6MNUC6FXAPKSTM/events.json","paper":"https://pith.science/paper/SBXCIJUJ"},"agent_actions":{"view_html":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM","download_json":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM.json","view_paper":"https://pith.science/paper/SBXCIJUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.3441&json=true","fetch_graph":"https://pith.science/api/pith-number/SBXCIJUJSB5V6MNUC6FXAPKSTM/graph.json","fetch_events":"https://pith.science/api/pith-number/SBXCIJUJSB5V6MNUC6FXAPKSTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM/action/storage_attestation","attest_author":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM/action/author_attestation","sign_citation":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM/action/citation_signature","submit_replication":"https://pith.science/pith/SBXCIJUJSB5V6MNUC6FXAPKSTM/action/replication_record"}},"created_at":"2026-05-18T00:57:57.956149+00:00","updated_at":"2026-05-18T00:57:57.956149+00:00"}