{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C2R6IX5G2P65B6XYC3DYRCINIV","short_pith_number":"pith:C2R6IX5G","schema_version":"1.0","canonical_sha256":"16a3e45fa6d3fdd0faf816c788890d45582d75fd02d08d42743b1d564e6883b9","source":{"kind":"arxiv","id":"1901.03192","version":2},"attestation_state":"computed","paper":{"title":"Price of Anarchy in Algorithmic Matching of Romantic Partners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.SI"],"primary_cat":"cs.GT","authors_text":"Andr\\'es Abeliuk, Iyad Rahwan, Khaled Elbassioni, Manuel Cebrian, Talal Rahwan","submitted_at":"2019-01-08T20:18:29Z","abstract_excerpt":"Algorithmic-matching sites offer users access to an unprecedented number of potential mates. However, they also pose a principal-agent problem with a potential moral hazard. The agent's interest is to maximize usage of the Web site, while the principal's interest is to find the best possible romantic partners. This creates a conflict of interest: optimally matching users would lead to stable couples and fewer singles using the site, which is detrimental for the online dating industry. Here, we borrow the notion of Price-of-Anarchy from game theory to quantify the decrease in social efficiency "},"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":"1901.03192","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-01-08T20:18:29Z","cross_cats_sorted":["cs.CY","cs.SI"],"title_canon_sha256":"018c8b9cea674f8d2a3b65a44a7f0143611c2403ceba2aa3f6bf7873645c49fd","abstract_canon_sha256":"33f87f5132d66fc1b481ec07bfd1f9f131bfe78908f51726d008003914485a8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:49.652156Z","signature_b64":"5NPS4hV+AqKpx6Icw8EgRDNH/93U84EFOeHEpbDUrmNGatsclnQaNwO98Ghh8R5SCnNyGtY5ZytZbsI3B3fWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16a3e45fa6d3fdd0faf816c788890d45582d75fd02d08d42743b1d564e6883b9","last_reissued_at":"2026-05-17T23:53:49.651570Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:49.651570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Price of Anarchy in Algorithmic Matching of Romantic Partners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.SI"],"primary_cat":"cs.GT","authors_text":"Andr\\'es Abeliuk, Iyad Rahwan, Khaled Elbassioni, Manuel Cebrian, Talal Rahwan","submitted_at":"2019-01-08T20:18:29Z","abstract_excerpt":"Algorithmic-matching sites offer users access to an unprecedented number of potential mates. However, they also pose a principal-agent problem with a potential moral hazard. The agent's interest is to maximize usage of the Web site, while the principal's interest is to find the best possible romantic partners. This creates a conflict of interest: optimally matching users would lead to stable couples and fewer singles using the site, which is detrimental for the online dating industry. Here, we borrow the notion of Price-of-Anarchy from game theory to quantify the decrease in social efficiency "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03192","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":"1901.03192","created_at":"2026-05-17T23:53:49.651651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03192v2","created_at":"2026-05-17T23:53:49.651651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03192","created_at":"2026-05-17T23:53:49.651651+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2R6IX5G2P65","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2R6IX5G2P65B6XY","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2R6IX5G","created_at":"2026-05-18T12:33:12.712433+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/C2R6IX5G2P65B6XYC3DYRCINIV","json":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV.json","graph_json":"https://pith.science/api/pith-number/C2R6IX5G2P65B6XYC3DYRCINIV/graph.json","events_json":"https://pith.science/api/pith-number/C2R6IX5G2P65B6XYC3DYRCINIV/events.json","paper":"https://pith.science/paper/C2R6IX5G"},"agent_actions":{"view_html":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV","download_json":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV.json","view_paper":"https://pith.science/paper/C2R6IX5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03192&json=true","fetch_graph":"https://pith.science/api/pith-number/C2R6IX5G2P65B6XYC3DYRCINIV/graph.json","fetch_events":"https://pith.science/api/pith-number/C2R6IX5G2P65B6XYC3DYRCINIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV/action/storage_attestation","attest_author":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV/action/author_attestation","sign_citation":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV/action/citation_signature","submit_replication":"https://pith.science/pith/C2R6IX5G2P65B6XYC3DYRCINIV/action/replication_record"}},"created_at":"2026-05-17T23:53:49.651651+00:00","updated_at":"2026-05-17T23:53:49.651651+00:00"}