{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KEVX5P3RBHVJDOBGRHUVD4HPAG","short_pith_number":"pith:KEVX5P3R","schema_version":"1.0","canonical_sha256":"512b7ebf7109ea91b82689e951f0ef019536029b108b714788263bc1429ec9c2","source":{"kind":"arxiv","id":"1804.09156","version":2},"attestation_state":"computed","paper":{"title":"Robust and Approximately Stable Marriages under Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kate Larson, Vijay Menon","submitted_at":"2018-04-24T17:21:52Z","abstract_excerpt":"We study the stable marriage problem in the partial information setting where the agents, although they have an underlying true strict linear order, are allowed to specify partial orders. Specifically, we focus on the case where the agents are allowed to submit strict weak orders and we try to address the following questions from the perspective of a market-designer: i) How can a designer generate matchings that are robust? ii) What is the trade-off between the amount of missing information and the \"quality\" of solution one can get? With the goal of resolving these questions through a simple a"},"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":"1804.09156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-04-24T17:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"0eb07d95942985bb5a80fd4faf5a25b1f81660ea19cdf6c1e8e2f35becb02bf2","abstract_canon_sha256":"98d07b409c04ce3580cac14b8eec4b370e6fdad824b865a5aa66a4f40b3cdc9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.066547Z","signature_b64":"/KaUuYkhEAObgWaIwOzvTtfU7pQXU/aME8AxjcTOzHoJRqFVrUMt4kuz4slNL4poRAvg2FaSWFG5ZVm/4vq0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512b7ebf7109ea91b82689e951f0ef019536029b108b714788263bc1429ec9c2","last_reissued_at":"2026-05-18T00:03:56.065925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.065925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Approximately Stable Marriages under Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kate Larson, Vijay Menon","submitted_at":"2018-04-24T17:21:52Z","abstract_excerpt":"We study the stable marriage problem in the partial information setting where the agents, although they have an underlying true strict linear order, are allowed to specify partial orders. Specifically, we focus on the case where the agents are allowed to submit strict weak orders and we try to address the following questions from the perspective of a market-designer: i) How can a designer generate matchings that are robust? ii) What is the trade-off between the amount of missing information and the \"quality\" of solution one can get? With the goal of resolving these questions through a simple a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09156","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":"1804.09156","created_at":"2026-05-18T00:03:56.066015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09156v2","created_at":"2026-05-18T00:03:56.066015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09156","created_at":"2026-05-18T00:03:56.066015+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEVX5P3RBHVJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEVX5P3RBHVJDOBG","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEVX5P3R","created_at":"2026-05-18T12:32:33.847187+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/KEVX5P3RBHVJDOBGRHUVD4HPAG","json":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG.json","graph_json":"https://pith.science/api/pith-number/KEVX5P3RBHVJDOBGRHUVD4HPAG/graph.json","events_json":"https://pith.science/api/pith-number/KEVX5P3RBHVJDOBGRHUVD4HPAG/events.json","paper":"https://pith.science/paper/KEVX5P3R"},"agent_actions":{"view_html":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG","download_json":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG.json","view_paper":"https://pith.science/paper/KEVX5P3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09156&json=true","fetch_graph":"https://pith.science/api/pith-number/KEVX5P3RBHVJDOBGRHUVD4HPAG/graph.json","fetch_events":"https://pith.science/api/pith-number/KEVX5P3RBHVJDOBGRHUVD4HPAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG/action/storage_attestation","attest_author":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG/action/author_attestation","sign_citation":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG/action/citation_signature","submit_replication":"https://pith.science/pith/KEVX5P3RBHVJDOBGRHUVD4HPAG/action/replication_record"}},"created_at":"2026-05-18T00:03:56.066015+00:00","updated_at":"2026-05-18T00:03:56.066015+00:00"}