{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DW2V7SL7WEEBTX36MVWWHUGQAR","short_pith_number":"pith:DW2V7SL7","schema_version":"1.0","canonical_sha256":"1db55fc97fb10819df7e656d63d0d0047c0b24493208309bc7cca4493526f7b4","source":{"kind":"arxiv","id":"1903.05764","version":1},"attestation_state":"computed","paper":{"title":"On a perfect matching in a random bipartite digraph with average out-degree below two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel, Ed Overman, Michal Karo\\'nski","submitted_at":"2019-03-13T23:54:31Z","abstract_excerpt":"Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of selections made by each vertex overall is below $2$. More precisely, in the first round each vertex chooses a potential mate uniformly at random, and independently of all vertices. Given a fixed integer $m$, a vertex is classified as unpopular if it has been chosen by at most $m$ vertices from the other side. Each unpopular vertex makes yet another uniform/ind"},"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":"1903.05764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-13T23:54:31Z","cross_cats_sorted":[],"title_canon_sha256":"d4cac26e312fd7f0f651af9d00d39c0d6ddea060b2a115b0a90b26b474e50a53","abstract_canon_sha256":"d4b8dbbedcee7e9e5c3f3249cbd9f70e012a31604f23f631ec823f868d334b55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:16.303036Z","signature_b64":"jL5N79K+2fzS5NpWPX9OvcUHKA/BE9174MuZVCWkwxU19IaSF7LbW/noTNgIkSa5G2IUq6f4CphQiliqK+pJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1db55fc97fb10819df7e656d63d0d0047c0b24493208309bc7cca4493526f7b4","last_reissued_at":"2026-05-17T23:51:16.302580Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:16.302580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a perfect matching in a random bipartite digraph with average out-degree below two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel, Ed Overman, Michal Karo\\'nski","submitted_at":"2019-03-13T23:54:31Z","abstract_excerpt":"Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of selections made by each vertex overall is below $2$. More precisely, in the first round each vertex chooses a potential mate uniformly at random, and independently of all vertices. Given a fixed integer $m$, a vertex is classified as unpopular if it has been chosen by at most $m$ vertices from the other side. Each unpopular vertex makes yet another uniform/ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05764","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":"1903.05764","created_at":"2026-05-17T23:51:16.302641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05764v1","created_at":"2026-05-17T23:51:16.302641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05764","created_at":"2026-05-17T23:51:16.302641+00:00"},{"alias_kind":"pith_short_12","alias_value":"DW2V7SL7WEEB","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DW2V7SL7WEEBTX36","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DW2V7SL7","created_at":"2026-05-18T12:33:15.570797+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/DW2V7SL7WEEBTX36MVWWHUGQAR","json":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR.json","graph_json":"https://pith.science/api/pith-number/DW2V7SL7WEEBTX36MVWWHUGQAR/graph.json","events_json":"https://pith.science/api/pith-number/DW2V7SL7WEEBTX36MVWWHUGQAR/events.json","paper":"https://pith.science/paper/DW2V7SL7"},"agent_actions":{"view_html":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR","download_json":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR.json","view_paper":"https://pith.science/paper/DW2V7SL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05764&json=true","fetch_graph":"https://pith.science/api/pith-number/DW2V7SL7WEEBTX36MVWWHUGQAR/graph.json","fetch_events":"https://pith.science/api/pith-number/DW2V7SL7WEEBTX36MVWWHUGQAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/action/storage_attestation","attest_author":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/action/author_attestation","sign_citation":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/action/citation_signature","submit_replication":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/action/replication_record"}},"created_at":"2026-05-17T23:51:16.302641+00:00","updated_at":"2026-05-17T23:51:16.302641+00:00"}