{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VW6XENN6QD5KSX6UYIHNMORUWK","short_pith_number":"pith:VW6XENN6","canonical_record":{"source":{"id":"1407.0643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-02T16:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"3fed64e742a7e39385825785cb6664c6aa1c69e0e3e02c08f6a57904b63ca3c7","abstract_canon_sha256":"26e9b65025372df043ba1eb281370c780af1926f1bf3488443e1ceaf50ab63e6"},"schema_version":"1.0"},"canonical_sha256":"adbd7235be80faa95fd4c20ed63a34b2a53906311fb47ee406df70f460b3c1dd","source":{"kind":"arxiv","id":"1407.0643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0643","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0643v1","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0643","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"VW6XENN6QD5K","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VW6XENN6QD5KSX6U","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VW6XENN6","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VW6XENN6QD5KSX6UYIHNMORUWK","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-02T16:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"3fed64e742a7e39385825785cb6664c6aa1c69e0e3e02c08f6a57904b63ca3c7","abstract_canon_sha256":"26e9b65025372df043ba1eb281370c780af1926f1bf3488443e1ceaf50ab63e6"},"schema_version":"1.0"},"canonical_sha256":"adbd7235be80faa95fd4c20ed63a34b2a53906311fb47ee406df70f460b3c1dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:26.435954Z","signature_b64":"4u99rXpg3gr03P0gKXnqXJBI60uIiCDsRu7bPnW/DSLX0ju1VA5qql3Ue08Z6XgAizNQHfN6YX20Ow0aCqsxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adbd7235be80faa95fd4c20ed63a34b2a53906311fb47ee406df70f460b3c1dd","last_reissued_at":"2026-05-18T02:48:26.435310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:26.435310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0643","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:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCUwaPHy2cu75qcQhZZlcaof0nd7Ew/uT7Jft3TTO+Zcwt8Z41KUODNoOFTvIJZo7Giern3HEuqeNVy7O2/bCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:57:06.517375Z"},"content_sha256":"f0c7b506530f1090f7d5a117aec2dd8b921f092caffdf0292b576dfcc31ce4bb","schema_version":"1.0","event_id":"sha256:f0c7b506530f1090f7d5a117aec2dd8b921f092caffdf0292b576dfcc31ce4bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VW6XENN6QD5KSX6UYIHNMORUWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Max-Distance Network Creation Game on General Host Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2014-07-02T16:48:53Z","abstract_excerpt":"In this paper we study a generalization of the classic \\emph{network creation game} in the scenario in which the $n$ players sit on a given arbitrary \\emph{host graph}, which constrains the set of edges a player can activate at a cost of $\\alpha \\geq 0$ each. This finds its motivations in the physical limitations one can have in constructing links in practice, and it has been studied in the past only when the routing cost component of a player is given by the sum of distances to all the other nodes. Here, we focus on another popular routing cost, namely that which takes into account for each p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0643","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:48:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUE28/qczwfolB2jnLtN3joKztu4tsuXR9N+lBTSPPnHlxg/Zj0x1wjdaF+vmjs2DPYwTyt+STyV6FITVcMWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:57:06.518153Z"},"content_sha256":"3b282c87545377134473e832c76fe745e53b77134073206adcc9986695b5adae","schema_version":"1.0","event_id":"sha256:3b282c87545377134473e832c76fe745e53b77134073206adcc9986695b5adae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VW6XENN6QD5KSX6UYIHNMORUWK/bundle.json","state_url":"https://pith.science/pith/VW6XENN6QD5KSX6UYIHNMORUWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VW6XENN6QD5KSX6UYIHNMORUWK/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-09T11:57:06Z","links":{"resolver":"https://pith.science/pith/VW6XENN6QD5KSX6UYIHNMORUWK","bundle":"https://pith.science/pith/VW6XENN6QD5KSX6UYIHNMORUWK/bundle.json","state":"https://pith.science/pith/VW6XENN6QD5KSX6UYIHNMORUWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VW6XENN6QD5KSX6UYIHNMORUWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VW6XENN6QD5KSX6UYIHNMORUWK","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":"26e9b65025372df043ba1eb281370c780af1926f1bf3488443e1ceaf50ab63e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-02T16:48:53Z","title_canon_sha256":"3fed64e742a7e39385825785cb6664c6aa1c69e0e3e02c08f6a57904b63ca3c7"},"schema_version":"1.0","source":{"id":"1407.0643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0643","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0643v1","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0643","created_at":"2026-05-18T02:48:26Z"},{"alias_kind":"pith_short_12","alias_value":"VW6XENN6QD5K","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VW6XENN6QD5KSX6U","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VW6XENN6","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:3b282c87545377134473e832c76fe745e53b77134073206adcc9986695b5adae","target":"graph","created_at":"2026-05-18T02:48:26Z","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 this paper we study a generalization of the classic \\emph{network creation game} in the scenario in which the $n$ players sit on a given arbitrary \\emph{host graph}, which constrains the set of edges a player can activate at a cost of $\\alpha \\geq 0$ each. This finds its motivations in the physical limitations one can have in constructing links in practice, and it has been studied in the past only when the routing cost component of a player is given by the sum of distances to all the other nodes. Here, we focus on another popular routing cost, namely that which takes into account for each p","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-02T16:48:53Z","title":"The Max-Distance Network Creation Game on General Host Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0643","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:f0c7b506530f1090f7d5a117aec2dd8b921f092caffdf0292b576dfcc31ce4bb","target":"record","created_at":"2026-05-18T02:48:26Z","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":"26e9b65025372df043ba1eb281370c780af1926f1bf3488443e1ceaf50ab63e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-02T16:48:53Z","title_canon_sha256":"3fed64e742a7e39385825785cb6664c6aa1c69e0e3e02c08f6a57904b63ca3c7"},"schema_version":"1.0","source":{"id":"1407.0643","kind":"arxiv","version":1}},"canonical_sha256":"adbd7235be80faa95fd4c20ed63a34b2a53906311fb47ee406df70f460b3c1dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adbd7235be80faa95fd4c20ed63a34b2a53906311fb47ee406df70f460b3c1dd","first_computed_at":"2026-05-18T02:48:26.435310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:26.435310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4u99rXpg3gr03P0gKXnqXJBI60uIiCDsRu7bPnW/DSLX0ju1VA5qql3Ue08Z6XgAizNQHfN6YX20Ow0aCqsxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:26.435954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c7b506530f1090f7d5a117aec2dd8b921f092caffdf0292b576dfcc31ce4bb","sha256:3b282c87545377134473e832c76fe745e53b77134073206adcc9986695b5adae"],"state_sha256":"d5302207568fd7d3176952773a63f54fae6638fdeaef499959bd76fa414e3378"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UFabQcTKABBYtpvHms6vxpFIzjqzwXEQW5zQsTX3MP8MAlFaULGa27vPGW7IkylNHjB1z4ouYDGMwlyGCSUtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:57:06.522492Z","bundle_sha256":"da52c8ea450a8c64fa908fae8aa9c36fb23ec22ff97cd4473daf1b39819c5e58"}}