{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4RA4D2OFJIR53RU6EIWRBUGTSA","short_pith_number":"pith:4RA4D2OF","schema_version":"1.0","canonical_sha256":"e441c1e9c54a23ddc69e222d10d0d3901e63ad332122f46ed080ce5cd39f6ee3","source":{"kind":"arxiv","id":"1302.7251","version":2},"attestation_state":"computed","paper":{"title":"Modeling Stable Matching Problems with Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ann Now\\'e, Martine De Cock, Sofie De Clercq, Steven Schockaert","submitted_at":"2013-02-28T16:43:43Z","abstract_excerpt":"The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications. Each time a new variant is considered, however, a new algorithm needs to be developed and implemented. As an alternative, in this paper we propose an encoding of the SMP using Answer Set Programming (ASP). Our encoding can easily be extended and adapted to the needs of specific applications. As an illustration we show how stable matchings can be found when ind"},"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":"1302.7251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-28T16:43:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"89a3b054340524ea45d87d2a5b5ab3a2ca779d9a805dd57cf691a36a73067426","abstract_canon_sha256":"fbc6535eb4dca1c9d8099c3fccd43e062ac692471e4e4976e80d29be98ac4ba2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.826992Z","signature_b64":"w8ZgibbzltJ6cLDtnaUeqO7vC8fWZmFEyR4vUQbphqhS7XnkD+yGuI6ruOXHHNXA1LELhyDumrVQu7zmvgORBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e441c1e9c54a23ddc69e222d10d0d3901e63ad332122f46ed080ce5cd39f6ee3","last_reissued_at":"2026-05-18T03:26:40.826433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.826433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Stable Matching Problems with Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ann Now\\'e, Martine De Cock, Sofie De Clercq, Steven Schockaert","submitted_at":"2013-02-28T16:43:43Z","abstract_excerpt":"The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications. Each time a new variant is considered, however, a new algorithm needs to be developed and implemented. As an alternative, in this paper we propose an encoding of the SMP using Answer Set Programming (ASP). Our encoding can easily be extended and adapted to the needs of specific applications. As an illustration we show how stable matchings can be found when ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7251","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.7251","created_at":"2026-05-18T03:26:40.826536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.7251v2","created_at":"2026-05-18T03:26:40.826536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7251","created_at":"2026-05-18T03:26:40.826536+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RA4D2OFJIR5","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RA4D2OFJIR53RU6","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RA4D2OF","created_at":"2026-05-18T12:27:34.582898+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/4RA4D2OFJIR53RU6EIWRBUGTSA","json":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA.json","graph_json":"https://pith.science/api/pith-number/4RA4D2OFJIR53RU6EIWRBUGTSA/graph.json","events_json":"https://pith.science/api/pith-number/4RA4D2OFJIR53RU6EIWRBUGTSA/events.json","paper":"https://pith.science/paper/4RA4D2OF"},"agent_actions":{"view_html":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA","download_json":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA.json","view_paper":"https://pith.science/paper/4RA4D2OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.7251&json=true","fetch_graph":"https://pith.science/api/pith-number/4RA4D2OFJIR53RU6EIWRBUGTSA/graph.json","fetch_events":"https://pith.science/api/pith-number/4RA4D2OFJIR53RU6EIWRBUGTSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA/action/storage_attestation","attest_author":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA/action/author_attestation","sign_citation":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA/action/citation_signature","submit_replication":"https://pith.science/pith/4RA4D2OFJIR53RU6EIWRBUGTSA/action/replication_record"}},"created_at":"2026-05-18T03:26:40.826536+00:00","updated_at":"2026-05-18T03:26:40.826536+00:00"}