{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EVZDI3QIDOOVUVTKDX5S7TYN2K","short_pith_number":"pith:EVZDI3QI","canonical_record":{"source":{"id":"1207.6683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-28T04:56:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8ab9470420cc35237877985370a2f41ac9bf22f3122e045ddd11377aa00079f3","abstract_canon_sha256":"b1bdee8735ccd07be5fd984a78b6c7973e0e9f1f5fba4886d9cb7e01394adbb1"},"schema_version":"1.0"},"canonical_sha256":"2572346e081b9d5a566a1dfb2fcf0dd292dd515b9a4e40f3c48a4a65bae9fc29","source":{"kind":"arxiv","id":"1207.6683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6683","created_at":"2026-05-18T03:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6683v1","created_at":"2026-05-18T03:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6683","created_at":"2026-05-18T03:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"EVZDI3QIDOOV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EVZDI3QIDOOVUVTK","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EVZDI3QI","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EVZDI3QIDOOVUVTKDX5S7TYN2K","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-28T04:56:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8ab9470420cc35237877985370a2f41ac9bf22f3122e045ddd11377aa00079f3","abstract_canon_sha256":"b1bdee8735ccd07be5fd984a78b6c7973e0e9f1f5fba4886d9cb7e01394adbb1"},"schema_version":"1.0"},"canonical_sha256":"2572346e081b9d5a566a1dfb2fcf0dd292dd515b9a4e40f3c48a4a65bae9fc29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:57.518501Z","signature_b64":"EFs6oB7O3MG/rw8eZ1tOFCE82vsBEtnsH3Z0tjggHrylUP+vC4zb9JytIZ54HjjNitVSfSvAWtv5+sYfJiPNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2572346e081b9d5a566a1dfb2fcf0dd292dd515b9a4e40f3c48a4a65bae9fc29","last_reissued_at":"2026-05-18T03:49:57.517951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:57.517951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6683","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-18T03:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bY9W9FlDat5ODBstkXpUbNMMVkd/Lt+fDazWIRYX13KPGId6XZ4E6Vl2qiDofDkpfeWn/F3O24mMq1jAb+hMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:52:03.661434Z"},"content_sha256":"066e6a28af283b32d30ccfd95ad9413a1041247be1b2063ca32bd1ee2706c30a","schema_version":"1.0","event_id":"sha256:066e6a28af283b32d30ccfd95ad9413a1041247be1b2063ca32bd1ee2706c30a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EVZDI3QIDOOVUVTKDX5S7TYN2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"David Steiner, Jochen Koenemann, Kate Larson","submitted_at":"2012-07-28T04:56:32Z","abstract_excerpt":"We study a network extension to the Nash bargaining game, as introduced by Kleinberg and Tardos (STOC'08), where the set of players corresponds to vertices in a graph $G=(V,E)$ and each edge $ij\\in E$ represents a possible deal between players $i$ and $j$. We reformulate the problem as a cooperative game and study the following question: Given a game with an empty core (i.e. an unstable game) is it possible, through minimal changes in the underlying network, to stabilize the game? We show that by removing edges in the network that belong to a blocking set we can find a stable solution in polyn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6683","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-18T03:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfBK/DRR7J4F9oh5+oheJKLdmzBB0/EYmA3+rok86MwseS2tQW88RfDkmWvy5Hk/UgEH7R80+2geCRnlSPZ0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:52:03.662064Z"},"content_sha256":"1b8aa0e639f853b7ad6794a2fae31025bcb142d5ac263bbb06fccb172bcd6ee8","schema_version":"1.0","event_id":"sha256:1b8aa0e639f853b7ad6794a2fae31025bcb142d5ac263bbb06fccb172bcd6ee8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVZDI3QIDOOVUVTKDX5S7TYN2K/bundle.json","state_url":"https://pith.science/pith/EVZDI3QIDOOVUVTKDX5S7TYN2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVZDI3QIDOOVUVTKDX5S7TYN2K/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-07T17:52:03Z","links":{"resolver":"https://pith.science/pith/EVZDI3QIDOOVUVTKDX5S7TYN2K","bundle":"https://pith.science/pith/EVZDI3QIDOOVUVTKDX5S7TYN2K/bundle.json","state":"https://pith.science/pith/EVZDI3QIDOOVUVTKDX5S7TYN2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVZDI3QIDOOVUVTKDX5S7TYN2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EVZDI3QIDOOVUVTKDX5S7TYN2K","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":"b1bdee8735ccd07be5fd984a78b6c7973e0e9f1f5fba4886d9cb7e01394adbb1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-28T04:56:32Z","title_canon_sha256":"8ab9470420cc35237877985370a2f41ac9bf22f3122e045ddd11377aa00079f3"},"schema_version":"1.0","source":{"id":"1207.6683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6683","created_at":"2026-05-18T03:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6683v1","created_at":"2026-05-18T03:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6683","created_at":"2026-05-18T03:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"EVZDI3QIDOOV","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EVZDI3QIDOOVUVTK","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EVZDI3QI","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:1b8aa0e639f853b7ad6794a2fae31025bcb142d5ac263bbb06fccb172bcd6ee8","target":"graph","created_at":"2026-05-18T03:49:57Z","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 study a network extension to the Nash bargaining game, as introduced by Kleinberg and Tardos (STOC'08), where the set of players corresponds to vertices in a graph $G=(V,E)$ and each edge $ij\\in E$ represents a possible deal between players $i$ and $j$. We reformulate the problem as a cooperative game and study the following question: Given a game with an empty core (i.e. an unstable game) is it possible, through minimal changes in the underlying network, to stabilize the game? We show that by removing edges in the network that belong to a blocking set we can find a stable solution in polyn","authors_text":"David Steiner, Jochen Koenemann, Kate Larson","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-28T04:56:32Z","title":"Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6683","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:066e6a28af283b32d30ccfd95ad9413a1041247be1b2063ca32bd1ee2706c30a","target":"record","created_at":"2026-05-18T03:49:57Z","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":"b1bdee8735ccd07be5fd984a78b6c7973e0e9f1f5fba4886d9cb7e01394adbb1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-28T04:56:32Z","title_canon_sha256":"8ab9470420cc35237877985370a2f41ac9bf22f3122e045ddd11377aa00079f3"},"schema_version":"1.0","source":{"id":"1207.6683","kind":"arxiv","version":1}},"canonical_sha256":"2572346e081b9d5a566a1dfb2fcf0dd292dd515b9a4e40f3c48a4a65bae9fc29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2572346e081b9d5a566a1dfb2fcf0dd292dd515b9a4e40f3c48a4a65bae9fc29","first_computed_at":"2026-05-18T03:49:57.517951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:57.517951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EFs6oB7O3MG/rw8eZ1tOFCE82vsBEtnsH3Z0tjggHrylUP+vC4zb9JytIZ54HjjNitVSfSvAWtv5+sYfJiPNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:57.518501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:066e6a28af283b32d30ccfd95ad9413a1041247be1b2063ca32bd1ee2706c30a","sha256:1b8aa0e639f853b7ad6794a2fae31025bcb142d5ac263bbb06fccb172bcd6ee8"],"state_sha256":"f814eebbf6b8b8489865906bc5eaa53b6faa66cdfdbbd5c67e49707c55b6bb2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZN5mMZhXEl15/5/awIgmPUD/drkWKgvXCBJmHZ92kHm0QqKJfMzPLYP0FgJE3NfbCBuQfyt0DKtD89KPuVlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:52:03.665234Z","bundle_sha256":"d2d00e26295ad986d12fa53d7e654901913ccc52026427e344b1029d9c8a8dde"}}