{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XUAIWLUAI5LFFZX7JWHZYL5S2L","short_pith_number":"pith:XUAIWLUA","canonical_record":{"source":{"id":"1806.09452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T12:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"78696285a86f1ba154ddfbde794ca2a41a66993c1e78f879333b5d6b81a4d419","abstract_canon_sha256":"fab2455c62595d62e567fe95f28d583747e8e683085602f2ae90eeeae0bb6c03"},"schema_version":"1.0"},"canonical_sha256":"bd008b2e80475652e6ff4d8f9c2fb2d2ff8bae199905e0860143c7ee2bb7667a","source":{"kind":"arxiv","id":"1806.09452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09452","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09452v1","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09452","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"XUAIWLUAI5LF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XUAIWLUAI5LFFZX7","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XUAIWLUA","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XUAIWLUAI5LFFZX7JWHZYL5S2L","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T12:57:47Z","cross_cats_sorted":[],"title_canon_sha256":"78696285a86f1ba154ddfbde794ca2a41a66993c1e78f879333b5d6b81a4d419","abstract_canon_sha256":"fab2455c62595d62e567fe95f28d583747e8e683085602f2ae90eeeae0bb6c03"},"schema_version":"1.0"},"canonical_sha256":"bd008b2e80475652e6ff4d8f9c2fb2d2ff8bae199905e0860143c7ee2bb7667a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:27.239749Z","signature_b64":"uGneDTK04K4u4wgbNfWqq0nkrGXz9QoR+PjEBY/KeBjcRUsP7OXX+ah0+X8Zip+tAiqSrcsaIs1YS8nmnuOUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd008b2e80475652e6ff4d8f9c2fb2d2ff8bae199905e0860143c7ee2bb7667a","last_reissued_at":"2026-05-18T00:12:27.239079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:27.239079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09452","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:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50MATmtojkSe6Pw8jUmAEBrwDrTI9EmSCxydp+4BUwZDVgMxm8Ns6tcN0asDfs54nPNRou47mXESFHyxW5SEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:00:40.550346Z"},"content_sha256":"c7215622c76a3eb5495dcac04ff664f9044c4daac8e9d242355b7418342a2242","schema_version":"1.0","event_id":"sha256:c7215622c76a3eb5495dcac04ff664f9044c4daac8e9d242355b7418342a2242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XUAIWLUAI5LFFZX7JWHZYL5S2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum degree and size conditions for the proper connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eddie Cheng, Lina Xue, Weihua Yang, Xiaxia Guan","submitted_at":"2018-06-21T12:57:47Z","abstract_excerpt":"An edge-coloured graph $G$ is called $properly$ $connected$ if every two vertices are connected by a proper path. The $proper$ $connection$ $number$ of a connected graph $G$, denoted by $pc(G)$, is the smallest number of colours that are needed in order to make $G$ properly connected. Susan A. van Aardt et al. gave a sufficient condition for the proper connection number to be at most $k$ in terms of the size of graphs. In this note, %optimizes the boundary of the number of edges %we study the $proper$ $connection$ $number$ is under the conditions of adding the minimum degree and optimizing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09452","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:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+8BgbxAR1wgKZ0Ja68NY+hWXx9aVyZN+VxeBTMrrFvHDkKt8mJBSagNCnPuETCBSAa8ABLC2VflVBVRxzFDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T15:00:40.550703Z"},"content_sha256":"454c754e3ed94e9d89d43c08c9ef053388277169c25d36060469f988d26157f4","schema_version":"1.0","event_id":"sha256:454c754e3ed94e9d89d43c08c9ef053388277169c25d36060469f988d26157f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/bundle.json","state_url":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/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-07-03T15:00:40Z","links":{"resolver":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L","bundle":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/bundle.json","state":"https://pith.science/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUAIWLUAI5LFFZX7JWHZYL5S2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XUAIWLUAI5LFFZX7JWHZYL5S2L","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":"fab2455c62595d62e567fe95f28d583747e8e683085602f2ae90eeeae0bb6c03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T12:57:47Z","title_canon_sha256":"78696285a86f1ba154ddfbde794ca2a41a66993c1e78f879333b5d6b81a4d419"},"schema_version":"1.0","source":{"id":"1806.09452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09452","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09452v1","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09452","created_at":"2026-05-18T00:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"XUAIWLUAI5LF","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XUAIWLUAI5LFFZX7","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XUAIWLUA","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:454c754e3ed94e9d89d43c08c9ef053388277169c25d36060469f988d26157f4","target":"graph","created_at":"2026-05-18T00:12:27Z","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":"An edge-coloured graph $G$ is called $properly$ $connected$ if every two vertices are connected by a proper path. The $proper$ $connection$ $number$ of a connected graph $G$, denoted by $pc(G)$, is the smallest number of colours that are needed in order to make $G$ properly connected. Susan A. van Aardt et al. gave a sufficient condition for the proper connection number to be at most $k$ in terms of the size of graphs. In this note, %optimizes the boundary of the number of edges %we study the $proper$ $connection$ $number$ is under the conditions of adding the minimum degree and optimizing the","authors_text":"Eddie Cheng, Lina Xue, Weihua Yang, Xiaxia Guan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T12:57:47Z","title":"Minimum degree and size conditions for the proper connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09452","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:c7215622c76a3eb5495dcac04ff664f9044c4daac8e9d242355b7418342a2242","target":"record","created_at":"2026-05-18T00:12:27Z","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":"fab2455c62595d62e567fe95f28d583747e8e683085602f2ae90eeeae0bb6c03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-21T12:57:47Z","title_canon_sha256":"78696285a86f1ba154ddfbde794ca2a41a66993c1e78f879333b5d6b81a4d419"},"schema_version":"1.0","source":{"id":"1806.09452","kind":"arxiv","version":1}},"canonical_sha256":"bd008b2e80475652e6ff4d8f9c2fb2d2ff8bae199905e0860143c7ee2bb7667a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd008b2e80475652e6ff4d8f9c2fb2d2ff8bae199905e0860143c7ee2bb7667a","first_computed_at":"2026-05-18T00:12:27.239079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:27.239079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uGneDTK04K4u4wgbNfWqq0nkrGXz9QoR+PjEBY/KeBjcRUsP7OXX+ah0+X8Zip+tAiqSrcsaIs1YS8nmnuOUBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:27.239749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7215622c76a3eb5495dcac04ff664f9044c4daac8e9d242355b7418342a2242","sha256:454c754e3ed94e9d89d43c08c9ef053388277169c25d36060469f988d26157f4"],"state_sha256":"366ac851c7bdf0efc6314018cab07d05019dc5ee3fe21be9540b458c6fc894af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2NrFTmccDSS99u5unncvtcGrz5zcLplDpkQ+HdXCTGjxoRf689SUe8u2CrvvfYv6o9KpRfkfz+SDWpOYeZJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T15:00:40.552968Z","bundle_sha256":"e42f8b392a129e44b4b63c6ae300742ca98921dce0ac45c440cae84274131a9d"}}