{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:REMBS36AV3OXBM3K4BAKV6ZA7A","short_pith_number":"pith:REMBS36A","schema_version":"1.0","canonical_sha256":"8918196fc0aedd70b36ae040aafb20f82e26b9ca6691be5cea164fe4ec6b8d06","source":{"kind":"arxiv","id":"1703.09083","version":1},"attestation_state":"computed","paper":{"title":"The weighted stable matching problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Linda Farczadi, Nat\\'alia Guri\\v{c}anov\\'a","submitted_at":"2017-03-27T13:57:31Z","abstract_excerpt":"We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general. Our contribution is two fold: a polyhedral characterization and an approximation algorithm. Previously Chen et al. have shown that the stable matching polytope is integral if and only if the subgraph obtained after running phase one of Irving's algorithm is bipartite. We improve upon this result by showing that there are instances where thi"},"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":"1703.09083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-27T13:57:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1f4b4dbdd8b75c4eb52779edc0f2bf8f3c2bbdf89509c1d962c32ee702357e7b","abstract_canon_sha256":"a174a29c2eaac4562bedf2b87dcd2b51ff731db48cf284b7e105d8f16cc21603"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:54.330737Z","signature_b64":"G8qhX1OorHKsIbww7H8aleqjAqFYOd6Rg+OAIeqpArk4pops1QrIIhAp6J8gV8/4p0wyNrZS2PctEA+xa5K7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8918196fc0aedd70b36ae040aafb20f82e26b9ca6691be5cea164fe4ec6b8d06","last_reissued_at":"2026-05-18T00:47:54.330140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:54.330140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The weighted stable matching problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Linda Farczadi, Nat\\'alia Guri\\v{c}anov\\'a","submitted_at":"2017-03-27T13:57:31Z","abstract_excerpt":"We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general. Our contribution is two fold: a polyhedral characterization and an approximation algorithm. Previously Chen et al. have shown that the stable matching polytope is integral if and only if the subgraph obtained after running phase one of Irving's algorithm is bipartite. We improve upon this result by showing that there are instances where thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09083","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.09083","created_at":"2026-05-18T00:47:54.330256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09083v1","created_at":"2026-05-18T00:47:54.330256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09083","created_at":"2026-05-18T00:47:54.330256+00:00"},{"alias_kind":"pith_short_12","alias_value":"REMBS36AV3OX","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"REMBS36AV3OXBM3K","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"REMBS36A","created_at":"2026-05-18T12:31:39.905425+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/REMBS36AV3OXBM3K4BAKV6ZA7A","json":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A.json","graph_json":"https://pith.science/api/pith-number/REMBS36AV3OXBM3K4BAKV6ZA7A/graph.json","events_json":"https://pith.science/api/pith-number/REMBS36AV3OXBM3K4BAKV6ZA7A/events.json","paper":"https://pith.science/paper/REMBS36A"},"agent_actions":{"view_html":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A","download_json":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A.json","view_paper":"https://pith.science/paper/REMBS36A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09083&json=true","fetch_graph":"https://pith.science/api/pith-number/REMBS36AV3OXBM3K4BAKV6ZA7A/graph.json","fetch_events":"https://pith.science/api/pith-number/REMBS36AV3OXBM3K4BAKV6ZA7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A/action/storage_attestation","attest_author":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A/action/author_attestation","sign_citation":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A/action/citation_signature","submit_replication":"https://pith.science/pith/REMBS36AV3OXBM3K4BAKV6ZA7A/action/replication_record"}},"created_at":"2026-05-18T00:47:54.330256+00:00","updated_at":"2026-05-18T00:47:54.330256+00:00"}