{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5C4FZSVWU5XPEPUZ43FSQZRQAM","short_pith_number":"pith:5C4FZSVW","canonical_record":{"source":{"id":"1810.11820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T14:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"7da3afc1eabc9c7a9047bd7bdbf92dcc5c1e896b1f7cae9277aa40ff462086ad","abstract_canon_sha256":"f7585d3b5e72f5e5be228eef074dffa54f6cf5599a1616717ebff573d71125f0"},"schema_version":"1.0"},"canonical_sha256":"e8b85ccab6a76ef23e99e6cb286630031ae40473a8dcb1b1742967ec7dee83ae","source":{"kind":"arxiv","id":"1810.11820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11820","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11820v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11820","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"5C4FZSVWU5XP","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5C4FZSVWU5XPEPUZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5C4FZSVW","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5C4FZSVWU5XPEPUZ43FSQZRQAM","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T14:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"7da3afc1eabc9c7a9047bd7bdbf92dcc5c1e896b1f7cae9277aa40ff462086ad","abstract_canon_sha256":"f7585d3b5e72f5e5be228eef074dffa54f6cf5599a1616717ebff573d71125f0"},"schema_version":"1.0"},"canonical_sha256":"e8b85ccab6a76ef23e99e6cb286630031ae40473a8dcb1b1742967ec7dee83ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:07.310658Z","signature_b64":"cXQlfwCpoLKaPQ5d6y2ocEw04nhoGkVkEBb6J80wqtQhN4BL3+yp1WoaageYSxLamuYA5TAAu8DeYA6klkEjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8b85ccab6a76ef23e99e6cb286630031ae40473a8dcb1b1742967ec7dee83ae","last_reissued_at":"2026-05-18T00:02:07.309930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:07.309930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11820","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:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5HrKmadDQ0az4HXdAZU353uncTEtxwNbiV6jnIYeSR2eBrK5fdt8Tiw6ukN2MG5n57uGMdZyLQGBCYYTYkOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:21:15.107388Z"},"content_sha256":"7b086e85f940ecac13e05ba5a054b15840352f1aa0b5a93838676c95a59b5287","schema_version":"1.0","event_id":"sha256:7b086e85f940ecac13e05ba5a054b15840352f1aa0b5a93838676c95a59b5287"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5C4FZSVWU5XPEPUZ43FSQZRQAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monochromatic $k$-edge-connection colorings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ping Li, Xueliang Li","submitted_at":"2018-10-28T14:58:59Z","abstract_excerpt":"A path in an edge-colored graph $G$ is called monochromatic if any two edges on the path have the same color. For $k\\geq 2$, an edge-colored graph $G$ is said to be monochromatic $k$-edge-connected if every two distinct vertices of $G$ are connected by at least $k$ edge-disjoint monochromatic paths, and $G$ is said to be uniformly monochromatic $k$-edge-connected if every two distinct vertices are connected by at least $k$ edge-disjoint monochromatic paths such that all edges of these $k$ paths colored with a same color. We use $mc_k(G)$ and $umc_k(G)$ to denote the maximum number of colors th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11820","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:02:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUHazBABhU8qlJChI7OaavELsnRYSFcpE82wEjZBsTKwbNRjRyo2e8DFd9qFGMf1XjwgKUDiI97UeSfMzCGCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:21:15.107740Z"},"content_sha256":"c22e540c0acf070bc6d287fe9d0833c26c39a7d7b358a6fb40c3b1d14e221d62","schema_version":"1.0","event_id":"sha256:c22e540c0acf070bc6d287fe9d0833c26c39a7d7b358a6fb40c3b1d14e221d62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5C4FZSVWU5XPEPUZ43FSQZRQAM/bundle.json","state_url":"https://pith.science/pith/5C4FZSVWU5XPEPUZ43FSQZRQAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5C4FZSVWU5XPEPUZ43FSQZRQAM/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-02T01:21:15Z","links":{"resolver":"https://pith.science/pith/5C4FZSVWU5XPEPUZ43FSQZRQAM","bundle":"https://pith.science/pith/5C4FZSVWU5XPEPUZ43FSQZRQAM/bundle.json","state":"https://pith.science/pith/5C4FZSVWU5XPEPUZ43FSQZRQAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5C4FZSVWU5XPEPUZ43FSQZRQAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5C4FZSVWU5XPEPUZ43FSQZRQAM","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":"f7585d3b5e72f5e5be228eef074dffa54f6cf5599a1616717ebff573d71125f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T14:58:59Z","title_canon_sha256":"7da3afc1eabc9c7a9047bd7bdbf92dcc5c1e896b1f7cae9277aa40ff462086ad"},"schema_version":"1.0","source":{"id":"1810.11820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11820","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11820v1","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11820","created_at":"2026-05-18T00:02:07Z"},{"alias_kind":"pith_short_12","alias_value":"5C4FZSVWU5XP","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5C4FZSVWU5XPEPUZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5C4FZSVW","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:c22e540c0acf070bc6d287fe9d0833c26c39a7d7b358a6fb40c3b1d14e221d62","target":"graph","created_at":"2026-05-18T00:02:07Z","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":"A path in an edge-colored graph $G$ is called monochromatic if any two edges on the path have the same color. For $k\\geq 2$, an edge-colored graph $G$ is said to be monochromatic $k$-edge-connected if every two distinct vertices of $G$ are connected by at least $k$ edge-disjoint monochromatic paths, and $G$ is said to be uniformly monochromatic $k$-edge-connected if every two distinct vertices are connected by at least $k$ edge-disjoint monochromatic paths such that all edges of these $k$ paths colored with a same color. We use $mc_k(G)$ and $umc_k(G)$ to denote the maximum number of colors th","authors_text":"Ping Li, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T14:58:59Z","title":"Monochromatic $k$-edge-connection colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11820","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:7b086e85f940ecac13e05ba5a054b15840352f1aa0b5a93838676c95a59b5287","target":"record","created_at":"2026-05-18T00:02:07Z","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":"f7585d3b5e72f5e5be228eef074dffa54f6cf5599a1616717ebff573d71125f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-28T14:58:59Z","title_canon_sha256":"7da3afc1eabc9c7a9047bd7bdbf92dcc5c1e896b1f7cae9277aa40ff462086ad"},"schema_version":"1.0","source":{"id":"1810.11820","kind":"arxiv","version":1}},"canonical_sha256":"e8b85ccab6a76ef23e99e6cb286630031ae40473a8dcb1b1742967ec7dee83ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8b85ccab6a76ef23e99e6cb286630031ae40473a8dcb1b1742967ec7dee83ae","first_computed_at":"2026-05-18T00:02:07.309930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:07.309930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cXQlfwCpoLKaPQ5d6y2ocEw04nhoGkVkEBb6J80wqtQhN4BL3+yp1WoaageYSxLamuYA5TAAu8DeYA6klkEjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:07.310658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b086e85f940ecac13e05ba5a054b15840352f1aa0b5a93838676c95a59b5287","sha256:c22e540c0acf070bc6d287fe9d0833c26c39a7d7b358a6fb40c3b1d14e221d62"],"state_sha256":"2458277db3788b09f96ddbfe44bf46efbb6f1cfc1f95b8ec52db6ebdccf50a24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wDLk+BbBVAA1dTt46lpKxhLCuEoQMX4ualNUprrMOnNqnNeUeYjrOPHIoA35KEiCdAiS4o2cApNgH+0sw+mCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:21:15.110302Z","bundle_sha256":"414f6c65891aff3ec270fe7324f49e068ea720f9bcc524bd33099f4d195863a5"}}