{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A3YFJQGKZBAQ5D2MUUPZKZF2EW","short_pith_number":"pith:A3YFJQGK","canonical_record":{"source":{"id":"1808.09836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T13:59:27Z","cross_cats_sorted":[],"title_canon_sha256":"0d5c9521f4eb819588d9dd9862ba528bd1de7c5c44799db2c966723521a55852","abstract_canon_sha256":"55e292f722d893f9c5dc529d6a4d4427ff24f1769b44666ab505122efaa9d8b6"},"schema_version":"1.0"},"canonical_sha256":"06f054c0cac8410e8f4ca51f9564ba25ad153a912b829d7e02c5e2306a90d347","source":{"kind":"arxiv","id":"1808.09836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09836","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09836v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09836","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"A3YFJQGKZBAQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A3YFJQGKZBAQ5D2M","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A3YFJQGK","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A3YFJQGKZBAQ5D2MUUPZKZF2EW","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T13:59:27Z","cross_cats_sorted":[],"title_canon_sha256":"0d5c9521f4eb819588d9dd9862ba528bd1de7c5c44799db2c966723521a55852","abstract_canon_sha256":"55e292f722d893f9c5dc529d6a4d4427ff24f1769b44666ab505122efaa9d8b6"},"schema_version":"1.0"},"canonical_sha256":"06f054c0cac8410e8f4ca51f9564ba25ad153a912b829d7e02c5e2306a90d347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:54.324548Z","signature_b64":"xvQPlhLamhHMQ+FuJrHL91M2ZJsjQFqjxtkYIddSVw+LQIGRwDbEOtlzy4a/pxEC8j5hiR412NVeq4ld3LgrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06f054c0cac8410e8f4ca51f9564ba25ad153a912b829d7e02c5e2306a90d347","last_reissued_at":"2026-05-18T00:06:54.323876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:54.323876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09836","source_version":1,"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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFoOpiqjlj4xOO4gRS9fjrcVuU7xg8eV5yTeNwcIhfONXsGV9e0FMdFDvPHwvRP+0o7eIdv9/VCOv9uOymycDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:58:20.275204Z"},"content_sha256":"754c964549933c4ee3bf0e3663aca43db696f4ef059507c5b5572f499166ad6f","schema_version":"1.0","event_id":"sha256:754c964549933c4ee3bf0e3663aca43db696f4ef059507c5b5572f499166ad6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A3YFJQGKZBAQ5D2MUUPZKZF2EW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl B\\\"urger, Max Pitz","submitted_at":"2018-08-29T13:59:27Z","abstract_excerpt":"In 1978, Richard Rado showed that every edge-coloured complete graph of countably infinite order can be partitioned into monochromatic paths of different colours. He asked whether this remains true for uncountable complete graphs and a notion of \\emph{generalised paths}. In 2016, Daniel Soukup answered this in the affirmative and conjectured that a similar result should hold for complete bipartite graphs with bipartition classes of the same infinite cardinality, namely that every such graph edge-coloured with $r$ colours can be partitioned into $2r-1$ monochromatic generalised paths with each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09836","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"},"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:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6O2ptNpWCF2fzeHC35iluaR/Ie+e6+a1YB5cCdPJAir0z+Kz2raKKGWIkfIn8PsrLhder5lS9eGZDWhepA3hBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:58:20.275564Z"},"content_sha256":"a2ed34ad82e8ae74135f7a500de1d58dca851c0cdab08250ad1f923570a110e1","schema_version":"1.0","event_id":"sha256:a2ed34ad82e8ae74135f7a500de1d58dca851c0cdab08250ad1f923570a110e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3YFJQGKZBAQ5D2MUUPZKZF2EW/bundle.json","state_url":"https://pith.science/pith/A3YFJQGKZBAQ5D2MUUPZKZF2EW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3YFJQGKZBAQ5D2MUUPZKZF2EW/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-06-20T20:58:20Z","links":{"resolver":"https://pith.science/pith/A3YFJQGKZBAQ5D2MUUPZKZF2EW","bundle":"https://pith.science/pith/A3YFJQGKZBAQ5D2MUUPZKZF2EW/bundle.json","state":"https://pith.science/pith/A3YFJQGKZBAQ5D2MUUPZKZF2EW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3YFJQGKZBAQ5D2MUUPZKZF2EW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A3YFJQGKZBAQ5D2MUUPZKZF2EW","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":"55e292f722d893f9c5dc529d6a4d4427ff24f1769b44666ab505122efaa9d8b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T13:59:27Z","title_canon_sha256":"0d5c9521f4eb819588d9dd9862ba528bd1de7c5c44799db2c966723521a55852"},"schema_version":"1.0","source":{"id":"1808.09836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09836","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09836v1","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09836","created_at":"2026-05-18T00:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"A3YFJQGKZBAQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A3YFJQGKZBAQ5D2M","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A3YFJQGK","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a2ed34ad82e8ae74135f7a500de1d58dca851c0cdab08250ad1f923570a110e1","target":"graph","created_at":"2026-05-18T00:06:54Z","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":"In 1978, Richard Rado showed that every edge-coloured complete graph of countably infinite order can be partitioned into monochromatic paths of different colours. He asked whether this remains true for uncountable complete graphs and a notion of \\emph{generalised paths}. In 2016, Daniel Soukup answered this in the affirmative and conjectured that a similar result should hold for complete bipartite graphs with bipartition classes of the same infinite cardinality, namely that every such graph edge-coloured with $r$ colours can be partitioned into $2r-1$ monochromatic generalised paths with each ","authors_text":"Carl B\\\"urger, Max Pitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T13:59:27Z","title":"Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09836","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:754c964549933c4ee3bf0e3663aca43db696f4ef059507c5b5572f499166ad6f","target":"record","created_at":"2026-05-18T00:06:54Z","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":"55e292f722d893f9c5dc529d6a4d4427ff24f1769b44666ab505122efaa9d8b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-29T13:59:27Z","title_canon_sha256":"0d5c9521f4eb819588d9dd9862ba528bd1de7c5c44799db2c966723521a55852"},"schema_version":"1.0","source":{"id":"1808.09836","kind":"arxiv","version":1}},"canonical_sha256":"06f054c0cac8410e8f4ca51f9564ba25ad153a912b829d7e02c5e2306a90d347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06f054c0cac8410e8f4ca51f9564ba25ad153a912b829d7e02c5e2306a90d347","first_computed_at":"2026-05-18T00:06:54.323876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:54.323876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xvQPlhLamhHMQ+FuJrHL91M2ZJsjQFqjxtkYIddSVw+LQIGRwDbEOtlzy4a/pxEC8j5hiR412NVeq4ld3LgrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:54.324548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:754c964549933c4ee3bf0e3663aca43db696f4ef059507c5b5572f499166ad6f","sha256:a2ed34ad82e8ae74135f7a500de1d58dca851c0cdab08250ad1f923570a110e1"],"state_sha256":"8061436f65e237ed3a9740695f8b6738eb1e88d56199d5968a0e660297c6fb25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QasdG7BGQ954VIdFqMkRJ+ZYaL3zg0rIex8X8qN8rFCkODxW1OYbMJI9CrUZe1GxVHvuZrbhkvDW+JsPwtBBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:58:20.277523Z","bundle_sha256":"369f717dfa26e5edf546e863c3d2dbd8af430e149044a5bf92aeaf706dcc52ef"}}