{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NQX3DQMHB4B5P47DNSYJLJYB7K","short_pith_number":"pith:NQX3DQMH","schema_version":"1.0","canonical_sha256":"6c2fb1c1870f03d7f3e36cb095a701fa9225a241fc6628256c9a05cec0fea750","source":{"kind":"arxiv","id":"1805.01699","version":1},"attestation_state":"computed","paper":{"title":"Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl B\\\"urger, Hannah Guggiari, Louis DeBiasio, Max Pitz","submitted_at":"2018-05-04T10:28:48Z","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"},"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":"1805.01699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-04T10:28:48Z","cross_cats_sorted":[],"title_canon_sha256":"ecf3707472b034e8cf95ef30bee6473480b1fa73f1d7d5587b545db5ff24ec46","abstract_canon_sha256":"ffdada47fcd1e7e608627e1748b9e3a4aba38c574efe611cba6493033293c7eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:47.020769Z","signature_b64":"HBnswN4QqH+TT0LfmsC60Kb25uzgQO02ksrdvaIDCyFoKoQ1ZIOrXTj0jySOpccGFjEm4gi1F0OmcQ2Xyh80AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c2fb1c1870f03d7f3e36cb095a701fa9225a241fc6628256c9a05cec0fea750","last_reissued_at":"2026-05-18T00:16:47.020161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:47.020161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl B\\\"urger, Hannah Guggiari, Louis DeBiasio, Max Pitz","submitted_at":"2018-05-04T10:28:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01699","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":"1805.01699","created_at":"2026-05-18T00:16:47.020254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01699v1","created_at":"2026-05-18T00:16:47.020254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01699","created_at":"2026-05-18T00:16:47.020254+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQX3DQMHB4B5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQX3DQMHB4B5P47D","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQX3DQMH","created_at":"2026-05-18T12:32:40.477152+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/NQX3DQMHB4B5P47DNSYJLJYB7K","json":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K.json","graph_json":"https://pith.science/api/pith-number/NQX3DQMHB4B5P47DNSYJLJYB7K/graph.json","events_json":"https://pith.science/api/pith-number/NQX3DQMHB4B5P47DNSYJLJYB7K/events.json","paper":"https://pith.science/paper/NQX3DQMH"},"agent_actions":{"view_html":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K","download_json":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K.json","view_paper":"https://pith.science/paper/NQX3DQMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01699&json=true","fetch_graph":"https://pith.science/api/pith-number/NQX3DQMHB4B5P47DNSYJLJYB7K/graph.json","fetch_events":"https://pith.science/api/pith-number/NQX3DQMHB4B5P47DNSYJLJYB7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K/action/storage_attestation","attest_author":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K/action/author_attestation","sign_citation":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K/action/citation_signature","submit_replication":"https://pith.science/pith/NQX3DQMHB4B5P47DNSYJLJYB7K/action/replication_record"}},"created_at":"2026-05-18T00:16:47.020254+00:00","updated_at":"2026-05-18T00:16:47.020254+00:00"}