{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7K5UM62GC7OQ4LXOHMLCDOFLIG","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":"d64a52db8af885f12fbebb9eb6ab41cf8998fd7a41a610d4c5f49b89c20be836","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T13:34:26Z","title_canon_sha256":"5ea1da6f23ad3bc289f91dca4c0de6173885ea39ccecd7079c5bb91403f4f847"},"schema_version":"1.0","source":{"id":"1908.02628","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02628","created_at":"2026-07-05T02:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02628v3","created_at":"2026-07-05T02:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02628","created_at":"2026-07-05T02:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"7K5UM62GC7OQ","created_at":"2026-07-05T02:51:57Z"},{"alias_kind":"pith_short_16","alias_value":"7K5UM62GC7OQ4LXO","created_at":"2026-07-05T02:51:57Z"},{"alias_kind":"pith_short_8","alias_value":"7K5UM62G","created_at":"2026-07-05T02:51:57Z"}],"graph_snapshots":[{"event_id":"sha256:bc62b6cddf93954e6069edbaf918617a257b914dd3757f83f68cc552188d542f","target":"graph","created_at":"2026-07-05T02:51:57Z","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/1908.02628/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A simple generalization of the Hall's condition in bipartite graphs, the Normalized Matching Property (NMP) in a graph $G(X,Y,E)$ with vertex partition $(X,Y)$ states that for any subset $S\\subseteq X$, we have $\\frac{|N(S)|}{|Y|}\\ge\\frac{|S|}{|X|}$. In this paper, we show the following results about having the Normalized Matching Property in random and pseudorandom graphs.\n  1. We establish $p=\\frac{\\log n}{k}$ as a sharp threshold for having NMP in $\\mathbb{G}(k,n,p)$, which is the graph with $|X|=k,|Y|=n$ (assuming $k\\le n\\leq \\exp(o(k))$), and in which each pair $(x,y)\\in X\\times Y$ is an ","authors_text":"Deepanshu Kush, Niranjan Balachandran","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T13:34:26Z","title":"The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02628","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:6a2da6e3e020cf9f24e68c7dd2610469087e1d6b745d20be6e0bf24e7a8ef948","target":"record","created_at":"2026-07-05T02:51:57Z","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":"d64a52db8af885f12fbebb9eb6ab41cf8998fd7a41a610d4c5f49b89c20be836","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T13:34:26Z","title_canon_sha256":"5ea1da6f23ad3bc289f91dca4c0de6173885ea39ccecd7079c5bb91403f4f847"},"schema_version":"1.0","source":{"id":"1908.02628","kind":"arxiv","version":3}},"canonical_sha256":"fabb467b4617dd0e2eee3b1621b8ab418d4b22072e04ce1e0b80d97344e9c130","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fabb467b4617dd0e2eee3b1621b8ab418d4b22072e04ce1e0b80d97344e9c130","first_computed_at":"2026-07-05T02:51:57.516252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:51:57.516252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+SHK+/k1n9Nc+YyLNwse/SklEE/ezjZJMDuaQGXqJWA4zgEWG4s8XB8pATbe/Lw1yqpo9pIz2QcHL3oP6lNHCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:51:57.516703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02628","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a2da6e3e020cf9f24e68c7dd2610469087e1d6b745d20be6e0bf24e7a8ef948","sha256:bc62b6cddf93954e6069edbaf918617a257b914dd3757f83f68cc552188d542f"],"state_sha256":"a12df63636bb2addc140f6cba375dea35f7b377a12a89b4a3e0e2b0f262e65f1"}