{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:A6T657G5U6ITNHLC2NLG6TX6UJ","short_pith_number":"pith:A6T657G5","schema_version":"1.0","canonical_sha256":"07a7eefcdda791369d62d3566f4efea265ed873276094a85587e6694e45e5deb","source":{"kind":"arxiv","id":"1112.4632","version":4},"attestation_state":"computed","paper":{"title":"The Price of Matching Selfish Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Roger Wattenhofer, Tobias Langner, Yuval Emek","submitted_at":"2011-12-20T09:57:00Z","abstract_excerpt":"We analyze the setting of minimum-cost perfect matchings with selfish vertices through the price of anarchy (PoA) and price of stability (PoS) lens. The underlying solution concept used for this analysis is the Gale-Shapley stable matching notion, where the preferences are determined so that each player (vertex) wishes to minimize the cost of her own matching edge."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1112.4632","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-20T09:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"109df258f1c217a21f0026292553701537874308933f1241be1aa91cc62935aa","abstract_canon_sha256":"91f87c347a387bdadedc3e0f773c13a787cdc263da2f41db743557e1f7a7312c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.088683Z","signature_b64":"MvDEKhdGER4j9UUigA+2oqX9/W5lULj1J0zfpDv5BeP8ulT6KkLhJfmjnIPsSwyq2NNOOqYG1fND/M7gQ1LdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a7eefcdda791369d62d3566f4efea265ed873276094a85587e6694e45e5deb","last_reissued_at":"2026-05-18T02:21:27.087946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.087946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Price of Matching Selfish Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Roger Wattenhofer, Tobias Langner, Yuval Emek","submitted_at":"2011-12-20T09:57:00Z","abstract_excerpt":"We analyze the setting of minimum-cost perfect matchings with selfish vertices through the price of anarchy (PoA) and price of stability (PoS) lens. The underlying solution concept used for this analysis is the Gale-Shapley stable matching notion, where the preferences are determined so that each player (vertex) wishes to minimize the cost of her own matching edge."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4632","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.4632","created_at":"2026-05-18T02:21:27.088063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.4632v4","created_at":"2026-05-18T02:21:27.088063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4632","created_at":"2026-05-18T02:21:27.088063+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6T657G5U6IT","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6T657G5U6ITNHLC","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6T657G5","created_at":"2026-05-18T12:26:24.575870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ","json":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ.json","graph_json":"https://pith.science/api/pith-number/A6T657G5U6ITNHLC2NLG6TX6UJ/graph.json","events_json":"https://pith.science/api/pith-number/A6T657G5U6ITNHLC2NLG6TX6UJ/events.json","paper":"https://pith.science/paper/A6T657G5"},"agent_actions":{"view_html":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ","download_json":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ.json","view_paper":"https://pith.science/paper/A6T657G5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.4632&json=true","fetch_graph":"https://pith.science/api/pith-number/A6T657G5U6ITNHLC2NLG6TX6UJ/graph.json","fetch_events":"https://pith.science/api/pith-number/A6T657G5U6ITNHLC2NLG6TX6UJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ/action/storage_attestation","attest_author":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ/action/author_attestation","sign_citation":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ/action/citation_signature","submit_replication":"https://pith.science/pith/A6T657G5U6ITNHLC2NLG6TX6UJ/action/replication_record"}},"created_at":"2026-05-18T02:21:27.088063+00:00","updated_at":"2026-05-18T02:21:27.088063+00:00"}