{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W5LS6XZZ62Q7YPWAMCOSW5ZHAT","short_pith_number":"pith:W5LS6XZZ","canonical_record":{"source":{"id":"1505.01424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-06T16:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"759281cdd0662a0dfaa04c63192eed944a0991ed59c534a0cd47244148103cb3","abstract_canon_sha256":"f28055bb51643c39e567955d9bc04851dfae6700fb6b2c920bec068e1c872eff"},"schema_version":"1.0"},"canonical_sha256":"b7572f5f39f6a1fc3ec0609d2b772704f4415e1d06d70a368865ec25a254c2c0","source":{"kind":"arxiv","id":"1505.01424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01424","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01424v1","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01424","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"W5LS6XZZ62Q7","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5LS6XZZ62Q7YPWA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5LS6XZZ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W5LS6XZZ62Q7YPWAMCOSW5ZHAT","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-06T16:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"759281cdd0662a0dfaa04c63192eed944a0991ed59c534a0cd47244148103cb3","abstract_canon_sha256":"f28055bb51643c39e567955d9bc04851dfae6700fb6b2c920bec068e1c872eff"},"schema_version":"1.0"},"canonical_sha256":"b7572f5f39f6a1fc3ec0609d2b772704f4415e1d06d70a368865ec25a254c2c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:49.391676Z","signature_b64":"yZ3X3yPJUcojssVTg6yCZiUD59v63nFRtWftwrU02AMSCZTYKasPa+ipL11ZwGR+aQVtxeiRHm2QQA0ip7LmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7572f5f39f6a1fc3ec0609d2b772704f4415e1d06d70a368865ec25a254c2c0","last_reissued_at":"2026-05-18T02:16:49.391078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:49.391078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01424","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-18T02:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIX6jPZL50J985LBscqzq5q0IB8n09pg4gqjBELgbsjNXsrAc96z9Hi9pg3rGqHIh8lnCYFJpWdjkdvXQnZ8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:10:55.940671Z"},"content_sha256":"1c34833cebd761dd07c1bd1ab925d2e5fdf0c2766d6a67d6e076f81377f4343e","schema_version":"1.0","event_id":"sha256:1c34833cebd761dd07c1bd1ab925d2e5fdf0c2766d6a67d6e076f81377f4343e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W5LS6XZZ62Q7YPWAMCOSW5ZHAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monochromatic connectivity and graph products","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengfu Ye, Fengnan Yanling, Yaping Mao, Zhao Wang","submitted_at":"2015-05-06T16:37:43Z","abstract_excerpt":"The concept of monochromatic connectivity was introduced by Caro and Yuster. A path in an edge-colored graph is called a \\emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of $G$ is a \\emph{monochromatic connection coloring} ($MC$-coloring, for short) if there is a monochromatic path joining any two vertices in $G$. The \\emph{monochromatic connection number}, denoted by $mc(G)$, is defined to be the maximum number of colors used in an $MC$-coloring of a graph $G$. In this paper, we study the monochromatic connection number on the lexicographical, stro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01424","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-18T02:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BCKLzK+3z6AMOx+Ok7U0fbJfWo40IQ/Vt0golzDejVy+O7f+VscDQQHxGwLORS74YQNcFgfF5Hh9l+CiK8NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:10:55.941272Z"},"content_sha256":"7fbeba2440386ed99d0383d6a3b9815e963ef48b60a3d8b0c8bf641bbbafe009","schema_version":"1.0","event_id":"sha256:7fbeba2440386ed99d0383d6a3b9815e963ef48b60a3d8b0c8bf641bbbafe009"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5LS6XZZ62Q7YPWAMCOSW5ZHAT/bundle.json","state_url":"https://pith.science/pith/W5LS6XZZ62Q7YPWAMCOSW5ZHAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5LS6XZZ62Q7YPWAMCOSW5ZHAT/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-05-27T02:10:55Z","links":{"resolver":"https://pith.science/pith/W5LS6XZZ62Q7YPWAMCOSW5ZHAT","bundle":"https://pith.science/pith/W5LS6XZZ62Q7YPWAMCOSW5ZHAT/bundle.json","state":"https://pith.science/pith/W5LS6XZZ62Q7YPWAMCOSW5ZHAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5LS6XZZ62Q7YPWAMCOSW5ZHAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W5LS6XZZ62Q7YPWAMCOSW5ZHAT","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":"f28055bb51643c39e567955d9bc04851dfae6700fb6b2c920bec068e1c872eff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-06T16:37:43Z","title_canon_sha256":"759281cdd0662a0dfaa04c63192eed944a0991ed59c534a0cd47244148103cb3"},"schema_version":"1.0","source":{"id":"1505.01424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01424","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01424v1","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01424","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"W5LS6XZZ62Q7","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W5LS6XZZ62Q7YPWA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W5LS6XZZ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:7fbeba2440386ed99d0383d6a3b9815e963ef48b60a3d8b0c8bf641bbbafe009","target":"graph","created_at":"2026-05-18T02:16:49Z","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":"The concept of monochromatic connectivity was introduced by Caro and Yuster. A path in an edge-colored graph is called a \\emph{monochromatic path} if all the edges on the path are colored the same. An edge-coloring of $G$ is a \\emph{monochromatic connection coloring} ($MC$-coloring, for short) if there is a monochromatic path joining any two vertices in $G$. The \\emph{monochromatic connection number}, denoted by $mc(G)$, is defined to be the maximum number of colors used in an $MC$-coloring of a graph $G$. In this paper, we study the monochromatic connection number on the lexicographical, stro","authors_text":"Chengfu Ye, Fengnan Yanling, Yaping Mao, Zhao Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-06T16:37:43Z","title":"Monochromatic connectivity and graph products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01424","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:1c34833cebd761dd07c1bd1ab925d2e5fdf0c2766d6a67d6e076f81377f4343e","target":"record","created_at":"2026-05-18T02:16:49Z","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":"f28055bb51643c39e567955d9bc04851dfae6700fb6b2c920bec068e1c872eff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-06T16:37:43Z","title_canon_sha256":"759281cdd0662a0dfaa04c63192eed944a0991ed59c534a0cd47244148103cb3"},"schema_version":"1.0","source":{"id":"1505.01424","kind":"arxiv","version":1}},"canonical_sha256":"b7572f5f39f6a1fc3ec0609d2b772704f4415e1d06d70a368865ec25a254c2c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7572f5f39f6a1fc3ec0609d2b772704f4415e1d06d70a368865ec25a254c2c0","first_computed_at":"2026-05-18T02:16:49.391078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:49.391078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yZ3X3yPJUcojssVTg6yCZiUD59v63nFRtWftwrU02AMSCZTYKasPa+ipL11ZwGR+aQVtxeiRHm2QQA0ip7LmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:49.391676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c34833cebd761dd07c1bd1ab925d2e5fdf0c2766d6a67d6e076f81377f4343e","sha256:7fbeba2440386ed99d0383d6a3b9815e963ef48b60a3d8b0c8bf641bbbafe009"],"state_sha256":"f9e9014d9d3e7a4bb4b6921de182c8f20636d47fbeafb9c9cb6666e07bde3b94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXeVuuFoHgntYASNnm1l7SMijfugUO+t+o+bXjTUAYR7RnXgJuwGUAKTzIw+C3UqhnAbYygCoIj/0NlWYbbEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:10:55.944386Z","bundle_sha256":"cdf2542564625416b6cfd9c6c3d073e2d1ef615352d5424cf32655f5453390f1"}}