{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EXHSAHRM7VAPWR3KR6F3YJEGPL","short_pith_number":"pith:EXHSAHRM","canonical_record":{"source":{"id":"2011.14363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-11-29T13:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"59b8d28e08da8d7fd90bc73d629847dc8bcc061abb7222b2fcfc6cc6214aab13","abstract_canon_sha256":"38b00d1bb603351f4985016d8710d2074f2f22b2eb8ec25fb5bb152b6e651380"},"schema_version":"1.0"},"canonical_sha256":"25cf201e2cfd40fb476a8f8bbc24867ad3b09ae0e9ef861a43119b3ad894968f","source":{"kind":"arxiv","id":"2011.14363","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.14363","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"2011.14363v3","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14363","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"EXHSAHRM7VAP","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"pith_short_16","alias_value":"EXHSAHRM7VAPWR3K","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"pith_short_8","alias_value":"EXHSAHRM","created_at":"2026-07-05T03:18:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EXHSAHRM7VAPWR3KR6F3YJEGPL","target":"record","payload":{"canonical_record":{"source":{"id":"2011.14363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-11-29T13:03:33Z","cross_cats_sorted":[],"title_canon_sha256":"59b8d28e08da8d7fd90bc73d629847dc8bcc061abb7222b2fcfc6cc6214aab13","abstract_canon_sha256":"38b00d1bb603351f4985016d8710d2074f2f22b2eb8ec25fb5bb152b6e651380"},"schema_version":"1.0"},"canonical_sha256":"25cf201e2cfd40fb476a8f8bbc24867ad3b09ae0e9ef861a43119b3ad894968f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:18:25.597359Z","signature_b64":"HvNnMeDD+Fd5tFKrqlVnV/2Pho/8tIhzSrgDFF77uo9kiCG3/j7INwg+Tx2fSCV06wRCqgVG+RO3q14JTgoSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25cf201e2cfd40fb476a8f8bbc24867ad3b09ae0e9ef861a43119b3ad894968f","last_reissued_at":"2026-07-05T03:18:25.596865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:18:25.596865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.14363","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-07-05T03:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZCQbnkZzqtCCH5UBuc/dyjbnF1e8OMwEJ41M+k4OY0hMwRyjeYo39mcWqbS1mcuX6WoOJyReYQ/hqMziogKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T18:32:30.601426Z"},"content_sha256":"80caacfa3cd593e19a2f8b436769086ad83dbf2b337e3a87528fc8adca6d6531","schema_version":"1.0","event_id":"sha256:80caacfa3cd593e19a2f8b436769086ad83dbf2b337e3a87528fc8adca6d6531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EXHSAHRM7VAPWR3KR6F3YJEGPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the rainbow matching conjecture for 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu, Jie Ma, Jun Gao, Xingxing Yu","submitted_at":"2020-11-29T13:03:33Z","abstract_excerpt":"Aharoni and Howard, and, independently, Huang, Loh, and Sudakov proposed the following rainbow version of Erd\\H{o}s matching conjecture: For positive integers $n,k,m$ with $n\\ge km$, if each of the families $F_1,\\ldots, F_m\\subseteq {[n]\\choose k}$ has size more than $\\max\\{\\binom{n}{k} - \\binom{n-m+1}{k}, \\binom{km-1}{k}\\}$, then there exist pairwise disjoint subsets $e_1,\\dots, e_m$ such that $e_i\\in F_i$ for all $i\\in [m]$. We prove that there exists an absolute constant $n_0$ such that this rainbow version holds for $k=3$ and $n\\geq n_0$. We convert this rainbow matching problem to a match"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14363","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.14363/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"},"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-07-05T03:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3iUAiyk6O8kqfYB47x1m77uvi61RROagCqXHeLlaXo2ror82wS/TkNHo6Vm6YPXbBCb02t2+kOASXANyv3HCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T18:32:30.601791Z"},"content_sha256":"192467ee69f2e6ce998d1114bb57ee9db227eeed1d71a8e7720dbd6398599bb3","schema_version":"1.0","event_id":"sha256:192467ee69f2e6ce998d1114bb57ee9db227eeed1d71a8e7720dbd6398599bb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXHSAHRM7VAPWR3KR6F3YJEGPL/bundle.json","state_url":"https://pith.science/pith/EXHSAHRM7VAPWR3KR6F3YJEGPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXHSAHRM7VAPWR3KR6F3YJEGPL/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-07-13T18:32:30Z","links":{"resolver":"https://pith.science/pith/EXHSAHRM7VAPWR3KR6F3YJEGPL","bundle":"https://pith.science/pith/EXHSAHRM7VAPWR3KR6F3YJEGPL/bundle.json","state":"https://pith.science/pith/EXHSAHRM7VAPWR3KR6F3YJEGPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXHSAHRM7VAPWR3KR6F3YJEGPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EXHSAHRM7VAPWR3KR6F3YJEGPL","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":"38b00d1bb603351f4985016d8710d2074f2f22b2eb8ec25fb5bb152b6e651380","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-11-29T13:03:33Z","title_canon_sha256":"59b8d28e08da8d7fd90bc73d629847dc8bcc061abb7222b2fcfc6cc6214aab13"},"schema_version":"1.0","source":{"id":"2011.14363","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.14363","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"2011.14363v3","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14363","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"EXHSAHRM7VAP","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"pith_short_16","alias_value":"EXHSAHRM7VAPWR3K","created_at":"2026-07-05T03:18:25Z"},{"alias_kind":"pith_short_8","alias_value":"EXHSAHRM","created_at":"2026-07-05T03:18:25Z"}],"graph_snapshots":[{"event_id":"sha256:192467ee69f2e6ce998d1114bb57ee9db227eeed1d71a8e7720dbd6398599bb3","target":"graph","created_at":"2026-07-05T03:18:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.14363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Aharoni and Howard, and, independently, Huang, Loh, and Sudakov proposed the following rainbow version of Erd\\H{o}s matching conjecture: For positive integers $n,k,m$ with $n\\ge km$, if each of the families $F_1,\\ldots, F_m\\subseteq {[n]\\choose k}$ has size more than $\\max\\{\\binom{n}{k} - \\binom{n-m+1}{k}, \\binom{km-1}{k}\\}$, then there exist pairwise disjoint subsets $e_1,\\dots, e_m$ such that $e_i\\in F_i$ for all $i\\in [m]$. We prove that there exists an absolute constant $n_0$ such that this rainbow version holds for $k=3$ and $n\\geq n_0$. We convert this rainbow matching problem to a match","authors_text":"Hongliang Lu, Jie Ma, Jun Gao, Xingxing Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-11-29T13:03:33Z","title":"On the rainbow matching conjecture for 3-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14363","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:80caacfa3cd593e19a2f8b436769086ad83dbf2b337e3a87528fc8adca6d6531","target":"record","created_at":"2026-07-05T03:18:25Z","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":"38b00d1bb603351f4985016d8710d2074f2f22b2eb8ec25fb5bb152b6e651380","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-11-29T13:03:33Z","title_canon_sha256":"59b8d28e08da8d7fd90bc73d629847dc8bcc061abb7222b2fcfc6cc6214aab13"},"schema_version":"1.0","source":{"id":"2011.14363","kind":"arxiv","version":3}},"canonical_sha256":"25cf201e2cfd40fb476a8f8bbc24867ad3b09ae0e9ef861a43119b3ad894968f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25cf201e2cfd40fb476a8f8bbc24867ad3b09ae0e9ef861a43119b3ad894968f","first_computed_at":"2026-07-05T03:18:25.596865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:18:25.596865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HvNnMeDD+Fd5tFKrqlVnV/2Pho/8tIhzSrgDFF77uo9kiCG3/j7INwg+Tx2fSCV06wRCqgVG+RO3q14JTgoSAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:18:25.597359Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.14363","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80caacfa3cd593e19a2f8b436769086ad83dbf2b337e3a87528fc8adca6d6531","sha256:192467ee69f2e6ce998d1114bb57ee9db227eeed1d71a8e7720dbd6398599bb3"],"state_sha256":"a8e2a1341ee0d1f97945d5c45934961501d8d5c0226e2986c078257918d716ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuapF0DgDlxUkJnhTvVY/NxP0i0HCLJm1pfJV1cfVD7/ipkHvcad4Qpi+qf2nMcYVt44OnPqASGv9BmhtDc9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T18:32:30.603907Z","bundle_sha256":"9a3354ef5a2ef2d8fdec5b7d69c3b95d1dd11bebda1ccbecbe4ecf809428c950"}}