{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B4YNJPY4FEEUAYT46G6T6ARBQN","short_pith_number":"pith:B4YNJPY4","canonical_record":{"source":{"id":"1312.3766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-13T10:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"2d9f036ad8f9ea4d0f9303fe0f390483cced5fb7499faa97a259eb5c323155d5","abstract_canon_sha256":"57d78c71480d48d723974677c14759158d757620f5edcb70051187f879f354b4"},"schema_version":"1.0"},"canonical_sha256":"0f30d4bf1c290940627cf1bd3f02218350134c467be71dc26754b14b543032e4","source":{"kind":"arxiv","id":"1312.3766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3766","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3766v1","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3766","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"B4YNJPY4FEEU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B4YNJPY4FEEUAYT4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B4YNJPY4","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B4YNJPY4FEEUAYT46G6T6ARBQN","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-13T10:50:10Z","cross_cats_sorted":[],"title_canon_sha256":"2d9f036ad8f9ea4d0f9303fe0f390483cced5fb7499faa97a259eb5c323155d5","abstract_canon_sha256":"57d78c71480d48d723974677c14759158d757620f5edcb70051187f879f354b4"},"schema_version":"1.0"},"canonical_sha256":"0f30d4bf1c290940627cf1bd3f02218350134c467be71dc26754b14b543032e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:47.737652Z","signature_b64":"sO9XU1XyftHCHOCLd5+jZ6PD57QzDzmJoV8gK4VuFOwX0bnPGdEIl/fvOpdD1OVwfFqY4/cbdhC4Tqc5XHC1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f30d4bf1c290940627cf1bd3f02218350134c467be71dc26754b14b543032e4","last_reissued_at":"2026-05-18T03:04:47.736751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:47.736751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3766","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-18T03:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XGEKyMUoKR14MIbT6mlzNH67Hm++U9Ra/Yw+uldZDTqM/kwnnLh5Hx+CVHd69KkIY49j92X3CGqfljXQh1RCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:32:07.421410Z"},"content_sha256":"6788270b68b30357e84c3fc54c9b055556023da123d6de09f29b99c921cf5147","schema_version":"1.0","event_id":"sha256:6788270b68b30357e84c3fc54c9b055556023da123d6de09f29b99c921cf5147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B4YNJPY4FEEUAYT46G6T6ARBQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beaconing-Aware Optimal Policies for Two-Hop Routing in Multi-Class Delay Tolerant Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Luca Goffredi, Matteo Cesana, Nicola Basilico, Nicola Gatti","submitted_at":"2013-12-13T10:50:10Z","abstract_excerpt":"In Delay Tolerant Networks (DTNs), two-hop routing compromises energy versus delay more conveniently than epidemic routing. Literature provides comprehensive results on optimal routing policies for mobile nodes with homogeneous mobility, often neglecting signaling costs. Routing policies are customarily computed by means of fluid approximation techniques, which assure solutions to be optimal only when the number of nodes is infinite, while they provide a coarse approximation otherwise. This work addresses heterogeneous mobility patterns and multiple wireless transmission technologies; moreover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3766","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-18T03:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFLowUxUc7d4DnQKWBMoZDGIRuj0vdzvbXEDeTOoLQSRitOJiejFe6wJ8oKsbb/EubyjiJAWBJMBlq43gZuhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:32:07.421788Z"},"content_sha256":"64c1b4447fc2cd1a6981260f12dfd50aba89f681a0faaac9a53bbfcd03e91254","schema_version":"1.0","event_id":"sha256:64c1b4447fc2cd1a6981260f12dfd50aba89f681a0faaac9a53bbfcd03e91254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4YNJPY4FEEUAYT46G6T6ARBQN/bundle.json","state_url":"https://pith.science/pith/B4YNJPY4FEEUAYT46G6T6ARBQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4YNJPY4FEEUAYT46G6T6ARBQN/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-23T07:32:07Z","links":{"resolver":"https://pith.science/pith/B4YNJPY4FEEUAYT46G6T6ARBQN","bundle":"https://pith.science/pith/B4YNJPY4FEEUAYT46G6T6ARBQN/bundle.json","state":"https://pith.science/pith/B4YNJPY4FEEUAYT46G6T6ARBQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4YNJPY4FEEUAYT46G6T6ARBQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B4YNJPY4FEEUAYT46G6T6ARBQN","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":"57d78c71480d48d723974677c14759158d757620f5edcb70051187f879f354b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-13T10:50:10Z","title_canon_sha256":"2d9f036ad8f9ea4d0f9303fe0f390483cced5fb7499faa97a259eb5c323155d5"},"schema_version":"1.0","source":{"id":"1312.3766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3766","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3766v1","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3766","created_at":"2026-05-18T03:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"B4YNJPY4FEEU","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B4YNJPY4FEEUAYT4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B4YNJPY4","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:64c1b4447fc2cd1a6981260f12dfd50aba89f681a0faaac9a53bbfcd03e91254","target":"graph","created_at":"2026-05-18T03:04:47Z","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 Delay Tolerant Networks (DTNs), two-hop routing compromises energy versus delay more conveniently than epidemic routing. Literature provides comprehensive results on optimal routing policies for mobile nodes with homogeneous mobility, often neglecting signaling costs. Routing policies are customarily computed by means of fluid approximation techniques, which assure solutions to be optimal only when the number of nodes is infinite, while they provide a coarse approximation otherwise. This work addresses heterogeneous mobility patterns and multiple wireless transmission technologies; moreover","authors_text":"Luca Goffredi, Matteo Cesana, Nicola Basilico, Nicola Gatti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-13T10:50:10Z","title":"Beaconing-Aware Optimal Policies for Two-Hop Routing in Multi-Class Delay Tolerant Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3766","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:6788270b68b30357e84c3fc54c9b055556023da123d6de09f29b99c921cf5147","target":"record","created_at":"2026-05-18T03:04:47Z","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":"57d78c71480d48d723974677c14759158d757620f5edcb70051187f879f354b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-13T10:50:10Z","title_canon_sha256":"2d9f036ad8f9ea4d0f9303fe0f390483cced5fb7499faa97a259eb5c323155d5"},"schema_version":"1.0","source":{"id":"1312.3766","kind":"arxiv","version":1}},"canonical_sha256":"0f30d4bf1c290940627cf1bd3f02218350134c467be71dc26754b14b543032e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f30d4bf1c290940627cf1bd3f02218350134c467be71dc26754b14b543032e4","first_computed_at":"2026-05-18T03:04:47.736751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:47.736751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sO9XU1XyftHCHOCLd5+jZ6PD57QzDzmJoV8gK4VuFOwX0bnPGdEIl/fvOpdD1OVwfFqY4/cbdhC4Tqc5XHC1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:47.737652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6788270b68b30357e84c3fc54c9b055556023da123d6de09f29b99c921cf5147","sha256:64c1b4447fc2cd1a6981260f12dfd50aba89f681a0faaac9a53bbfcd03e91254"],"state_sha256":"ba4a1b2167f6b57b6aba9f0fc63393eb5ce0bf6a8e3296315108c6c07849a7a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"48mHUS1nxG+MkZswJRkyXereZRuYl24GLPH4yZ9gy6GxC5cYp5kK970N/1OKDCw41kGJLs2YfezDhLjI+omXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T07:32:07.424855Z","bundle_sha256":"42e1cc9849a497e7fe704443d5a9e8f16d3af7737eb48222d9a265fe3f070ecd"}}