{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DW2V7SL7WEEBTX36MVWWHUGQAR","short_pith_number":"pith:DW2V7SL7","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"},"canonical_sha256":"1db55fc97fb10819df7e656d63d0d0047c0b24493208309bc7cca4493526f7b4","source":{"kind":"arxiv","id":"1903.05764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05764","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05764v1","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05764","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"DW2V7SL7WEEB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DW2V7SL7WEEBTX36","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DW2V7SL7","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DW2V7SL7WEEBTX36MVWWHUGQAR","target":"record","payload":{"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"},"canonical_sha256":"1db55fc97fb10819df7e656d63d0d0047c0b24493208309bc7cca4493526f7b4","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"},"source_kind":"arxiv","source_id":"1903.05764","source_version":1,"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-17T23:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkI4b6wDLUMg+S94oeTzdUXB6khDWXrmJ8rHZcks4NTuoRdEKF5o1Df0IiQMorgrflr8K0yXJqIr5+iitRiICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:19:12.809584Z"},"content_sha256":"eb95dee6baa5364b1b8e2825c3a0d68d7ace9cb151920b8dce1f26747694155c","schema_version":"1.0","event_id":"sha256:eb95dee6baa5364b1b8e2825c3a0d68d7ace9cb151920b8dce1f26747694155c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DW2V7SL7WEEBTX36MVWWHUGQAR","target":"graph","payload":{"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"},"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-17T23:51:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03NdX3v357XlZPcXI8GFmM6qLo6iRgtgW1LI2JHN/yg3p2fi9vvcCmxkVMBuyJ2+GrQSZl0HtGJtNwW/PRPQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:19:12.809965Z"},"content_sha256":"14008f4749fa979bd3f3c6a308d742763249ae94d67b8d583bcabab5b291d266","schema_version":"1.0","event_id":"sha256:14008f4749fa979bd3f3c6a308d742763249ae94d67b8d583bcabab5b291d266"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/bundle.json","state_url":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/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-06-22T23:19:12Z","links":{"resolver":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR","bundle":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/bundle.json","state":"https://pith.science/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DW2V7SL7WEEBTX36MVWWHUGQAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DW2V7SL7WEEBTX36MVWWHUGQAR","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":"d4b8dbbedcee7e9e5c3f3249cbd9f70e012a31604f23f631ec823f868d334b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-13T23:54:31Z","title_canon_sha256":"d4cac26e312fd7f0f651af9d00d39c0d6ddea060b2a115b0a90b26b474e50a53"},"schema_version":"1.0","source":{"id":"1903.05764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05764","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05764v1","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05764","created_at":"2026-05-17T23:51:16Z"},{"alias_kind":"pith_short_12","alias_value":"DW2V7SL7WEEB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DW2V7SL7WEEBTX36","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DW2V7SL7","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:14008f4749fa979bd3f3c6a308d742763249ae94d67b8d583bcabab5b291d266","target":"graph","created_at":"2026-05-17T23:51:16Z","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":"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","authors_text":"Boris Pittel, Ed Overman, Michal Karo\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-13T23:54:31Z","title":"On a perfect matching in a random bipartite digraph with average out-degree below two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05764","kind":"arxiv","version":1},"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:eb95dee6baa5364b1b8e2825c3a0d68d7ace9cb151920b8dce1f26747694155c","target":"record","created_at":"2026-05-17T23:51:16Z","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":"d4b8dbbedcee7e9e5c3f3249cbd9f70e012a31604f23f631ec823f868d334b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-13T23:54:31Z","title_canon_sha256":"d4cac26e312fd7f0f651af9d00d39c0d6ddea060b2a115b0a90b26b474e50a53"},"schema_version":"1.0","source":{"id":"1903.05764","kind":"arxiv","version":1}},"canonical_sha256":"1db55fc97fb10819df7e656d63d0d0047c0b24493208309bc7cca4493526f7b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1db55fc97fb10819df7e656d63d0d0047c0b24493208309bc7cca4493526f7b4","first_computed_at":"2026-05-17T23:51:16.302580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:16.302580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jL5N79K+2fzS5NpWPX9OvcUHKA/BE9174MuZVCWkwxU19IaSF7LbW/noTNgIkSa5G2IUq6f4CphQiliqK+pJAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:16.303036Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb95dee6baa5364b1b8e2825c3a0d68d7ace9cb151920b8dce1f26747694155c","sha256:14008f4749fa979bd3f3c6a308d742763249ae94d67b8d583bcabab5b291d266"],"state_sha256":"4e5222e86282660317e2aa658eda3579eb741555cc97ea5957b5cbd3c65d7927"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eO7faqcGazlDnyQZQvecmTvFVOeNOjmhw896lbJdqm/wrSfVNtjo9I4ETxsbAe9YTKSOJSkDelWU5RANUWFfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:19:12.811932Z","bundle_sha256":"a143a6522a6fad66c1e5c7c68b064e30967896b9c417a6527c707c7a64a5d6db"}}