{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KL2NJCMH3WNO5DVNSZBZG23NJX","short_pith_number":"pith:KL2NJCMH","schema_version":"1.0","canonical_sha256":"52f4d48987dd9aee8ead9643936b6d4dd84252339da163aae53eec118282868f","source":{"kind":"arxiv","id":"1701.06451","version":1},"attestation_state":"computed","paper":{"title":"A Stability Theorem for Matchings in Tripartite 3-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lothar Narins, Penny Haxell","submitted_at":"2017-01-23T15:26:20Z","abstract_excerpt":"It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we prove a stability version of this statement, establishing that every regular tripartite hypergraph with matching number at most $(1 + \\varepsilon)n/2$ is close in structure to the extremal configuration, where \"closeness\" is measured by an explicit function of $\\varepsilon$. We also answer a question of Aharoni, Kotlar and Ziv about matchings in hypergraphs w"},"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":"1701.06451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T15:26:20Z","cross_cats_sorted":[],"title_canon_sha256":"2e57e0b59420c205ccc8cd70041c136f8353141571b99f4edea8fa644a14fd2b","abstract_canon_sha256":"d541edf25cb9ca7c8ae758b16a9cc5ea156de7c82f7cf46b23bc1b7db24694a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:18.330924Z","signature_b64":"rl3bAGXtDa0B/7jaIu+IKvZjJ4Oe3zkwl+WkaZvZsUu7USvc4f/xpxjiqCG+bpxJwVMjggqzNhZdA8wG6j3DAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f4d48987dd9aee8ead9643936b6d4dd84252339da163aae53eec118282868f","last_reissued_at":"2026-05-18T00:52:18.330442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:18.330442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stability Theorem for Matchings in Tripartite 3-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lothar Narins, Penny Haxell","submitted_at":"2017-01-23T15:26:20Z","abstract_excerpt":"It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we prove a stability version of this statement, establishing that every regular tripartite hypergraph with matching number at most $(1 + \\varepsilon)n/2$ is close in structure to the extremal configuration, where \"closeness\" is measured by an explicit function of $\\varepsilon$. We also answer a question of Aharoni, Kotlar and Ziv about matchings in hypergraphs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06451","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06451","created_at":"2026-05-18T00:52:18.330524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06451v1","created_at":"2026-05-18T00:52:18.330524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06451","created_at":"2026-05-18T00:52:18.330524+00:00"},{"alias_kind":"pith_short_12","alias_value":"KL2NJCMH3WNO","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KL2NJCMH3WNO5DVN","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KL2NJCMH","created_at":"2026-05-18T12:31:24.725408+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/KL2NJCMH3WNO5DVNSZBZG23NJX","json":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX.json","graph_json":"https://pith.science/api/pith-number/KL2NJCMH3WNO5DVNSZBZG23NJX/graph.json","events_json":"https://pith.science/api/pith-number/KL2NJCMH3WNO5DVNSZBZG23NJX/events.json","paper":"https://pith.science/paper/KL2NJCMH"},"agent_actions":{"view_html":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX","download_json":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX.json","view_paper":"https://pith.science/paper/KL2NJCMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06451&json=true","fetch_graph":"https://pith.science/api/pith-number/KL2NJCMH3WNO5DVNSZBZG23NJX/graph.json","fetch_events":"https://pith.science/api/pith-number/KL2NJCMH3WNO5DVNSZBZG23NJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX/action/storage_attestation","attest_author":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX/action/author_attestation","sign_citation":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX/action/citation_signature","submit_replication":"https://pith.science/pith/KL2NJCMH3WNO5DVNSZBZG23NJX/action/replication_record"}},"created_at":"2026-05-18T00:52:18.330524+00:00","updated_at":"2026-05-18T00:52:18.330524+00:00"}