{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:K67ZUPJAK3LPX5KPLQ7R72UQNO","short_pith_number":"pith:K67ZUPJA","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"},"canonical_sha256":"57bf9a3d2056d6fbf54f5c3f1fea906b914f5adc9d5ef4075428358edf3fee8c","source":{"kind":"arxiv","id":"1503.03671","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03671","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03671v3","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03671","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"K67ZUPJAK3LP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K67ZUPJAK3LPX5KP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K67ZUPJA","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:K67ZUPJAK3LPX5KPLQ7R72UQNO","target":"record","payload":{"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"},"canonical_sha256":"57bf9a3d2056d6fbf54f5c3f1fea906b914f5adc9d5ef4075428358edf3fee8c","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"},"source_kind":"arxiv","source_id":"1503.03671","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzMfwSOE9PQIv6Oqriv1k8zTfytIghk8c/k4Ba1HVEPeQlSAWHfmTrKHPcJUGVlibl2+whMTyqLOgXF7MrUEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:58:09.357986Z"},"content_sha256":"3771cbc4f69d057d432666dd71aa12b0603b97ca422559a070f8891cc9b029fe","schema_version":"1.0","event_id":"sha256:3771cbc4f69d057d432666dd71aa12b0603b97ca422559a070f8891cc9b029fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:K67ZUPJAK3LPX5KPLQ7R72UQNO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHk3TtXOAtQ56+Il+rflVigt0nqO0wvjbI7id8JOQ7lLV4vKvXLtxHxKqRWFmaLRQSwt8jXMcE1a/dJbgnJlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:58:09.358605Z"},"content_sha256":"6c4b5e9159089c48937e9aa13bebb9df8ccb708c674076490547acd7f6a33d1a","schema_version":"1.0","event_id":"sha256:6c4b5e9159089c48937e9aa13bebb9df8ccb708c674076490547acd7f6a33d1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/bundle.json","state_url":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T15:58:09Z","links":{"resolver":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO","bundle":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/bundle.json","state":"https://pith.science/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K67ZUPJAK3LPX5KPLQ7R72UQNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:K67ZUPJAK3LPX5KPLQ7R72UQNO","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":"76529294378abc0fece9466b47240d9444edf4b82a5b0793d084725074462c8a","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-12T11:08:15Z","title_canon_sha256":"dabecd453df4fbacd49d3ef6e2f12c9cd4c2cda9c8d8f97a8c8b6cad2a560ff8"},"schema_version":"1.0","source":{"id":"1503.03671","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03671","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03671v3","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03671","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"K67ZUPJAK3LP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K67ZUPJAK3LPX5KP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K67ZUPJA","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:6c4b5e9159089c48937e9aa13bebb9df8ccb708c674076490547acd7f6a33d1a","target":"graph","created_at":"2026-05-18T00:49:52Z","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":"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","authors_text":"Eran Omri, Gabriel Nivasch","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-12T11:08:15Z","title":"Rainbow matchings and algebras of sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03671","kind":"arxiv","version":3},"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:3771cbc4f69d057d432666dd71aa12b0603b97ca422559a070f8891cc9b029fe","target":"record","created_at":"2026-05-18T00:49:52Z","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":"76529294378abc0fece9466b47240d9444edf4b82a5b0793d084725074462c8a","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-12T11:08:15Z","title_canon_sha256":"dabecd453df4fbacd49d3ef6e2f12c9cd4c2cda9c8d8f97a8c8b6cad2a560ff8"},"schema_version":"1.0","source":{"id":"1503.03671","kind":"arxiv","version":3}},"canonical_sha256":"57bf9a3d2056d6fbf54f5c3f1fea906b914f5adc9d5ef4075428358edf3fee8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57bf9a3d2056d6fbf54f5c3f1fea906b914f5adc9d5ef4075428358edf3fee8c","first_computed_at":"2026-05-18T00:49:52.731093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:52.731093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AB4u+k5/6QEyxSEKEwGjTQsUV10dtkssjeJOAbcpOymbTrF3M7p2NJ3jt9Vv6c6Q8Bnl0tkkXRTaapb/HkuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:52.731520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03671","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3771cbc4f69d057d432666dd71aa12b0603b97ca422559a070f8891cc9b029fe","sha256:6c4b5e9159089c48937e9aa13bebb9df8ccb708c674076490547acd7f6a33d1a"],"state_sha256":"d010bc8e1927ca68bd85e4516fc612c8652d3679648012e2f8e4e8282891ff1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Z0o7yaBvOmmlIgazTeF6OIpN5FbmVAGo8RSRgYasoatiAxsRzIi43ufbbCCHP8aY4WmhREnl7J9ud8BbPAPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:58:09.361754Z","bundle_sha256":"1835f681684433cef7e52b46faddbd172368e125ab1b7bbe98c7b85fb1d77889"}}