{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MVQ2QOV4KZHPQBFJYRDLB3NPVN","short_pith_number":"pith:MVQ2QOV4","canonical_record":{"source":{"id":"1409.5383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-18T17:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"44ac99c3babef88efa8ec07f66ae1459a58910cca5288da88702754aa3b8e95a","abstract_canon_sha256":"f01aa6c453a1ecbf31df4680cf6a733b19effa9f13ed4920db2c169dd875e98f"},"schema_version":"1.0"},"canonical_sha256":"6561a83abc564ef804a9c446b0edafab54914278372e7da64666f22c5f71e3d7","source":{"kind":"arxiv","id":"1409.5383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5383","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5383v1","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5383","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"MVQ2QOV4KZHP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MVQ2QOV4KZHPQBFJ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MVQ2QOV4","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MVQ2QOV4KZHPQBFJYRDLB3NPVN","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-18T17:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"44ac99c3babef88efa8ec07f66ae1459a58910cca5288da88702754aa3b8e95a","abstract_canon_sha256":"f01aa6c453a1ecbf31df4680cf6a733b19effa9f13ed4920db2c169dd875e98f"},"schema_version":"1.0"},"canonical_sha256":"6561a83abc564ef804a9c446b0edafab54914278372e7da64666f22c5f71e3d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:29.643859Z","signature_b64":"1oK7PSTKxWeN697Y4WByXH/tpg70m7GE7icXMjw94v0Let2OVXzkVuKsqpRxfu5PrndJ18Mn8uFiqhh6morfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6561a83abc564ef804a9c446b0edafab54914278372e7da64666f22c5f71e3d7","last_reissued_at":"2026-05-18T02:42:29.642979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:29.642979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5383","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-18T02:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2NvaQbB+Hx6HcqLToktFJ+OdTX11MRIzWO9Qy/v6qInOVv4QygXkaveNnqqYD+c6tlHXN99cmemYGylGD/vjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:12:04.054178Z"},"content_sha256":"effc871c7bdc1016424cf9acbebd5801caa279e8d456c2cb14065516154e9343","schema_version":"1.0","event_id":"sha256:effc871c7bdc1016424cf9acbebd5801caa279e8d456c2cb14065516154e9343"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MVQ2QOV4KZHPQBFJYRDLB3NPVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilevel Network Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexander Skopalik, Andreas Cord-Landwehr, Daniel Jung, Sebastian Abshoff","submitted_at":"2014-09-18T17:34:55Z","abstract_excerpt":"We consider a multilevel network game, where nodes can improve their communication costs by connecting to a high-speed network. The $n$ nodes are connected by a static network and each node can decide individually to become a gateway to the high-speed network. The goal of a node $v$ is to minimize its private costs, i.e., the sum (SUM-game) or maximum (MAX-game) of communication distances from $v$ to all other nodes plus a fixed price $\\alpha > 0$ if it decides to be a gateway. Between gateways the communication distance is $0$, and gateways also improve other nodes' distances by behaving as s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5383","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-18T02:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYx6PULkIKk51/mT6wGMMNRNH5tX1rgd9J6I41PRPtP0wNewKzJULFy428SDrpV1vIJaBNVSJhT3fXmE9azUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:12:04.054732Z"},"content_sha256":"c55e35aa02459798ad613acce80eeee236e9b3fc26cda1f2846c71a001157b80","schema_version":"1.0","event_id":"sha256:c55e35aa02459798ad613acce80eeee236e9b3fc26cda1f2846c71a001157b80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVQ2QOV4KZHPQBFJYRDLB3NPVN/bundle.json","state_url":"https://pith.science/pith/MVQ2QOV4KZHPQBFJYRDLB3NPVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVQ2QOV4KZHPQBFJYRDLB3NPVN/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-30T00:12:04Z","links":{"resolver":"https://pith.science/pith/MVQ2QOV4KZHPQBFJYRDLB3NPVN","bundle":"https://pith.science/pith/MVQ2QOV4KZHPQBFJYRDLB3NPVN/bundle.json","state":"https://pith.science/pith/MVQ2QOV4KZHPQBFJYRDLB3NPVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVQ2QOV4KZHPQBFJYRDLB3NPVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MVQ2QOV4KZHPQBFJYRDLB3NPVN","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":"f01aa6c453a1ecbf31df4680cf6a733b19effa9f13ed4920db2c169dd875e98f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-18T17:34:55Z","title_canon_sha256":"44ac99c3babef88efa8ec07f66ae1459a58910cca5288da88702754aa3b8e95a"},"schema_version":"1.0","source":{"id":"1409.5383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5383","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5383v1","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5383","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"MVQ2QOV4KZHP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MVQ2QOV4KZHPQBFJ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MVQ2QOV4","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:c55e35aa02459798ad613acce80eeee236e9b3fc26cda1f2846c71a001157b80","target":"graph","created_at":"2026-05-18T02:42:29Z","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 consider a multilevel network game, where nodes can improve their communication costs by connecting to a high-speed network. The $n$ nodes are connected by a static network and each node can decide individually to become a gateway to the high-speed network. The goal of a node $v$ is to minimize its private costs, i.e., the sum (SUM-game) or maximum (MAX-game) of communication distances from $v$ to all other nodes plus a fixed price $\\alpha > 0$ if it decides to be a gateway. Between gateways the communication distance is $0$, and gateways also improve other nodes' distances by behaving as s","authors_text":"Alexander Skopalik, Andreas Cord-Landwehr, Daniel Jung, Sebastian Abshoff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-18T17:34:55Z","title":"Multilevel Network Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5383","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:effc871c7bdc1016424cf9acbebd5801caa279e8d456c2cb14065516154e9343","target":"record","created_at":"2026-05-18T02:42:29Z","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":"f01aa6c453a1ecbf31df4680cf6a733b19effa9f13ed4920db2c169dd875e98f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-18T17:34:55Z","title_canon_sha256":"44ac99c3babef88efa8ec07f66ae1459a58910cca5288da88702754aa3b8e95a"},"schema_version":"1.0","source":{"id":"1409.5383","kind":"arxiv","version":1}},"canonical_sha256":"6561a83abc564ef804a9c446b0edafab54914278372e7da64666f22c5f71e3d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6561a83abc564ef804a9c446b0edafab54914278372e7da64666f22c5f71e3d7","first_computed_at":"2026-05-18T02:42:29.642979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:29.642979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1oK7PSTKxWeN697Y4WByXH/tpg70m7GE7icXMjw94v0Let2OVXzkVuKsqpRxfu5PrndJ18Mn8uFiqhh6morfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:29.643859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:effc871c7bdc1016424cf9acbebd5801caa279e8d456c2cb14065516154e9343","sha256:c55e35aa02459798ad613acce80eeee236e9b3fc26cda1f2846c71a001157b80"],"state_sha256":"ab292f8f33cbe1e1eb59de1bf2caf455a408deb280f81204c70d6d51826be6be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFZDcCsKVMxgCcGp3c6TWoMGlf/W5fBmnAfpzgy2m0KnDpg/NKaBz7z4ozaflJzKuWJpEgxEMxdXjEAHOEwiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:12:04.057843Z","bundle_sha256":"e268b64dba7a8b69ba35c48542fc2aa2e3ca707c326f7ad0baa53d41788c7678"}}