{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XKXG7OEXJKWRBCVBPMIONF2F3O","short_pith_number":"pith:XKXG7OEX","schema_version":"1.0","canonical_sha256":"baae6fb8974aad108aa17b10e69745dbaca286d69e21fa18cfbfc49abc3267d4","source":{"kind":"arxiv","id":"2406.06421","version":2},"attestation_state":"computed","paper":{"title":"Random matchings in linear hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hyunwoo Lee","submitted_at":"2024-06-10T16:12:57Z","abstract_excerpt":"For a given hypergraph $H$ and a vertex $v\\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the probability that $M$ does not cover $v$ is $(1 + o_d(1))d^{-1/k}$ for all vertices $v\\in V(H).$ This conjecture was proved for $k = 2$ by Kahn and Kim in $1998.$\n  In this paper, we disprove this conjecture for all $k \\geq 3.$ For infinitely many values of $d,$ we construct $d$-regular linear $k$-uniform hypergraph $H$ containing two vertices $v_1$ and $v_2$ such tha"},"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":"2406.06421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-10T16:12:57Z","cross_cats_sorted":[],"title_canon_sha256":"59b27decd9b98068ca12ff294cca6de2a78125e39e0256198c48d2d984f58853","abstract_canon_sha256":"7d286a7d93ce8e26dfd36086dcf2b2274e6639610c8f3d911956d7618b14aaa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:14.649991Z","signature_b64":"SbjD1dseaUcJ//F5JlPnrUtGMoQ8aRNsbStcqxgf1JLGawJyhQ2xuoVjBu0aeNhw4Z0dhweYUHkAGTcVbm0kBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baae6fb8974aad108aa17b10e69745dbaca286d69e21fa18cfbfc49abc3267d4","last_reissued_at":"2026-07-05T08:30:14.649498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:14.649498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random matchings in linear hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hyunwoo Lee","submitted_at":"2024-06-10T16:12:57Z","abstract_excerpt":"For a given hypergraph $H$ and a vertex $v\\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the probability that $M$ does not cover $v$ is $(1 + o_d(1))d^{-1/k}$ for all vertices $v\\in V(H).$ This conjecture was proved for $k = 2$ by Kahn and Kim in $1998.$\n  In this paper, we disprove this conjecture for all $k \\geq 3.$ For infinitely many values of $d,$ we construct $d$-regular linear $k$-uniform hypergraph $H$ containing two vertices $v_1$ and $v_2$ such tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06421","kind":"arxiv","version":2},"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/2406.06421/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":"2406.06421","created_at":"2026-07-05T08:30:14.649553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06421v2","created_at":"2026-07-05T08:30:14.649553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06421","created_at":"2026-07-05T08:30:14.649553+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKXG7OEXJKWR","created_at":"2026-07-05T08:30:14.649553+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKXG7OEXJKWRBCVB","created_at":"2026-07-05T08:30:14.649553+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKXG7OEX","created_at":"2026-07-05T08:30:14.649553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14882","citing_title":"Perturbation of the largest matching root of hypergraphs","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O","json":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O.json","graph_json":"https://pith.science/api/pith-number/XKXG7OEXJKWRBCVBPMIONF2F3O/graph.json","events_json":"https://pith.science/api/pith-number/XKXG7OEXJKWRBCVBPMIONF2F3O/events.json","paper":"https://pith.science/paper/XKXG7OEX"},"agent_actions":{"view_html":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O","download_json":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O.json","view_paper":"https://pith.science/paper/XKXG7OEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06421&json=true","fetch_graph":"https://pith.science/api/pith-number/XKXG7OEXJKWRBCVBPMIONF2F3O/graph.json","fetch_events":"https://pith.science/api/pith-number/XKXG7OEXJKWRBCVBPMIONF2F3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O/action/storage_attestation","attest_author":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O/action/author_attestation","sign_citation":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O/action/citation_signature","submit_replication":"https://pith.science/pith/XKXG7OEXJKWRBCVBPMIONF2F3O/action/replication_record"}},"created_at":"2026-07-05T08:30:14.649553+00:00","updated_at":"2026-07-05T08:30:14.649553+00:00"}