{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JP6RY44PMLLTEAKJVT7LOFNINS","short_pith_number":"pith:JP6RY44P","canonical_record":{"source":{"id":"1805.06944","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T19:33:59Z","cross_cats_sorted":[],"title_canon_sha256":"987e3d27be26d162d5f87604c751c89b0ed78cc952e82a7e995840eef59a9be1","abstract_canon_sha256":"315f462aac01a48aefe57467484e7d2f911ab49d7ae2e17e9e48c426ce71b688"},"schema_version":"1.0"},"canonical_sha256":"4bfd1c738f62d7320149acfeb715a86c98d08125385bf701175d433667107e0c","source":{"kind":"arxiv","id":"1805.06944","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06944","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06944v5","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06944","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"JP6RY44PMLLT","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"pith_short_16","alias_value":"JP6RY44PMLLTEAKJ","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"pith_short_8","alias_value":"JP6RY44P","created_at":"2026-07-05T01:48:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JP6RY44PMLLTEAKJVT7LOFNINS","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06944","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T19:33:59Z","cross_cats_sorted":[],"title_canon_sha256":"987e3d27be26d162d5f87604c751c89b0ed78cc952e82a7e995840eef59a9be1","abstract_canon_sha256":"315f462aac01a48aefe57467484e7d2f911ab49d7ae2e17e9e48c426ce71b688"},"schema_version":"1.0"},"canonical_sha256":"4bfd1c738f62d7320149acfeb715a86c98d08125385bf701175d433667107e0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:48:04.586554Z","signature_b64":"avWYb3UGBz7IOJohw5UQD09IFwLIU5QRSEcLFaNvN8n8wKxHsM6/DU2G+etl1JP4+nK9qhAgnBw1j4TOUHfvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bfd1c738f62d7320149acfeb715a86c98d08125385bf701175d433667107e0c","last_reissued_at":"2026-07-05T01:48:04.586129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:48:04.586129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06944","source_version":5,"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-07-05T01:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xpzQEOo7+1bT/QzSs5bxhlk2GJzKlKhxryT1xfIEY2AaiCsdI/36l+YgyQodVtIq8sU8a/d+c5flIqEzwWxdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:08:57.154916Z"},"content_sha256":"61db15602923e4997b6b1b18b040feb760932bf5758cd97844ba32304fcf6b52","schema_version":"1.0","event_id":"sha256:61db15602923e4997b6b1b18b040feb760932bf5758cd97844ba32304fcf6b52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JP6RY44PMLLTEAKJVT7LOFNINS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect Matchings in Random Subgraphs of Regular Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Simkin, Roman Glebov, Zur Luria","submitted_at":"2018-05-17T19:33:59Z","abstract_excerpt":"Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect matching appears at the moment at which the last isolated vertex disappears. We extend this result to arbitrary $k$-regular bipartite graphs $G$ on $2n$ vertices for all $k = \\omega \\left( \\frac{n}{\\log^{1/3} n} \\right)$.\n  Surprisingly, this is not the case for smaller values of $k$. Using a construction due to Goel, Kapralov and Khanna, we show that there e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06944","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.06944/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcYpl4bCMbZfxK/PEmo03a3lr93GsKnNLe/YKUzFTnmnHBhSdvqzYO5lJjilvK/pNYL0YAQydHMkz3dzVfnMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:08:57.155280Z"},"content_sha256":"63b0919311bf3af9de1ae4fb80e488176d56afebf7700fb34f51110a934fe566","schema_version":"1.0","event_id":"sha256:63b0919311bf3af9de1ae4fb80e488176d56afebf7700fb34f51110a934fe566"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JP6RY44PMLLTEAKJVT7LOFNINS/bundle.json","state_url":"https://pith.science/pith/JP6RY44PMLLTEAKJVT7LOFNINS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JP6RY44PMLLTEAKJVT7LOFNINS/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-07-06T15:08:57Z","links":{"resolver":"https://pith.science/pith/JP6RY44PMLLTEAKJVT7LOFNINS","bundle":"https://pith.science/pith/JP6RY44PMLLTEAKJVT7LOFNINS/bundle.json","state":"https://pith.science/pith/JP6RY44PMLLTEAKJVT7LOFNINS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JP6RY44PMLLTEAKJVT7LOFNINS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JP6RY44PMLLTEAKJVT7LOFNINS","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":"315f462aac01a48aefe57467484e7d2f911ab49d7ae2e17e9e48c426ce71b688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T19:33:59Z","title_canon_sha256":"987e3d27be26d162d5f87604c751c89b0ed78cc952e82a7e995840eef59a9be1"},"schema_version":"1.0","source":{"id":"1805.06944","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06944","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06944v5","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06944","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"JP6RY44PMLLT","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"pith_short_16","alias_value":"JP6RY44PMLLTEAKJ","created_at":"2026-07-05T01:48:04Z"},{"alias_kind":"pith_short_8","alias_value":"JP6RY44P","created_at":"2026-07-05T01:48:04Z"}],"graph_snapshots":[{"event_id":"sha256:63b0919311bf3af9de1ae4fb80e488176d56afebf7700fb34f51110a934fe566","target":"graph","created_at":"2026-07-05T01:48:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1805.06944/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect matching appears at the moment at which the last isolated vertex disappears. We extend this result to arbitrary $k$-regular bipartite graphs $G$ on $2n$ vertices for all $k = \\omega \\left( \\frac{n}{\\log^{1/3} n} \\right)$.\n  Surprisingly, this is not the case for smaller values of $k$. Using a construction due to Goel, Kapralov and Khanna, we show that there e","authors_text":"Michael Simkin, Roman Glebov, Zur Luria","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T19:33:59Z","title":"Perfect Matchings in Random Subgraphs of Regular Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06944","kind":"arxiv","version":5},"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:61db15602923e4997b6b1b18b040feb760932bf5758cd97844ba32304fcf6b52","target":"record","created_at":"2026-07-05T01:48:04Z","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":"315f462aac01a48aefe57467484e7d2f911ab49d7ae2e17e9e48c426ce71b688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T19:33:59Z","title_canon_sha256":"987e3d27be26d162d5f87604c751c89b0ed78cc952e82a7e995840eef59a9be1"},"schema_version":"1.0","source":{"id":"1805.06944","kind":"arxiv","version":5}},"canonical_sha256":"4bfd1c738f62d7320149acfeb715a86c98d08125385bf701175d433667107e0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bfd1c738f62d7320149acfeb715a86c98d08125385bf701175d433667107e0c","first_computed_at":"2026-07-05T01:48:04.586129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:48:04.586129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"avWYb3UGBz7IOJohw5UQD09IFwLIU5QRSEcLFaNvN8n8wKxHsM6/DU2G+etl1JP4+nK9qhAgnBw1j4TOUHfvAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:48:04.586554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06944","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61db15602923e4997b6b1b18b040feb760932bf5758cd97844ba32304fcf6b52","sha256:63b0919311bf3af9de1ae4fb80e488176d56afebf7700fb34f51110a934fe566"],"state_sha256":"286c6158a11c89ab189e64669b742addb15d0c1983133a2ccb86c86dd7817814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4s3oMf46nTOHivAVxlkhxSbLKalUfGrJDAC5GdydbjpQzWcayszOQknp4nyRxOkhaVHvvZ+Y4IZdjkRJhPfrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:08:57.157230Z","bundle_sha256":"39138c6edfa6c51349d33bf72b06ff501c749b743912d770bd23fff9e87eb16b"}}