{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KL2NJCMH3WNO5DVNSZBZG23NJX","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":"d541edf25cb9ca7c8ae758b16a9cc5ea156de7c82f7cf46b23bc1b7db24694a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T15:26:20Z","title_canon_sha256":"2e57e0b59420c205ccc8cd70041c136f8353141571b99f4edea8fa644a14fd2b"},"schema_version":"1.0","source":{"id":"1701.06451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06451","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06451v1","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06451","created_at":"2026-05-18T00:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"KL2NJCMH3WNO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KL2NJCMH3WNO5DVN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KL2NJCMH","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:df5c016b3fa97088cc2347e67b3f57ce2b3aebd22d5fe50c819c3fcc078d1e14","target":"graph","created_at":"2026-05-18T00:52:18Z","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"},"paper":{"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","authors_text":"Lothar Narins, Penny Haxell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T15:26:20Z","title":"A Stability Theorem for Matchings in Tripartite 3-Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06451","kind":"arxiv","version":1},"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:981d64729afaeb34ece4ea2e5c088e60f4a015587fdd689d55be9b9aa269da0e","target":"record","created_at":"2026-05-18T00:52:18Z","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":"d541edf25cb9ca7c8ae758b16a9cc5ea156de7c82f7cf46b23bc1b7db24694a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-23T15:26:20Z","title_canon_sha256":"2e57e0b59420c205ccc8cd70041c136f8353141571b99f4edea8fa644a14fd2b"},"schema_version":"1.0","source":{"id":"1701.06451","kind":"arxiv","version":1}},"canonical_sha256":"52f4d48987dd9aee8ead9643936b6d4dd84252339da163aae53eec118282868f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f4d48987dd9aee8ead9643936b6d4dd84252339da163aae53eec118282868f","first_computed_at":"2026-05-18T00:52:18.330442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:18.330442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rl3bAGXtDa0B/7jaIu+IKvZjJ4Oe3zkwl+WkaZvZsUu7USvc4f/xpxjiqCG+bpxJwVMjggqzNhZdA8wG6j3DAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:18.330924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:981d64729afaeb34ece4ea2e5c088e60f4a015587fdd689d55be9b9aa269da0e","sha256:df5c016b3fa97088cc2347e67b3f57ce2b3aebd22d5fe50c819c3fcc078d1e14"],"state_sha256":"9079a54e81f59c151c11e429a426536e5bec77ad86e625001934934a318b4078"}