{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TIAPVXUYFOYCXOVSHHY3TKFMDH","short_pith_number":"pith:TIAPVXUY","schema_version":"1.0","canonical_sha256":"9a00fade982bb02bbab239f1b9a8ac19db2e0408945b4ab3bc498799f0635db5","source":{"kind":"arxiv","id":"1410.6890","version":3},"attestation_state":"computed","paper":{"title":"Random Almost-Popular Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Osamu Watanabe, Suthee Ruangwises","submitted_at":"2014-10-25T06:34:42Z","abstract_excerpt":"For a set $A$ of $n$ people and a set $B$ of $m$ items, with each person having a preference list that ranks all items from most wanted to least wanted, we consider the problem of matching every person with a unique item. A matching $M$ is called $\\epsilon$-popular if for any other matching $M'$, the number of people who prefer $M'$ to $M$ is at most $\\epsilon n$ plus the number of those who prefer $M$ to $M'$. In 2006, Mahdian showed that when randomly generating people's preference lists, if $m/n > 1.42$, then a 0-popular matching exists with $1-o(1)$ probability; and if $m/n < 1.42$, then 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":"1410.6890","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T06:34:42Z","cross_cats_sorted":[],"title_canon_sha256":"69d9e114c49e64b7bc1897c56f6932c43c13f013c9753dd3a3e358e08d27f081","abstract_canon_sha256":"6efbfafa8c65a670e20b4e8eee7eade73bef4972a4c7cc8e0e58580c4478de2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:31.215810Z","signature_b64":"Bb5dO68erTFHee70y1EGjCuUqTpVU6zqVLaiaA1W+ky19WHS/Rd7zkE1bkLy/bkgaJ66mRs8LfkgeJx+ycETAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a00fade982bb02bbab239f1b9a8ac19db2e0408945b4ab3bc498799f0635db5","last_reissued_at":"2026-05-18T01:03:31.215245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:31.215245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Almost-Popular Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Osamu Watanabe, Suthee Ruangwises","submitted_at":"2014-10-25T06:34:42Z","abstract_excerpt":"For a set $A$ of $n$ people and a set $B$ of $m$ items, with each person having a preference list that ranks all items from most wanted to least wanted, we consider the problem of matching every person with a unique item. A matching $M$ is called $\\epsilon$-popular if for any other matching $M'$, the number of people who prefer $M'$ to $M$ is at most $\\epsilon n$ plus the number of those who prefer $M$ to $M'$. In 2006, Mahdian showed that when randomly generating people's preference lists, if $m/n > 1.42$, then a 0-popular matching exists with $1-o(1)$ probability; and if $m/n < 1.42$, then a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6890","kind":"arxiv","version":3},"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":"1410.6890","created_at":"2026-05-18T01:03:31.215331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6890v3","created_at":"2026-05-18T01:03:31.215331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6890","created_at":"2026-05-18T01:03:31.215331+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIAPVXUYFOYC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIAPVXUYFOYCXOVS","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIAPVXUY","created_at":"2026-05-18T12:28:49.207871+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/TIAPVXUYFOYCXOVSHHY3TKFMDH","json":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH.json","graph_json":"https://pith.science/api/pith-number/TIAPVXUYFOYCXOVSHHY3TKFMDH/graph.json","events_json":"https://pith.science/api/pith-number/TIAPVXUYFOYCXOVSHHY3TKFMDH/events.json","paper":"https://pith.science/paper/TIAPVXUY"},"agent_actions":{"view_html":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH","download_json":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH.json","view_paper":"https://pith.science/paper/TIAPVXUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6890&json=true","fetch_graph":"https://pith.science/api/pith-number/TIAPVXUYFOYCXOVSHHY3TKFMDH/graph.json","fetch_events":"https://pith.science/api/pith-number/TIAPVXUYFOYCXOVSHHY3TKFMDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/action/storage_attestation","attest_author":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/action/author_attestation","sign_citation":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/action/citation_signature","submit_replication":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/action/replication_record"}},"created_at":"2026-05-18T01:03:31.215331+00:00","updated_at":"2026-05-18T01:03:31.215331+00:00"}