{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PJ7JIILR4MUMPANMJQKZD4CXMN","short_pith_number":"pith:PJ7JIILR","canonical_record":{"source":{"id":"1107.5241","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-07-26T15:21:11Z","cross_cats_sorted":[],"title_canon_sha256":"ac276a94af6dbb4853a62b4fb0b1aa3ddc36ce7e5a9e58271fbb2c708eab4479","abstract_canon_sha256":"f3c34d15f7611a29dc27fcec3cc63fa510a835630ea6df754ff5c59ac41bfe54"},"schema_version":"1.0"},"canonical_sha256":"7a7e942171e328c781ac4c1591f0576367ebcf3a9b650df1c91b02743e4cd24a","source":{"kind":"arxiv","id":"1107.5241","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5241","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5241v3","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5241","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"PJ7JIILR4MUM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ7JIILR4MUMPANM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ7JIILR","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PJ7JIILR4MUMPANMJQKZD4CXMN","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5241","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-07-26T15:21:11Z","cross_cats_sorted":[],"title_canon_sha256":"ac276a94af6dbb4853a62b4fb0b1aa3ddc36ce7e5a9e58271fbb2c708eab4479","abstract_canon_sha256":"f3c34d15f7611a29dc27fcec3cc63fa510a835630ea6df754ff5c59ac41bfe54"},"schema_version":"1.0"},"canonical_sha256":"7a7e942171e328c781ac4c1591f0576367ebcf3a9b650df1c91b02743e4cd24a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:28.384738Z","signature_b64":"4iuBGjIzIe1AYw5wAbXk6RBKI/D/fvITOHFg2nqLeLPVwwCo9rW79VVIreSmQXwNGxpwcKFFFjQfKZ+rymltDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a7e942171e328c781ac4c1591f0576367ebcf3a9b650df1c91b02743e4cd24a","last_reissued_at":"2026-05-18T03:52:28.383866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:28.383866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5241","source_version":3,"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:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcgtdJ6c5FMukVBdDs4sYm2JI1u1uSMLlZ2GfvLYpo89r/IlLN4HTvBqnaS+JeKy4ci7st17izR71J7Ql7WKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:23:05.268142Z"},"content_sha256":"029427c00764c32d4f772e057b1e1a808e9d26009615a1ce3f39d15bb2b3ec21","schema_version":"1.0","event_id":"sha256:029427c00764c32d4f772e057b1e1a808e9d26009615a1ce3f39d15bb2b3ec21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PJ7JIILR4MUMPANMJQKZD4CXMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flooding Time in Opportunistic Networks under Power Law and Exponential Inter-Contact Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Andrea Clementi, Francesco Pasquale, Giovanni Resta, Luca Becchetti, Paolo Santi, Riccardo Silvestri","submitted_at":"2011-07-26T15:21:11Z","abstract_excerpt":"Performance bounds for opportunistic networks have been derived in a number of recent papers for several key quantities, such as the expected delivery time of a unicast message, or the flooding time (a measure of how fast information spreads). However, to the best of our knowledge, none of the existing results is derived under a mobility model which is able to reproduce the power law+exponential tail dichotomy of the pairwise node inter-contact time distribution which has been observed in traces of several real opportunistic networks.\n  The contributions of this paper are two-fold: first, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5241","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"},"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:52:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sR5niF5JwHIoxuGIL30hYE5Iq0kIZIE7ve+vrED4IP20aJdat9TfS3tTI3SAPiZv/bDlJyOpekaQGYvuwOnTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:23:05.268507Z"},"content_sha256":"5d2f472be575cae03371a4c5e5833948d0c3d18f8633d4af6b01d53aaca7c4c4","schema_version":"1.0","event_id":"sha256:5d2f472be575cae03371a4c5e5833948d0c3d18f8633d4af6b01d53aaca7c4c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJ7JIILR4MUMPANMJQKZD4CXMN/bundle.json","state_url":"https://pith.science/pith/PJ7JIILR4MUMPANMJQKZD4CXMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJ7JIILR4MUMPANMJQKZD4CXMN/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-25T10:23:05Z","links":{"resolver":"https://pith.science/pith/PJ7JIILR4MUMPANMJQKZD4CXMN","bundle":"https://pith.science/pith/PJ7JIILR4MUMPANMJQKZD4CXMN/bundle.json","state":"https://pith.science/pith/PJ7JIILR4MUMPANMJQKZD4CXMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJ7JIILR4MUMPANMJQKZD4CXMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PJ7JIILR4MUMPANMJQKZD4CXMN","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":"f3c34d15f7611a29dc27fcec3cc63fa510a835630ea6df754ff5c59ac41bfe54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-07-26T15:21:11Z","title_canon_sha256":"ac276a94af6dbb4853a62b4fb0b1aa3ddc36ce7e5a9e58271fbb2c708eab4479"},"schema_version":"1.0","source":{"id":"1107.5241","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5241","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5241v3","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5241","created_at":"2026-05-18T03:52:28Z"},{"alias_kind":"pith_short_12","alias_value":"PJ7JIILR4MUM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ7JIILR4MUMPANM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ7JIILR","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:5d2f472be575cae03371a4c5e5833948d0c3d18f8633d4af6b01d53aaca7c4c4","target":"graph","created_at":"2026-05-18T03:52:28Z","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":"Performance bounds for opportunistic networks have been derived in a number of recent papers for several key quantities, such as the expected delivery time of a unicast message, or the flooding time (a measure of how fast information spreads). However, to the best of our knowledge, none of the existing results is derived under a mobility model which is able to reproduce the power law+exponential tail dichotomy of the pairwise node inter-contact time distribution which has been observed in traces of several real opportunistic networks.\n  The contributions of this paper are two-fold: first, we p","authors_text":"Andrea Clementi, Francesco Pasquale, Giovanni Resta, Luca Becchetti, Paolo Santi, Riccardo Silvestri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-07-26T15:21:11Z","title":"Flooding Time in Opportunistic Networks under Power Law and Exponential Inter-Contact Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5241","kind":"arxiv","version":3},"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:029427c00764c32d4f772e057b1e1a808e9d26009615a1ce3f39d15bb2b3ec21","target":"record","created_at":"2026-05-18T03:52:28Z","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":"f3c34d15f7611a29dc27fcec3cc63fa510a835630ea6df754ff5c59ac41bfe54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-07-26T15:21:11Z","title_canon_sha256":"ac276a94af6dbb4853a62b4fb0b1aa3ddc36ce7e5a9e58271fbb2c708eab4479"},"schema_version":"1.0","source":{"id":"1107.5241","kind":"arxiv","version":3}},"canonical_sha256":"7a7e942171e328c781ac4c1591f0576367ebcf3a9b650df1c91b02743e4cd24a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a7e942171e328c781ac4c1591f0576367ebcf3a9b650df1c91b02743e4cd24a","first_computed_at":"2026-05-18T03:52:28.383866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:28.383866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4iuBGjIzIe1AYw5wAbXk6RBKI/D/fvITOHFg2nqLeLPVwwCo9rW79VVIreSmQXwNGxpwcKFFFjQfKZ+rymltDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:28.384738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5241","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:029427c00764c32d4f772e057b1e1a808e9d26009615a1ce3f39d15bb2b3ec21","sha256:5d2f472be575cae03371a4c5e5833948d0c3d18f8633d4af6b01d53aaca7c4c4"],"state_sha256":"e0c3e6286615dbdf9865c64f522cb00870e5b13178f8e5612d0f02cbeb0797b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F93SdtHuFuLLjc04FYlVH4XJEwG1Mz8cGLO3jtvXLeZwbR15t9t78UWwy5L/ktzlzo206OyCf+9JVA5nrj6RDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:23:05.270717Z","bundle_sha256":"5bc5d95963840810fb4607cdd8348f9184787138777ad55f54d682db2d5d8a9c"}}