{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FBY3DG4SF7WN4CW665HBWUAN37","short_pith_number":"pith:FBY3DG4S","canonical_record":{"source":{"id":"1504.02414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T18:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"04367a76955f5acb63a4ec1f52349114b50687c86e7e7d61022ed502a05d8574","abstract_canon_sha256":"fedc789dc7d4fa4c949349842820236a14ba29db74fc4762d0e2b24ea56e3f60"},"schema_version":"1.0"},"canonical_sha256":"2871b19b922fecde0adef74e1b500ddffb6f5cd73f0315546b74422d073df499","source":{"kind":"arxiv","id":"1504.02414","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02414","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02414v2","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02414","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"pith_short_12","alias_value":"FBY3DG4SF7WN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FBY3DG4SF7WN4CW6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FBY3DG4S","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FBY3DG4SF7WN4CW665HBWUAN37","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T18:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"04367a76955f5acb63a4ec1f52349114b50687c86e7e7d61022ed502a05d8574","abstract_canon_sha256":"fedc789dc7d4fa4c949349842820236a14ba29db74fc4762d0e2b24ea56e3f60"},"schema_version":"1.0"},"canonical_sha256":"2871b19b922fecde0adef74e1b500ddffb6f5cd73f0315546b74422d073df499","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:32.921117Z","signature_b64":"BWToPh3VhKtmDWdBrtC57+kTTVAGxmAs5jKvag/gxYq/bVdjItj3lQH8i/I3HqFu2i/OSeTfr9a6wO03izWwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2871b19b922fecde0adef74e1b500ddffb6f5cd73f0315546b74422d073df499","last_reissued_at":"2026-05-18T02:17:32.920408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:32.920408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02414","source_version":2,"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:17:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76g/evsB0DPb7OphzWRgPA/sRHbGzgiFgZTWppIpARbdAk+mNy+1GnNXBZw+cyvKvduiIUY6Tr0E5vU6f6iZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:46:35.528085Z"},"content_sha256":"723aebc1f01d458f41ce4938a020cb6510c20a45ef6bb26a445c00a0ebaf8fb4","schema_version":"1.0","event_id":"sha256:723aebc1f01d458f41ce4938a020cb6510c20a45ef6bb26a445c00a0ebaf8fb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FBY3DG4SF7WN4CW665HBWUAN37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proper connection numbers of complementary graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei Huang, Shujing Wang, Xueliang Li","submitted_at":"2015-04-09T18:26:32Z","abstract_excerpt":"A path $P$ in an edge-colored graph $G$ is called a proper path if no two adjacent edges of $P$ are colored the same, and $G$ is proper connected if every two vertices of $G$ are connected by a proper path in $G$. The 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 investigate the proper connection number of the complement of graph $G$ according to some constraints of $G$ itself. Also, we characterize the graphs on $n$ vertices that have proper connection number $n-2$. Using t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02414","kind":"arxiv","version":2},"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:17:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P944PKmML1Qszl9Bdn1RgXaD8Eq6NV7GbSMZal7DBJQoLwDQn+PFNlcsb8/hHq5mXa9AL/gC+zGxB/l+sayuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:46:35.528801Z"},"content_sha256":"d9e4dfb30d6cfd624d42b6b793cec4d07ea159534087ca7fa2ec6e5c5f4c7189","schema_version":"1.0","event_id":"sha256:d9e4dfb30d6cfd624d42b6b793cec4d07ea159534087ca7fa2ec6e5c5f4c7189"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBY3DG4SF7WN4CW665HBWUAN37/bundle.json","state_url":"https://pith.science/pith/FBY3DG4SF7WN4CW665HBWUAN37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBY3DG4SF7WN4CW665HBWUAN37/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-25T15:46:35Z","links":{"resolver":"https://pith.science/pith/FBY3DG4SF7WN4CW665HBWUAN37","bundle":"https://pith.science/pith/FBY3DG4SF7WN4CW665HBWUAN37/bundle.json","state":"https://pith.science/pith/FBY3DG4SF7WN4CW665HBWUAN37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBY3DG4SF7WN4CW665HBWUAN37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FBY3DG4SF7WN4CW665HBWUAN37","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":"fedc789dc7d4fa4c949349842820236a14ba29db74fc4762d0e2b24ea56e3f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T18:26:32Z","title_canon_sha256":"04367a76955f5acb63a4ec1f52349114b50687c86e7e7d61022ed502a05d8574"},"schema_version":"1.0","source":{"id":"1504.02414","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02414","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02414v2","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02414","created_at":"2026-05-18T02:17:32Z"},{"alias_kind":"pith_short_12","alias_value":"FBY3DG4SF7WN","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FBY3DG4SF7WN4CW6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FBY3DG4S","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:d9e4dfb30d6cfd624d42b6b793cec4d07ea159534087ca7fa2ec6e5c5f4c7189","target":"graph","created_at":"2026-05-18T02:17:32Z","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 a proper path if no two adjacent edges of $P$ are colored the same, and $G$ is proper connected if every two vertices of $G$ are connected by a proper path in $G$. The 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 investigate the proper connection number of the complement of graph $G$ according to some constraints of $G$ itself. Also, we characterize the graphs on $n$ vertices that have proper connection number $n-2$. Using t","authors_text":"Fei Huang, Shujing Wang, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T18:26:32Z","title":"Proper connection numbers of complementary graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02414","kind":"arxiv","version":2},"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:723aebc1f01d458f41ce4938a020cb6510c20a45ef6bb26a445c00a0ebaf8fb4","target":"record","created_at":"2026-05-18T02:17:32Z","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":"fedc789dc7d4fa4c949349842820236a14ba29db74fc4762d0e2b24ea56e3f60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T18:26:32Z","title_canon_sha256":"04367a76955f5acb63a4ec1f52349114b50687c86e7e7d61022ed502a05d8574"},"schema_version":"1.0","source":{"id":"1504.02414","kind":"arxiv","version":2}},"canonical_sha256":"2871b19b922fecde0adef74e1b500ddffb6f5cd73f0315546b74422d073df499","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2871b19b922fecde0adef74e1b500ddffb6f5cd73f0315546b74422d073df499","first_computed_at":"2026-05-18T02:17:32.920408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:32.920408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BWToPh3VhKtmDWdBrtC57+kTTVAGxmAs5jKvag/gxYq/bVdjItj3lQH8i/I3HqFu2i/OSeTfr9a6wO03izWwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:32.921117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02414","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:723aebc1f01d458f41ce4938a020cb6510c20a45ef6bb26a445c00a0ebaf8fb4","sha256:d9e4dfb30d6cfd624d42b6b793cec4d07ea159534087ca7fa2ec6e5c5f4c7189"],"state_sha256":"ed61b960686754a0394c2b0740c283ba303023a7802131a1470b82c956a34696"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xP57mO+TUZ/Gh8zoEVLOZWEgYFeFc1PsqQvx0Wn5iAd1uKRCt3DVDdSyxF/0Se/hGp9xXcLDdkjxjCQENwjCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:46:35.532558Z","bundle_sha256":"84306d092dd9db7fc7d7b9483de9933b942d7eca3b383ffede8a59b90dc4e26c"}}