{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GXGSBU37VUBSSYJGR4UTNBDREV","short_pith_number":"pith:GXGSBU37","canonical_record":{"source":{"id":"1505.02246","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T08:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"f256ae8f7de3b6e8977cad1dc080c16b4c5c85371fd5878804fa9c370c2088eb","abstract_canon_sha256":"233eab7a0ee220a3d8e34cdd1eac09f9006c67ec856c40edb85f4e16b3dd63b0"},"schema_version":"1.0"},"canonical_sha256":"35cd20d37fad032961268f29368471254f1b373291c13a7175c8ad9cd8691177","source":{"kind":"arxiv","id":"1505.02246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02246","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02246v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02246","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"GXGSBU37VUBS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GXGSBU37VUBSSYJG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GXGSBU37","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GXGSBU37VUBSSYJGR4UTNBDREV","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02246","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T08:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"f256ae8f7de3b6e8977cad1dc080c16b4c5c85371fd5878804fa9c370c2088eb","abstract_canon_sha256":"233eab7a0ee220a3d8e34cdd1eac09f9006c67ec856c40edb85f4e16b3dd63b0"},"schema_version":"1.0"},"canonical_sha256":"35cd20d37fad032961268f29368471254f1b373291c13a7175c8ad9cd8691177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.482550Z","signature_b64":"tzUkhNMCAm7PVohHu303HEh28Ur9QQA9rSPFqLgAmTs3ehMXZ4LFetyh8qklnoEt28GxzxEwCLTb+XYATL7/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35cd20d37fad032961268f29368471254f1b373291c13a7175c8ad9cd8691177","last_reissued_at":"2026-05-18T02:16:19.481916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.481916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02246","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pxbu06GMoEohKfkxWP1Rt0QZTXBSiycAJQ/co+QEALjyiW+SE4uDEnA9nTYLip3b2qWHBqoUM0/e/4nsH9cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:07:25.527085Z"},"content_sha256":"9e40106524cbfe80d438ff3e43b1aa6f34576d52277649dbde46ebcaa8df9168","schema_version":"1.0","event_id":"sha256:9e40106524cbfe80d438ff3e43b1aa6f34576d52277649dbde46ebcaa8df9168"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GXGSBU37VUBSSYJGR4UTNBDREV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proper connection number 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-09T08:56:39Z","abstract_excerpt":"A path $P$ in an edge-colored graph $G$ is called \\emph{a proper path} if no two adjacent edges of $P$ are colored the same, and $G$ is \\emph{proper connected} if every two vertices of $G$ are connected by a proper path in $G$. The \\emph{proper connection number} of a connected graph $G$, denoted by $pc(G)$, is the minimum number of colors that are needed to make $G$ proper connected. In this paper, we study the proper connection number on the lexicographical, strong, Cartesian, and direct product and present several upper bounds for these products of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02246","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xt0Puwk+1Q79xM5PRL7cVgk95uTsu7gQxbLPkARjFihDUGiPeKOWE2UR5CDhtZ4PH/H0LshciYgvEJbD0AaSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:07:25.527725Z"},"content_sha256":"75a1c7b892e09ef3ad1fc59ab7076c204d4eb53b09f62a40d4cefa1bd9cc9a67","schema_version":"1.0","event_id":"sha256:75a1c7b892e09ef3ad1fc59ab7076c204d4eb53b09f62a40d4cefa1bd9cc9a67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXGSBU37VUBSSYJGR4UTNBDREV/bundle.json","state_url":"https://pith.science/pith/GXGSBU37VUBSSYJGR4UTNBDREV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXGSBU37VUBSSYJGR4UTNBDREV/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-27T08:07:25Z","links":{"resolver":"https://pith.science/pith/GXGSBU37VUBSSYJGR4UTNBDREV","bundle":"https://pith.science/pith/GXGSBU37VUBSSYJGR4UTNBDREV/bundle.json","state":"https://pith.science/pith/GXGSBU37VUBSSYJGR4UTNBDREV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXGSBU37VUBSSYJGR4UTNBDREV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GXGSBU37VUBSSYJGR4UTNBDREV","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":"233eab7a0ee220a3d8e34cdd1eac09f9006c67ec856c40edb85f4e16b3dd63b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T08:56:39Z","title_canon_sha256":"f256ae8f7de3b6e8977cad1dc080c16b4c5c85371fd5878804fa9c370c2088eb"},"schema_version":"1.0","source":{"id":"1505.02246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02246","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02246v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02246","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"GXGSBU37VUBS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GXGSBU37VUBSSYJG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GXGSBU37","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:75a1c7b892e09ef3ad1fc59ab7076c204d4eb53b09f62a40d4cefa1bd9cc9a67","target":"graph","created_at":"2026-05-18T02:16:19Z","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 $P$ in an edge-colored graph $G$ is called \\emph{a proper path} if no two adjacent edges of $P$ are colored the same, and $G$ is \\emph{proper connected} if every two vertices of $G$ are connected by a proper path in $G$. The \\emph{proper connection number} of a connected graph $G$, denoted by $pc(G)$, is the minimum number of colors that are needed to make $G$ proper connected. In this paper, we study the proper connection number on the lexicographical, strong, Cartesian, and direct product and present several upper bounds for these products of graphs.","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-09T08:56:39Z","title":"Proper connection number and graph products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02246","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:9e40106524cbfe80d438ff3e43b1aa6f34576d52277649dbde46ebcaa8df9168","target":"record","created_at":"2026-05-18T02:16:19Z","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":"233eab7a0ee220a3d8e34cdd1eac09f9006c67ec856c40edb85f4e16b3dd63b0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-05-09T08:56:39Z","title_canon_sha256":"f256ae8f7de3b6e8977cad1dc080c16b4c5c85371fd5878804fa9c370c2088eb"},"schema_version":"1.0","source":{"id":"1505.02246","kind":"arxiv","version":1}},"canonical_sha256":"35cd20d37fad032961268f29368471254f1b373291c13a7175c8ad9cd8691177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35cd20d37fad032961268f29368471254f1b373291c13a7175c8ad9cd8691177","first_computed_at":"2026-05-18T02:16:19.481916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.481916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tzUkhNMCAm7PVohHu303HEh28Ur9QQA9rSPFqLgAmTs3ehMXZ4LFetyh8qklnoEt28GxzxEwCLTb+XYATL7/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.482550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e40106524cbfe80d438ff3e43b1aa6f34576d52277649dbde46ebcaa8df9168","sha256:75a1c7b892e09ef3ad1fc59ab7076c204d4eb53b09f62a40d4cefa1bd9cc9a67"],"state_sha256":"b67d07396515dc69a2bfb7d4115368ee5e222303b14339f8fbdb8313220f56cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5eTBGKG5Agj+gTuJ7Hh1m+X32kfOVB6YxzEisrVQbR3evYVDCALpiblIRaAFOoRbMyfvkZ2DwUgZNR3GV2rBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:07:25.531573Z","bundle_sha256":"fa9482c12faa1ad707e787822c3d48897cd99c68ada8b1376664053713d55ae0"}}