{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5TREHINU33FAEMYH6VUBC5RZUT","short_pith_number":"pith:5TREHINU","canonical_record":{"source":{"id":"1211.2090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T10:05:53Z","cross_cats_sorted":[],"title_canon_sha256":"29217b908e231a3179011e578816b74b7b3374f9d97c3b0ac628ea06cf9776d7","abstract_canon_sha256":"e23b062caaaad766f2abce35d83b1b4c994ba34f5f0f4c579d279e6ea62e019b"},"schema_version":"1.0"},"canonical_sha256":"ece243a1b4deca023307f568117639a4f4af0bf8093d20b0b5d0e5afd697ff65","source":{"kind":"arxiv","id":"1211.2090","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2090","created_at":"2026-05-18T03:30:12Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2090v2","created_at":"2026-05-18T03:30:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2090","created_at":"2026-05-18T03:30:12Z"},{"alias_kind":"pith_short_12","alias_value":"5TREHINU33FA","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5TREHINU33FAEMYH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5TREHINU","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5TREHINU33FAEMYH6VUBC5RZUT","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T10:05:53Z","cross_cats_sorted":[],"title_canon_sha256":"29217b908e231a3179011e578816b74b7b3374f9d97c3b0ac628ea06cf9776d7","abstract_canon_sha256":"e23b062caaaad766f2abce35d83b1b4c994ba34f5f0f4c579d279e6ea62e019b"},"schema_version":"1.0"},"canonical_sha256":"ece243a1b4deca023307f568117639a4f4af0bf8093d20b0b5d0e5afd697ff65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:12.248077Z","signature_b64":"Ghd2+bGgfqB6KxTqM4zONHBtExU4HGELR2WCkdS0kTpRtoIqlOLZNZn528r7WeC9OOuRXsFnhiFubE85wuTvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece243a1b4deca023307f568117639a4f4af0bf8093d20b0b5d0e5afd697ff65","last_reissued_at":"2026-05-18T03:30:12.247420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:12.247420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2090","source_version":2,"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:30:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7twIVBRgZp9OjOBTY+fPbwJN1DQ5pOd7aRIciDOHY+NaAtyo3jdtmYjbrwukq6MkJS091K9Vmmk1Oj6E/mzFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:18:07.298221Z"},"content_sha256":"e0d2d2c79f72b805680250a37232b4eacf8144688092c646c9348919d143c417","schema_version":"1.0","event_id":"sha256:e0d2d2c79f72b805680250a37232b4eacf8144688092c646c9348919d143c417"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5TREHINU33FAEMYH6VUBC5RZUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the H_k-Bound on the Price of Stability in Undirected Shapley Network Design Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Andreas Emil Feldmann, Mat\\'u\\v{s} Mihal\\'ak, Max Klimm, Yann Disser","submitted_at":"2012-11-09T10:05:53Z","abstract_excerpt":"In this paper we show that the price of stability of Shapley network design games on undirected graphs with k players is at most (k^3(k+1)/2-k^2) / (1+k^3(k+1)/2-k^2) H_k = (1 - \\Theta(1/k^4)) H_k, where H_k denotes the k-th harmonic number. This improves on the known upper bound of H_k, which is also valid for directed graphs but for these, in contrast, is tight. Hence, we give the first non-trivial upper bound on the price of stability for undirected Shapley network design games that is valid for an arbitrary number of players. Our bound is proved by analyzing the price of stability restrict"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2090","kind":"arxiv","version":2},"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:30:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+f5Et52wpqNJ/mtTTKQefvZnuGkbGI0cN0iCQXhEGKX/CA49z17mGgKa0/jIW3NOGG7WL0O3B+mqxWk0IwvrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:18:07.299035Z"},"content_sha256":"f4d2a789eb9b9800c1d6b8120b258fa1fb6c3f435fe9820d0307b2bb3d21955e","schema_version":"1.0","event_id":"sha256:f4d2a789eb9b9800c1d6b8120b258fa1fb6c3f435fe9820d0307b2bb3d21955e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TREHINU33FAEMYH6VUBC5RZUT/bundle.json","state_url":"https://pith.science/pith/5TREHINU33FAEMYH6VUBC5RZUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TREHINU33FAEMYH6VUBC5RZUT/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-30T17:18:07Z","links":{"resolver":"https://pith.science/pith/5TREHINU33FAEMYH6VUBC5RZUT","bundle":"https://pith.science/pith/5TREHINU33FAEMYH6VUBC5RZUT/bundle.json","state":"https://pith.science/pith/5TREHINU33FAEMYH6VUBC5RZUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TREHINU33FAEMYH6VUBC5RZUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5TREHINU33FAEMYH6VUBC5RZUT","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":"e23b062caaaad766f2abce35d83b1b4c994ba34f5f0f4c579d279e6ea62e019b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T10:05:53Z","title_canon_sha256":"29217b908e231a3179011e578816b74b7b3374f9d97c3b0ac628ea06cf9776d7"},"schema_version":"1.0","source":{"id":"1211.2090","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2090","created_at":"2026-05-18T03:30:12Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2090v2","created_at":"2026-05-18T03:30:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2090","created_at":"2026-05-18T03:30:12Z"},{"alias_kind":"pith_short_12","alias_value":"5TREHINU33FA","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5TREHINU33FAEMYH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5TREHINU","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:f4d2a789eb9b9800c1d6b8120b258fa1fb6c3f435fe9820d0307b2bb3d21955e","target":"graph","created_at":"2026-05-18T03:30:12Z","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 show that the price of stability of Shapley network design games on undirected graphs with k players is at most (k^3(k+1)/2-k^2) / (1+k^3(k+1)/2-k^2) H_k = (1 - \\Theta(1/k^4)) H_k, where H_k denotes the k-th harmonic number. This improves on the known upper bound of H_k, which is also valid for directed graphs but for these, in contrast, is tight. Hence, we give the first non-trivial upper bound on the price of stability for undirected Shapley network design games that is valid for an arbitrary number of players. Our bound is proved by analyzing the price of stability restrict","authors_text":"Andreas Emil Feldmann, Mat\\'u\\v{s} Mihal\\'ak, Max Klimm, Yann Disser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T10:05:53Z","title":"Improving the H_k-Bound on the Price of Stability in Undirected Shapley Network Design Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2090","kind":"arxiv","version":2},"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:e0d2d2c79f72b805680250a37232b4eacf8144688092c646c9348919d143c417","target":"record","created_at":"2026-05-18T03:30:12Z","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":"e23b062caaaad766f2abce35d83b1b4c994ba34f5f0f4c579d279e6ea62e019b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-09T10:05:53Z","title_canon_sha256":"29217b908e231a3179011e578816b74b7b3374f9d97c3b0ac628ea06cf9776d7"},"schema_version":"1.0","source":{"id":"1211.2090","kind":"arxiv","version":2}},"canonical_sha256":"ece243a1b4deca023307f568117639a4f4af0bf8093d20b0b5d0e5afd697ff65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ece243a1b4deca023307f568117639a4f4af0bf8093d20b0b5d0e5afd697ff65","first_computed_at":"2026-05-18T03:30:12.247420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:12.247420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ghd2+bGgfqB6KxTqM4zONHBtExU4HGELR2WCkdS0kTpRtoIqlOLZNZn528r7WeC9OOuRXsFnhiFubE85wuTvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:12.248077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2090","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0d2d2c79f72b805680250a37232b4eacf8144688092c646c9348919d143c417","sha256:f4d2a789eb9b9800c1d6b8120b258fa1fb6c3f435fe9820d0307b2bb3d21955e"],"state_sha256":"ee96ae1c11524412c5da4a819572259f6e07624f58a2d31906b3ec61662249d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2bD6j+OPWxhsUZuU7WJxmWRbCNw4AfrUhtcpgiI+cwASkvNO5831z0PJTm9XRADlOsxrUDFNU5TyD5myNOgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:18:07.303260Z","bundle_sha256":"89d158ccb61bce2dc89adf0ff1b24619dd1453603c98fb9a9feb72cf1a193928"}}