{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JMXANPBLPC7QZ4CM6J2MBXMQ3E","short_pith_number":"pith:JMXANPBL","schema_version":"1.0","canonical_sha256":"4b2e06bc2b78bf0cf04cf274c0dd90d938502806b51d47b2da3e80fc64bb0812","source":{"kind":"arxiv","id":"1412.1130","version":1},"attestation_state":"computed","paper":{"title":"It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Rafail Ostrovsky, Will Rosenbaum","submitted_at":"2014-12-02T23:14:41Z","abstract_excerpt":"In 1976, Knuth asked if the stable marriage problem (SMP) can be generalized to marriages consisting of 3 genders. In 1988, Alkan showed that the natural generalization of SMP to 3 genders ($3$GSM) need not admit a stable marriage. Three years later, Ng and Hirschberg proved that it is NP-complete to determine if given preferences admit a stable marriage. They further prove an analogous result for the $3$ person stable assignment ($3$PSA) problem.\n  In light of Ng and Hirschberg's NP-hardness result for $3$GSM and $3$PSA, we initiate the study of approximate versions of these problems. In part"},"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":"1412.1130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-02T23:14:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3e6636e434880dbdf7b4bac991894f1550853ef84b41f5eaa00da5baf6399f57","abstract_canon_sha256":"53e0a1a94ae203c9d772b06caf51dc470a92bd7a9b5e829cb61d3dd11cdb5f7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:13.362980Z","signature_b64":"iahdHBsIycUMrvjwo3AD9PkjF+eAwhWcsVIIBR9mE13l4akIuLTh8W4D12Z1w6i5FNybpt7D5GO980lFBxixBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b2e06bc2b78bf0cf04cf274c0dd90d938502806b51d47b2da3e80fc64bb0812","last_reissued_at":"2026-05-18T02:32:13.362563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:13.362563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Rafail Ostrovsky, Will Rosenbaum","submitted_at":"2014-12-02T23:14:41Z","abstract_excerpt":"In 1976, Knuth asked if the stable marriage problem (SMP) can be generalized to marriages consisting of 3 genders. In 1988, Alkan showed that the natural generalization of SMP to 3 genders ($3$GSM) need not admit a stable marriage. Three years later, Ng and Hirschberg proved that it is NP-complete to determine if given preferences admit a stable marriage. They further prove an analogous result for the $3$ person stable assignment ($3$PSA) problem.\n  In light of Ng and Hirschberg's NP-hardness result for $3$GSM and $3$PSA, we initiate the study of approximate versions of these problems. In part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1130","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":"1412.1130","created_at":"2026-05-18T02:32:13.362630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1130v1","created_at":"2026-05-18T02:32:13.362630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1130","created_at":"2026-05-18T02:32:13.362630+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMXANPBLPC7Q","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMXANPBLPC7QZ4CM","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMXANPBL","created_at":"2026-05-18T12:28:33.132498+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/JMXANPBLPC7QZ4CM6J2MBXMQ3E","json":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E.json","graph_json":"https://pith.science/api/pith-number/JMXANPBLPC7QZ4CM6J2MBXMQ3E/graph.json","events_json":"https://pith.science/api/pith-number/JMXANPBLPC7QZ4CM6J2MBXMQ3E/events.json","paper":"https://pith.science/paper/JMXANPBL"},"agent_actions":{"view_html":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E","download_json":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E.json","view_paper":"https://pith.science/paper/JMXANPBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1130&json=true","fetch_graph":"https://pith.science/api/pith-number/JMXANPBLPC7QZ4CM6J2MBXMQ3E/graph.json","fetch_events":"https://pith.science/api/pith-number/JMXANPBLPC7QZ4CM6J2MBXMQ3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E/action/storage_attestation","attest_author":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E/action/author_attestation","sign_citation":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E/action/citation_signature","submit_replication":"https://pith.science/pith/JMXANPBLPC7QZ4CM6J2MBXMQ3E/action/replication_record"}},"created_at":"2026-05-18T02:32:13.362630+00:00","updated_at":"2026-05-18T02:32:13.362630+00:00"}