{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XJ53I67J5NVJG6UPLP7PWBJBLO","short_pith_number":"pith:XJ53I67J","canonical_record":{"source":{"id":"1709.01982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-06T20:21:55Z","cross_cats_sorted":["cs.DM","cs.GT","math.CO"],"title_canon_sha256":"f11260b1f8930567540fb6ce252f29e6a9a14f94f91e9b9444daf44f62679288","abstract_canon_sha256":"f34ae0ad651d3ed9fc73abcd72105e9138a90e7e8ccf9f39a622b0191d7704e7"},"schema_version":"1.0"},"canonical_sha256":"ba7bb47be9eb6a937a8f5bfefb05215bb75fbdea64ac9f819c24aa8619bd0799","source":{"kind":"arxiv","id":"1709.01982","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01982","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01982v2","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01982","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"XJ53I67J5NVJ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XJ53I67J5NVJG6UP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XJ53I67J","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XJ53I67J5NVJG6UPLP7PWBJBLO","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-06T20:21:55Z","cross_cats_sorted":["cs.DM","cs.GT","math.CO"],"title_canon_sha256":"f11260b1f8930567540fb6ce252f29e6a9a14f94f91e9b9444daf44f62679288","abstract_canon_sha256":"f34ae0ad651d3ed9fc73abcd72105e9138a90e7e8ccf9f39a622b0191d7704e7"},"schema_version":"1.0"},"canonical_sha256":"ba7bb47be9eb6a937a8f5bfefb05215bb75fbdea64ac9f819c24aa8619bd0799","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:40.754007Z","signature_b64":"5j/OhzskwNqOX0M2aAX2+Fy+8tbD7qx7k/d0HqwduJk3xwB//VUoGGKhR3lOPEkLxA/vvEabckalhff68uWRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba7bb47be9eb6a937a8f5bfefb05215bb75fbdea64ac9f819c24aa8619bd0799","last_reissued_at":"2026-05-18T00:29:40.753483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:40.753483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01982","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-18T00:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EF/eYeJfylbbz9L8RPegWw2Qc01BGnsn5ezHrzVFz4+WsMsdiVbZpLaOa6dPNNlEDvS1CHVgscqnlp54oSUmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:05:37.330713Z"},"content_sha256":"ba44110ef90385c10a43f64abdc734261e0f52a5ef822b50570dfe7172f55551","schema_version":"1.0","event_id":"sha256:ba44110ef90385c10a43f64abdc734261e0f52a5ef822b50570dfe7172f55551"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XJ53I67J5NVJG6UPLP7PWBJBLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stabilizing Weighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.GT","math.CO"],"primary_cat":"cs.DS","authors_text":"Laura Sanit\\`a, Zhuan Khye Koh","submitted_at":"2017-09-06T20:21:55Z","abstract_excerpt":"An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as network bargaining games and cooperative matching games, because they characterize instances which admit stable outcomes. Motivated by this, in the last few years many researchers have investigated the algorithmic problem of turning a given graph into a stable one, via edge- and vertex-removal operations. However, all the algorithmic results developed in the li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01982","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-18T00:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bp1XOYBy+CSmx1mygpZACbJJcYPzhfUCfXoFsOUYzm8i3RLTT41FlF8bEc6r+7hGTMmIVvDF7DaXenB8e1XJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:05:37.331384Z"},"content_sha256":"3c08c9502fe14f585fdbf84b4a5107b82c163e9cd70bd43c43bf2e97136e8fad","schema_version":"1.0","event_id":"sha256:3c08c9502fe14f585fdbf84b4a5107b82c163e9cd70bd43c43bf2e97136e8fad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJ53I67J5NVJG6UPLP7PWBJBLO/bundle.json","state_url":"https://pith.science/pith/XJ53I67J5NVJG6UPLP7PWBJBLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJ53I67J5NVJG6UPLP7PWBJBLO/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-25T04:05:37Z","links":{"resolver":"https://pith.science/pith/XJ53I67J5NVJG6UPLP7PWBJBLO","bundle":"https://pith.science/pith/XJ53I67J5NVJG6UPLP7PWBJBLO/bundle.json","state":"https://pith.science/pith/XJ53I67J5NVJG6UPLP7PWBJBLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJ53I67J5NVJG6UPLP7PWBJBLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XJ53I67J5NVJG6UPLP7PWBJBLO","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":"f34ae0ad651d3ed9fc73abcd72105e9138a90e7e8ccf9f39a622b0191d7704e7","cross_cats_sorted":["cs.DM","cs.GT","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-06T20:21:55Z","title_canon_sha256":"f11260b1f8930567540fb6ce252f29e6a9a14f94f91e9b9444daf44f62679288"},"schema_version":"1.0","source":{"id":"1709.01982","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01982","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01982v2","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01982","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"XJ53I67J5NVJ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XJ53I67J5NVJG6UP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XJ53I67J","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:3c08c9502fe14f585fdbf84b4a5107b82c163e9cd70bd43c43bf2e97136e8fad","target":"graph","created_at":"2026-05-18T00:29:40Z","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":"An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as network bargaining games and cooperative matching games, because they characterize instances which admit stable outcomes. Motivated by this, in the last few years many researchers have investigated the algorithmic problem of turning a given graph into a stable one, via edge- and vertex-removal operations. However, all the algorithmic results developed in the li","authors_text":"Laura Sanit\\`a, Zhuan Khye Koh","cross_cats":["cs.DM","cs.GT","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-06T20:21:55Z","title":"Stabilizing Weighted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01982","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:ba44110ef90385c10a43f64abdc734261e0f52a5ef822b50570dfe7172f55551","target":"record","created_at":"2026-05-18T00:29:40Z","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":"f34ae0ad651d3ed9fc73abcd72105e9138a90e7e8ccf9f39a622b0191d7704e7","cross_cats_sorted":["cs.DM","cs.GT","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-06T20:21:55Z","title_canon_sha256":"f11260b1f8930567540fb6ce252f29e6a9a14f94f91e9b9444daf44f62679288"},"schema_version":"1.0","source":{"id":"1709.01982","kind":"arxiv","version":2}},"canonical_sha256":"ba7bb47be9eb6a937a8f5bfefb05215bb75fbdea64ac9f819c24aa8619bd0799","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba7bb47be9eb6a937a8f5bfefb05215bb75fbdea64ac9f819c24aa8619bd0799","first_computed_at":"2026-05-18T00:29:40.753483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:40.753483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5j/OhzskwNqOX0M2aAX2+Fy+8tbD7qx7k/d0HqwduJk3xwB//VUoGGKhR3lOPEkLxA/vvEabckalhff68uWRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:40.754007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01982","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba44110ef90385c10a43f64abdc734261e0f52a5ef822b50570dfe7172f55551","sha256:3c08c9502fe14f585fdbf84b4a5107b82c163e9cd70bd43c43bf2e97136e8fad"],"state_sha256":"60e45c41ff9437d64f88beb483e8d0256a1413b877b576b83aa79975a5ba27bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDswqQxzdLSeGP5xQzyYMVjMq3anHY7Yph2h2nale3SKk30V8DZ9vQgR4YUBUZ6hoxggbUEj/Aa7DFsdUfZFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:05:37.334999Z","bundle_sha256":"a7d784a1d9c0f2e858e4a36a102b1629cf4b83dd7413c2632f585a35dc4730d5"}}