{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7K5UM62GC7OQ4LXOHMLCDOFLIG","short_pith_number":"pith:7K5UM62G","schema_version":"1.0","canonical_sha256":"fabb467b4617dd0e2eee3b1621b8ab418d4b22072e04ce1e0b80d97344e9c130","source":{"kind":"arxiv","id":"1908.02628","version":3},"attestation_state":"computed","paper":{"title":"The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Deepanshu Kush, Niranjan Balachandran","submitted_at":"2019-08-07T13:34:26Z","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 "},"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":"1908.02628","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-07T13:34:26Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"5ea1da6f23ad3bc289f91dca4c0de6173885ea39ccecd7079c5bb91403f4f847","abstract_canon_sha256":"d64a52db8af885f12fbebb9eb6ab41cf8998fd7a41a610d4c5f49b89c20be836"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:57.516703Z","signature_b64":"+SHK+/k1n9Nc+YyLNwse/SklEE/ezjZJMDuaQGXqJWA4zgEWG4s8XB8pATbe/Lw1yqpo9pIz2QcHL3oP6lNHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fabb467b4617dd0e2eee3b1621b8ab418d4b22072e04ce1e0b80d97344e9c130","last_reissued_at":"2026-07-05T02:51:57.516252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:57.516252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Deepanshu Kush, Niranjan Balachandran","submitted_at":"2019-08-07T13:34:26Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02628","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02628/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.02628","created_at":"2026-07-05T02:51:57.516326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02628v3","created_at":"2026-07-05T02:51:57.516326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02628","created_at":"2026-07-05T02:51:57.516326+00:00"},{"alias_kind":"pith_short_12","alias_value":"7K5UM62GC7OQ","created_at":"2026-07-05T02:51:57.516326+00:00"},{"alias_kind":"pith_short_16","alias_value":"7K5UM62GC7OQ4LXO","created_at":"2026-07-05T02:51:57.516326+00:00"},{"alias_kind":"pith_short_8","alias_value":"7K5UM62G","created_at":"2026-07-05T02:51:57.516326+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/7K5UM62GC7OQ4LXOHMLCDOFLIG","json":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG.json","graph_json":"https://pith.science/api/pith-number/7K5UM62GC7OQ4LXOHMLCDOFLIG/graph.json","events_json":"https://pith.science/api/pith-number/7K5UM62GC7OQ4LXOHMLCDOFLIG/events.json","paper":"https://pith.science/paper/7K5UM62G"},"agent_actions":{"view_html":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG","download_json":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG.json","view_paper":"https://pith.science/paper/7K5UM62G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02628&json=true","fetch_graph":"https://pith.science/api/pith-number/7K5UM62GC7OQ4LXOHMLCDOFLIG/graph.json","fetch_events":"https://pith.science/api/pith-number/7K5UM62GC7OQ4LXOHMLCDOFLIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG/action/storage_attestation","attest_author":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG/action/author_attestation","sign_citation":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG/action/citation_signature","submit_replication":"https://pith.science/pith/7K5UM62GC7OQ4LXOHMLCDOFLIG/action/replication_record"}},"created_at":"2026-07-05T02:51:57.516326+00:00","updated_at":"2026-07-05T02:51:57.516326+00:00"}