{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K67ZUPJAK3LPX5KPLQ7R72UQNO","short_pith_number":"pith:K67ZUPJA","schema_version":"1.0","canonical_sha256":"57bf9a3d2056d6fbf54f5c3f1fea906b914f5adc9d5ef4075428358edf3fee8c","source":{"kind":"arxiv","id":"1503.03671","version":3},"attestation_state":"computed","paper":{"title":"Rainbow matchings and algebras of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Eran Omri, Gabriel Nivasch","submitted_at":"2015-03-12T11:08:15Z","abstract_excerpt":"Grinblat (2002) asks the following question in the context of algebras of sets: What is the smallest number $\\mathfrak v = \\mathfrak v(n)$ such that, if $A_1, \\ldots, A_n$ are $n$ equivalence relations on a common finite ground set $X$, such that for each $i$ there are at least $\\mathfrak v$ elements of $X$ that belong to $A_i$-equivalence classes of size larger than $1$, then $X$ has a rainbow matching---a set of $2n$ distinct elements $a_1, b_1, \\ldots, a_n, b_n$, such that $a_i$ is $A_i$-equivalent to $b_i$ for each $i$?\n  Grinblat has shown that $\\mathfrak v(n) \\le 10n/3 + O(\\sqrt{n})$. He"},"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":"1503.03671","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-12T11:08:15Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"dabecd453df4fbacd49d3ef6e2f12c9cd4c2cda9c8d8f97a8c8b6cad2a560ff8","abstract_canon_sha256":"76529294378abc0fece9466b47240d9444edf4b82a5b0793d084725074462c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.731520Z","signature_b64":"2AB4u+k5/6QEyxSEKEwGjTQsUV10dtkssjeJOAbcpOymbTrF3M7p2NJ3jt9Vv6c6Q8Bnl0tkkXRTaapb/HkuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57bf9a3d2056d6fbf54f5c3f1fea906b914f5adc9d5ef4075428358edf3fee8c","last_reissued_at":"2026-05-18T00:49:52.731093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.731093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow matchings and algebras of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Eran Omri, Gabriel Nivasch","submitted_at":"2015-03-12T11:08:15Z","abstract_excerpt":"Grinblat (2002) asks the following question in the context of algebras of sets: What is the smallest number $\\mathfrak v = \\mathfrak v(n)$ such that, if $A_1, \\ldots, A_n$ are $n$ equivalence relations on a common finite ground set $X$, such that for each $i$ there are at least $\\mathfrak v$ elements of $X$ that belong to $A_i$-equivalence classes of size larger than $1$, then $X$ has a rainbow matching---a set of $2n$ distinct elements $a_1, b_1, \\ldots, a_n, b_n$, such that $a_i$ is $A_i$-equivalent to $b_i$ for each $i$?\n  Grinblat has shown that $\\mathfrak v(n) \\le 10n/3 + O(\\sqrt{n})$. He"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03671","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":""},"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":"1503.03671","created_at":"2026-05-18T00:49:52.731155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03671v3","created_at":"2026-05-18T00:49:52.731155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03671","created_at":"2026-05-18T00:49:52.731155+00:00"},{"alias_kind":"pith_short_12","alias_value":"K67ZUPJAK3LP","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K67ZUPJAK3LPX5KP","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K67ZUPJA","created_at":"2026-05-18T12:29:27.538025+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/K67ZUPJAK3LPX5KPLQ7R72UQNO","json":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO.json","graph_json":"https://pith.science/api/pith-number/K67ZUPJAK3LPX5KPLQ7R72UQNO/graph.json","events_json":"https://pith.science/api/pith-number/K67ZUPJAK3LPX5KPLQ7R72UQNO/events.json","paper":"https://pith.science/paper/K67ZUPJA"},"agent_actions":{"view_html":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO","download_json":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO.json","view_paper":"https://pith.science/paper/K67ZUPJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03671&json=true","fetch_graph":"https://pith.science/api/pith-number/K67ZUPJAK3LPX5KPLQ7R72UQNO/graph.json","fetch_events":"https://pith.science/api/pith-number/K67ZUPJAK3LPX5KPLQ7R72UQNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/action/storage_attestation","attest_author":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/action/author_attestation","sign_citation":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/action/citation_signature","submit_replication":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/action/replication_record"}},"created_at":"2026-05-18T00:49:52.731155+00:00","updated_at":"2026-05-18T00:49:52.731155+00:00"}