{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NQX3DQMHB4B5P47DNSYJLJYB7K","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":"ffdada47fcd1e7e608627e1748b9e3a4aba38c574efe611cba6493033293c7eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-04T10:28:48Z","title_canon_sha256":"ecf3707472b034e8cf95ef30bee6473480b1fa73f1d7d5587b545db5ff24ec46"},"schema_version":"1.0","source":{"id":"1805.01699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01699","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01699v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01699","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"NQX3DQMHB4B5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NQX3DQMHB4B5P47D","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NQX3DQMH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:f4373566c46d6a2b66a154fc84768d2be2c519946d8f15698a0801b3d5a5e8f9","target":"graph","created_at":"2026-05-18T00:16:47Z","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":"Let $K_{\\mathbb{N}}$ be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a $2$-colouring of the edges of $K_{\\mathbb{N}}$ in which every monochromatic path has density~$0$.\n  However, if we restrict the length of monochromatic paths in one colour, then no example as above can exist: We show that every $(r+1)$-edge-coloured complete symmetric digraph (of arbitrary infinite cardinality) containing no directed paths of edge-length $\\ell_i$ for any colour $i\\leq r$ can be covered by $\\prod_{i\\leq r} \\ell_i$ pairwise disjoint monoc","authors_text":"Carl B\\\"urger, Hannah Guggiari, Louis DeBiasio, Max Pitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-04T10:28:48Z","title":"Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01699","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:786f161fd0951bdba5d1f865d9cc4a53e16a200b102f63ebfcd02eb102f03927","target":"record","created_at":"2026-05-18T00:16:47Z","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":"ffdada47fcd1e7e608627e1748b9e3a4aba38c574efe611cba6493033293c7eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-04T10:28:48Z","title_canon_sha256":"ecf3707472b034e8cf95ef30bee6473480b1fa73f1d7d5587b545db5ff24ec46"},"schema_version":"1.0","source":{"id":"1805.01699","kind":"arxiv","version":1}},"canonical_sha256":"6c2fb1c1870f03d7f3e36cb095a701fa9225a241fc6628256c9a05cec0fea750","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c2fb1c1870f03d7f3e36cb095a701fa9225a241fc6628256c9a05cec0fea750","first_computed_at":"2026-05-18T00:16:47.020161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:47.020161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HBnswN4QqH+TT0LfmsC60Kb25uzgQO02ksrdvaIDCyFoKoQ1ZIOrXTj0jySOpccGFjEm4gi1F0OmcQ2Xyh80AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:47.020769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:786f161fd0951bdba5d1f865d9cc4a53e16a200b102f63ebfcd02eb102f03927","sha256:f4373566c46d6a2b66a154fc84768d2be2c519946d8f15698a0801b3d5a5e8f9"],"state_sha256":"5a46667a9d932187381a30126011c864f3235b9276d9b3eb70fd8e73408153b8"}