{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HBVNZCZJUCFEITOLANCCNR2QI2","short_pith_number":"pith:HBVNZCZJ","schema_version":"1.0","canonical_sha256":"386adc8b29a08a444dcb034426c75046aa7d8ddca5cee96b00be215612aa3dc2","source":{"kind":"arxiv","id":"1905.05100","version":1},"attestation_state":"computed","paper":{"title":"Partitioning infinite hypergraphs into few monochromatic Berge-paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Corsten, N\\'ora Frankl, Sebasti\\'an Bustamante","submitted_at":"2019-05-13T15:41:17Z","abstract_excerpt":"Extending a result of Rado to hypergraphs, we prove that for all $s, k, t \\in \\mathbb{N}$ with $k \\geq t \\geq 2$, the vertices of every $r = s(k-t+1)$-edge-coloured countably infinite complete $k$-graph can be partitioned into the cores of at most $s$ monochromatic $t$-tight Berge-paths of different colours. We further describe a construction showing that this result is best possible."},"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":"1905.05100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T15:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"74e2564710f1189b28b5b74494074dbfca203d4d046ce27e909d95c498fe83fe","abstract_canon_sha256":"115939044ffdd7dec8d2db871bf6d605d079446fb48178da2c1830d7c730f819"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:22.547271Z","signature_b64":"AQYs6B+Lhg6BhSU8wFXx3op7xXMv42WnEntKMirLKqvXcIZjD+1kUbbipE2qVwqX3DxoBW4e2neI/MEFzL/CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"386adc8b29a08a444dcb034426c75046aa7d8ddca5cee96b00be215612aa3dc2","last_reissued_at":"2026-05-17T23:46:22.546674Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:22.546674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning infinite hypergraphs into few monochromatic Berge-paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Corsten, N\\'ora Frankl, Sebasti\\'an Bustamante","submitted_at":"2019-05-13T15:41:17Z","abstract_excerpt":"Extending a result of Rado to hypergraphs, we prove that for all $s, k, t \\in \\mathbb{N}$ with $k \\geq t \\geq 2$, the vertices of every $r = s(k-t+1)$-edge-coloured countably infinite complete $k$-graph can be partitioned into the cores of at most $s$ monochromatic $t$-tight Berge-paths of different colours. We further describe a construction showing that this result is best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05100","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":"1905.05100","created_at":"2026-05-17T23:46:22.546762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05100v1","created_at":"2026-05-17T23:46:22.546762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05100","created_at":"2026-05-17T23:46:22.546762+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBVNZCZJUCFE","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBVNZCZJUCFEITOL","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBVNZCZJ","created_at":"2026-05-18T12:33:18.533446+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/HBVNZCZJUCFEITOLANCCNR2QI2","json":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2.json","graph_json":"https://pith.science/api/pith-number/HBVNZCZJUCFEITOLANCCNR2QI2/graph.json","events_json":"https://pith.science/api/pith-number/HBVNZCZJUCFEITOLANCCNR2QI2/events.json","paper":"https://pith.science/paper/HBVNZCZJ"},"agent_actions":{"view_html":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2","download_json":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2.json","view_paper":"https://pith.science/paper/HBVNZCZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05100&json=true","fetch_graph":"https://pith.science/api/pith-number/HBVNZCZJUCFEITOLANCCNR2QI2/graph.json","fetch_events":"https://pith.science/api/pith-number/HBVNZCZJUCFEITOLANCCNR2QI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2/action/storage_attestation","attest_author":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2/action/author_attestation","sign_citation":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2/action/citation_signature","submit_replication":"https://pith.science/pith/HBVNZCZJUCFEITOLANCCNR2QI2/action/replication_record"}},"created_at":"2026-05-17T23:46:22.546762+00:00","updated_at":"2026-05-17T23:46:22.546762+00:00"}