{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TIAPVXUYFOYCXOVSHHY3TKFMDH","short_pith_number":"pith:TIAPVXUY","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"},"canonical_sha256":"9a00fade982bb02bbab239f1b9a8ac19db2e0408945b4ab3bc498799f0635db5","source":{"kind":"arxiv","id":"1410.6890","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6890","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6890v3","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6890","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"TIAPVXUYFOYC","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TIAPVXUYFOYCXOVS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TIAPVXUY","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TIAPVXUYFOYCXOVSHHY3TKFMDH","target":"record","payload":{"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"},"canonical_sha256":"9a00fade982bb02bbab239f1b9a8ac19db2e0408945b4ab3bc498799f0635db5","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"},"source_kind":"arxiv","source_id":"1410.6890","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5zsBWYlh+a235SYAIo8i2SkDJLtTLwaZibjybod4Dk4vmTnWOOA41r7qHojkVfrWd7WXVywiAINZzNkJ8KQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:28:35.829139Z"},"content_sha256":"56bcd10630e77ab0263e505c5d91ce57c5ab3ae50e5a45de58ed0402ed730941","schema_version":"1.0","event_id":"sha256:56bcd10630e77ab0263e505c5d91ce57c5ab3ae50e5a45de58ed0402ed730941"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TIAPVXUYFOYCXOVSHHY3TKFMDH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuo4kI88d9RFIOUyodE8EUGfwQY0r8xiLakjG+jpp0Qu+7ImVvAwekpPm/XmmENABAJxtgt/UE46zTC+MusUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:28:35.829792Z"},"content_sha256":"17fc7382d2889c8aacd98aad22d9bac6d5238bb28428311313b14e4393f58624","schema_version":"1.0","event_id":"sha256:17fc7382d2889c8aacd98aad22d9bac6d5238bb28428311313b14e4393f58624"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/bundle.json","state_url":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T15:28:35Z","links":{"resolver":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH","bundle":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/bundle.json","state":"https://pith.science/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIAPVXUYFOYCXOVSHHY3TKFMDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TIAPVXUYFOYCXOVSHHY3TKFMDH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6efbfafa8c65a670e20b4e8eee7eade73bef4972a4c7cc8e0e58580c4478de2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T06:34:42Z","title_canon_sha256":"69d9e114c49e64b7bc1897c56f6932c43c13f013c9753dd3a3e358e08d27f081"},"schema_version":"1.0","source":{"id":"1410.6890","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6890","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6890v3","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6890","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"TIAPVXUYFOYC","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TIAPVXUYFOYCXOVS","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TIAPVXUY","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:17fc7382d2889c8aacd98aad22d9bac6d5238bb28428311313b14e4393f58624","target":"graph","created_at":"2026-05-18T01:03:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Osamu Watanabe, Suthee Ruangwises","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T06:34:42Z","title":"Random Almost-Popular Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6890","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:56bcd10630e77ab0263e505c5d91ce57c5ab3ae50e5a45de58ed0402ed730941","target":"record","created_at":"2026-05-18T01:03:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6efbfafa8c65a670e20b4e8eee7eade73bef4972a4c7cc8e0e58580c4478de2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-25T06:34:42Z","title_canon_sha256":"69d9e114c49e64b7bc1897c56f6932c43c13f013c9753dd3a3e358e08d27f081"},"schema_version":"1.0","source":{"id":"1410.6890","kind":"arxiv","version":3}},"canonical_sha256":"9a00fade982bb02bbab239f1b9a8ac19db2e0408945b4ab3bc498799f0635db5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a00fade982bb02bbab239f1b9a8ac19db2e0408945b4ab3bc498799f0635db5","first_computed_at":"2026-05-18T01:03:31.215245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:31.215245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bb5dO68erTFHee70y1EGjCuUqTpVU6zqVLaiaA1W+ky19WHS/Rd7zkE1bkLy/bkgaJ66mRs8LfkgeJx+ycETAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:31.215810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6890","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56bcd10630e77ab0263e505c5d91ce57c5ab3ae50e5a45de58ed0402ed730941","sha256:17fc7382d2889c8aacd98aad22d9bac6d5238bb28428311313b14e4393f58624"],"state_sha256":"3fd774e7bf92149b4a38ff9996db588bc990366ac93c093b9e5fe2430314e114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35rEvlIH9zRIKFEzrfb1HwA4xKWU8fNaknpe2/GkEX5Z0S2SeGAKInhg7xa/qRIw6/BuY3Q4Us+U0kWelO4BDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:28:35.833705Z","bundle_sha256":"baeaaeaa26eea70dec69e902b3ea73b53c7e942b4b2eec140ef3aa3c315b3510"}}