{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SCED3ZN23NQXBZOLYL2GGV4DPZ","short_pith_number":"pith:SCED3ZN2","canonical_record":{"source":{"id":"1311.2698","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-12T07:12:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"eb5f01244496a34f770112bf711f60ae2b1dacc3233deab9af85ccac3ad11637","abstract_canon_sha256":"609101ef11cd176bf7497b1e014082f6a93b0589f22de96d3e0d1ba271c6e382"},"schema_version":"1.0"},"canonical_sha256":"90883de5badb6170e5cbc2f46357837e44f510388e6b74ebc788d2bac2049028","source":{"kind":"arxiv","id":"1311.2698","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2698","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2698v4","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2698","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"SCED3ZN23NQX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SCED3ZN23NQXBZOL","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SCED3ZN2","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SCED3ZN23NQXBZOLYL2GGV4DPZ","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2698","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-12T07:12:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"eb5f01244496a34f770112bf711f60ae2b1dacc3233deab9af85ccac3ad11637","abstract_canon_sha256":"609101ef11cd176bf7497b1e014082f6a93b0589f22de96d3e0d1ba271c6e382"},"schema_version":"1.0"},"canonical_sha256":"90883de5badb6170e5cbc2f46357837e44f510388e6b74ebc788d2bac2049028","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.792081Z","signature_b64":"nTqL8LjyL/+9Y1+s0tgqqx39Z41BS2pXQUbTisrIjfZYTPEKs63Hfc2CNMlMjU20HLcmv9SUpRo50bSLrlgSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90883de5badb6170e5cbc2f46357837e44f510388e6b74ebc788d2bac2049028","last_reissued_at":"2026-05-18T02:53:07.791477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.791477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2698","source_version":4,"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGUx+NeT2FGk5VgqoOpRe+MX969RgAKhRiaD4dk8KTCYheatRutiirpiXzt6itGp2FUYNb6Vsckkmtbd8vaZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:57:09.849291Z"},"content_sha256":"39ab5239951f37d12f3b2cd1a96822fedfb59d4400b7c0f30ee2b714b25eacc4","schema_version":"1.0","event_id":"sha256:39ab5239951f37d12f3b2cd1a96822fedfb59d4400b7c0f30ee2b714b25eacc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SCED3ZN23NQXBZOLYL2GGV4DPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packet Travel Times in Wireless Relay Chains under Spatially and Temporally Dependent Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Alessandro Crismani, Christian Bettstetter, G\\\"unther Brandner, Stavros Toumpis, Udo Schilcher","submitted_at":"2013-11-12T07:12:15Z","abstract_excerpt":"We investigate the statistics of the number of time slots $T$ that it takes a packet to travel through a chain of wireless relays. Derivations are performed assuming an interference model for which interference possesses spatiotemporal dependency properties. When using this model, results are harder to arrive at analytically, but they are more realistic than the ones obtained in many related works that are based on independent interference models.\n  First, we present a method for calculating the distribution of $T$. As the required computations are extensive, we also obtain simple expressions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2698","kind":"arxiv","version":4},"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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naQEANtJbISNNHRCuXMag4PBZvpoDkOy64E4EJGP1XNq+wtPVNcdSo2PB0IS45NS5VWQxpOJQHLa7KpKt7nvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:57:09.849680Z"},"content_sha256":"40253ef4ea3d913dd806afbc2e7b7fc41cdc901147f30a18c226c179aace2c63","schema_version":"1.0","event_id":"sha256:40253ef4ea3d913dd806afbc2e7b7fc41cdc901147f30a18c226c179aace2c63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCED3ZN23NQXBZOLYL2GGV4DPZ/bundle.json","state_url":"https://pith.science/pith/SCED3ZN23NQXBZOLYL2GGV4DPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCED3ZN23NQXBZOLYL2GGV4DPZ/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-30T21:57:09Z","links":{"resolver":"https://pith.science/pith/SCED3ZN23NQXBZOLYL2GGV4DPZ","bundle":"https://pith.science/pith/SCED3ZN23NQXBZOLYL2GGV4DPZ/bundle.json","state":"https://pith.science/pith/SCED3ZN23NQXBZOLYL2GGV4DPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCED3ZN23NQXBZOLYL2GGV4DPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SCED3ZN23NQXBZOLYL2GGV4DPZ","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":"609101ef11cd176bf7497b1e014082f6a93b0589f22de96d3e0d1ba271c6e382","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-12T07:12:15Z","title_canon_sha256":"eb5f01244496a34f770112bf711f60ae2b1dacc3233deab9af85ccac3ad11637"},"schema_version":"1.0","source":{"id":"1311.2698","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2698","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2698v4","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2698","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"SCED3ZN23NQX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SCED3ZN23NQXBZOL","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SCED3ZN2","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:40253ef4ea3d913dd806afbc2e7b7fc41cdc901147f30a18c226c179aace2c63","target":"graph","created_at":"2026-05-18T02:53:07Z","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":"We investigate the statistics of the number of time slots $T$ that it takes a packet to travel through a chain of wireless relays. Derivations are performed assuming an interference model for which interference possesses spatiotemporal dependency properties. When using this model, results are harder to arrive at analytically, but they are more realistic than the ones obtained in many related works that are based on independent interference models.\n  First, we present a method for calculating the distribution of $T$. As the required computations are extensive, we also obtain simple expressions ","authors_text":"Alessandro Crismani, Christian Bettstetter, G\\\"unther Brandner, Stavros Toumpis, Udo Schilcher","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-12T07:12:15Z","title":"Packet Travel Times in Wireless Relay Chains under Spatially and Temporally Dependent Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2698","kind":"arxiv","version":4},"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:39ab5239951f37d12f3b2cd1a96822fedfb59d4400b7c0f30ee2b714b25eacc4","target":"record","created_at":"2026-05-18T02:53:07Z","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":"609101ef11cd176bf7497b1e014082f6a93b0589f22de96d3e0d1ba271c6e382","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-12T07:12:15Z","title_canon_sha256":"eb5f01244496a34f770112bf711f60ae2b1dacc3233deab9af85ccac3ad11637"},"schema_version":"1.0","source":{"id":"1311.2698","kind":"arxiv","version":4}},"canonical_sha256":"90883de5badb6170e5cbc2f46357837e44f510388e6b74ebc788d2bac2049028","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90883de5badb6170e5cbc2f46357837e44f510388e6b74ebc788d2bac2049028","first_computed_at":"2026-05-18T02:53:07.791477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:07.791477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nTqL8LjyL/+9Y1+s0tgqqx39Z41BS2pXQUbTisrIjfZYTPEKs63Hfc2CNMlMjU20HLcmv9SUpRo50bSLrlgSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:07.792081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2698","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39ab5239951f37d12f3b2cd1a96822fedfb59d4400b7c0f30ee2b714b25eacc4","sha256:40253ef4ea3d913dd806afbc2e7b7fc41cdc901147f30a18c226c179aace2c63"],"state_sha256":"019e9eee2b8577f8634fb864754e9b5d9ead47a0ea4c2bcd78aa25332e53ea25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JqWxAEeXZ7ZAVIa8K6/ZaffA8Y6LmkX50ooljN/EKGlC12RS2/E+kBRa42hAEqSgRlKvlf3juVJ9jAlGbgCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:57:09.851926Z","bundle_sha256":"3608c658f43112809ab45c09575c3930c4951c9609c482741682fd0a505ef395"}}