{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5ZW3SFD2YASBFEXMP5ZFHU6DOY","short_pith_number":"pith:5ZW3SFD2","canonical_record":{"source":{"id":"1704.03499","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T19:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"7225c54c38aaf11fb294eee0ca12382f070e6da612620ab6e5c6a0333141f5ed","abstract_canon_sha256":"e28bbb7c60f3848b755a2d0099b9278a8370da6af928ebc9d55872fe62678ea1"},"schema_version":"1.0"},"canonical_sha256":"ee6db9147ac0241292ec7f7253d3c3760e4aaf2c091db8572a2f7f508f6d7072","source":{"kind":"arxiv","id":"1704.03499","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03499","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03499v3","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03499","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"5ZW3SFD2YASB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZW3SFD2YASBFEXM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZW3SFD2","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5ZW3SFD2YASBFEXMP5ZFHU6DOY","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03499","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T19:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"7225c54c38aaf11fb294eee0ca12382f070e6da612620ab6e5c6a0333141f5ed","abstract_canon_sha256":"e28bbb7c60f3848b755a2d0099b9278a8370da6af928ebc9d55872fe62678ea1"},"schema_version":"1.0"},"canonical_sha256":"ee6db9147ac0241292ec7f7253d3c3760e4aaf2c091db8572a2f7f508f6d7072","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:23.710532Z","signature_b64":"nA9eV//64QrlTym4RNk+aQ+facV38kmpZPHZek1ZV0Xs5kO8phEeADKSfazXkuLU6OY9GrcLUz2tBvjjfbJmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee6db9147ac0241292ec7f7253d3c3760e4aaf2c091db8572a2f7f508f6d7072","last_reissued_at":"2026-05-18T00:08:23.709952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:23.709952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03499","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-18T00:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvjuuVqgE43tDLNSN8KpL6745/lLy6AzrFHCHJVwt2/alUVHc29OohAZ3hMbczPT4EbD6P8MaGhV7sEuje28CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:45:42.082623Z"},"content_sha256":"2ba85f9c8c2adbf44a10c08dea59d65d4b3c3ab3f15a101eb137032969c17a09","schema_version":"1.0","event_id":"sha256:2ba85f9c8c2adbf44a10c08dea59d65d4b3c3ab3f15a101eb137032969c17a09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5ZW3SFD2YASBFEXMP5ZFHU6DOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Gibbsian model for message routeing in highly dense multihop networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andr\\'as T\\'obi\\'as, Wolfgang K\\\"onig","submitted_at":"2017-04-11T19:02:37Z","abstract_excerpt":"We investigate a probabilistic model for routeing of messages in relay-augmented multihop ad-hoc networks, where each transmitter sends one message to the origin. Given the (random) transmitter locations, we weight the family of random, uniformly distributed message trajectories by an exponential probability weight, favouring trajectories with low interference (measured in terms of signal-to-interference ratio) and trajectory families with little congestion (measured in terms of the number of pairs of hops using the same relay). Under the resulting Gibbs measure, the system targets the best co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03499","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-18T00:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iw/5wnskXauUPvYhhwXtIqaeREdH6wwEv3Kpuu3tCWCnm5rOkGMbMfm0eoW5XoAAnnR6rY3XeT00xr0EHkOgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:45:42.082976Z"},"content_sha256":"f8273e4946cc61b812fe784f839f2c5ca30f947f90af79968986addb3baf3ff8","schema_version":"1.0","event_id":"sha256:f8273e4946cc61b812fe784f839f2c5ca30f947f90af79968986addb3baf3ff8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZW3SFD2YASBFEXMP5ZFHU6DOY/bundle.json","state_url":"https://pith.science/pith/5ZW3SFD2YASBFEXMP5ZFHU6DOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZW3SFD2YASBFEXMP5ZFHU6DOY/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-06-01T16:45:42Z","links":{"resolver":"https://pith.science/pith/5ZW3SFD2YASBFEXMP5ZFHU6DOY","bundle":"https://pith.science/pith/5ZW3SFD2YASBFEXMP5ZFHU6DOY/bundle.json","state":"https://pith.science/pith/5ZW3SFD2YASBFEXMP5ZFHU6DOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZW3SFD2YASBFEXMP5ZFHU6DOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5ZW3SFD2YASBFEXMP5ZFHU6DOY","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":"e28bbb7c60f3848b755a2d0099b9278a8370da6af928ebc9d55872fe62678ea1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T19:02:37Z","title_canon_sha256":"7225c54c38aaf11fb294eee0ca12382f070e6da612620ab6e5c6a0333141f5ed"},"schema_version":"1.0","source":{"id":"1704.03499","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03499","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03499v3","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03499","created_at":"2026-05-18T00:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"5ZW3SFD2YASB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5ZW3SFD2YASBFEXM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5ZW3SFD2","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:f8273e4946cc61b812fe784f839f2c5ca30f947f90af79968986addb3baf3ff8","target":"graph","created_at":"2026-05-18T00:08:23Z","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 a probabilistic model for routeing of messages in relay-augmented multihop ad-hoc networks, where each transmitter sends one message to the origin. Given the (random) transmitter locations, we weight the family of random, uniformly distributed message trajectories by an exponential probability weight, favouring trajectories with low interference (measured in terms of signal-to-interference ratio) and trajectory families with little congestion (measured in terms of the number of pairs of hops using the same relay). Under the resulting Gibbs measure, the system targets the best co","authors_text":"Andr\\'as T\\'obi\\'as, Wolfgang K\\\"onig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T19:02:37Z","title":"A Gibbsian model for message routeing in highly dense multihop networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03499","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:2ba85f9c8c2adbf44a10c08dea59d65d4b3c3ab3f15a101eb137032969c17a09","target":"record","created_at":"2026-05-18T00:08:23Z","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":"e28bbb7c60f3848b755a2d0099b9278a8370da6af928ebc9d55872fe62678ea1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T19:02:37Z","title_canon_sha256":"7225c54c38aaf11fb294eee0ca12382f070e6da612620ab6e5c6a0333141f5ed"},"schema_version":"1.0","source":{"id":"1704.03499","kind":"arxiv","version":3}},"canonical_sha256":"ee6db9147ac0241292ec7f7253d3c3760e4aaf2c091db8572a2f7f508f6d7072","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee6db9147ac0241292ec7f7253d3c3760e4aaf2c091db8572a2f7f508f6d7072","first_computed_at":"2026-05-18T00:08:23.709952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:23.709952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nA9eV//64QrlTym4RNk+aQ+facV38kmpZPHZek1ZV0Xs5kO8phEeADKSfazXkuLU6OY9GrcLUz2tBvjjfbJmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:23.710532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03499","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ba85f9c8c2adbf44a10c08dea59d65d4b3c3ab3f15a101eb137032969c17a09","sha256:f8273e4946cc61b812fe784f839f2c5ca30f947f90af79968986addb3baf3ff8"],"state_sha256":"1c1cc9d551259c5b3397c00ad0bc105d5c66af989cbeaa1edcc36ade958b7c22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rv5BIE+QEEu1fusNU8Q6O1ug2QfR+bzpY0n2YVNf/cCt+V3HfeGRNhaYxmjhj+agRs42BnqO6yEnD9/oicIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:45:42.084926Z","bundle_sha256":"9b0573cf36c4831918af4dbd1aaad7e81bc29c3e22cfd89455f68eb7d4b268cc"}}