{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HWZ3XIAJUF2AGLZMJFOTP4Q7F5","short_pith_number":"pith:HWZ3XIAJ","canonical_record":{"source":{"id":"1505.04646","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-18T14:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"db3cc8dc8886d019c2fc26fe87966c4d0c37d44c03e1944f1109ba28274c16c4","abstract_canon_sha256":"640ccb987b0b8b9f081f6b9c22283fe366baea2cf8b69c117a0f0716002a1846"},"schema_version":"1.0"},"canonical_sha256":"3db3bba009a174032f2c495d37f21f2f50d3c8acf20d11323dd4c9f2f3c01312","source":{"kind":"arxiv","id":"1505.04646","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04646","created_at":"2026-05-18T01:40:58Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04646v4","created_at":"2026-05-18T01:40:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04646","created_at":"2026-05-18T01:40:58Z"},{"alias_kind":"pith_short_12","alias_value":"HWZ3XIAJUF2A","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWZ3XIAJUF2AGLZM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWZ3XIAJ","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HWZ3XIAJUF2AGLZMJFOTP4Q7F5","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04646","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-18T14:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"db3cc8dc8886d019c2fc26fe87966c4d0c37d44c03e1944f1109ba28274c16c4","abstract_canon_sha256":"640ccb987b0b8b9f081f6b9c22283fe366baea2cf8b69c117a0f0716002a1846"},"schema_version":"1.0"},"canonical_sha256":"3db3bba009a174032f2c495d37f21f2f50d3c8acf20d11323dd4c9f2f3c01312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:58.114951Z","signature_b64":"zgRhvgzjEGFwG/PzTrjwPj/mv/tNP9zzWPtJ6FPrdFZrV2jwW/jfDIPNOMA2cfl9C4CUqUMa1YrgfyEyR75CAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db3bba009a174032f2c495d37f21f2f50d3c8acf20d11323dd4c9f2f3c01312","last_reissued_at":"2026-05-18T01:40:58.114223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:58.114223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04646","source_version":4,"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-18T01:40:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FErakomACFj4CgDbcVKAyH7eWFWJQ+MHwEEweO+A0ySj2RHFMqih457MZEuCOJMf1mkVvmDBUvmIGlhlPqCqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:10:25.418421Z"},"content_sha256":"89904bdfec855fb6333274ec1d72b7a9b8d44015135768f588eb02d0463d16ef","schema_version":"1.0","event_id":"sha256:89904bdfec855fb6333274ec1d72b7a9b8d44015135768f588eb02d0463d16ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HWZ3XIAJUF2AGLZMJFOTP4Q7F5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proper connection number of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Zhongmei Qin","submitted_at":"2015-05-18T14:07:31Z","abstract_excerpt":"A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored the same. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one proper path in $G$. In this paper, we show that almost all graphs have the proper connection number 2. More precisely, let $G(n,p)$ denote the Erd\\\"{o}s-R\\'{e}nyi random graph model, in which each of the $\\binom{n}{2}$ pairs of vertices appears as an edge with probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04646","kind":"arxiv","version":4},"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-18T01:40:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Tn083FII3uAFHeP2CyJOSHhlOn0daRRl7i8rOf8rALWMfgN8U6y901WPY+kYDrC1x76gdQ4IMP7HG+BkQ1ZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:10:25.418955Z"},"content_sha256":"55818770fbabc8163f026f80472a1c20b93e41c41393e07385ee0994191974e6","schema_version":"1.0","event_id":"sha256:55818770fbabc8163f026f80472a1c20b93e41c41393e07385ee0994191974e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWZ3XIAJUF2AGLZMJFOTP4Q7F5/bundle.json","state_url":"https://pith.science/pith/HWZ3XIAJUF2AGLZMJFOTP4Q7F5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWZ3XIAJUF2AGLZMJFOTP4Q7F5/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-04T03:10:25Z","links":{"resolver":"https://pith.science/pith/HWZ3XIAJUF2AGLZMJFOTP4Q7F5","bundle":"https://pith.science/pith/HWZ3XIAJUF2AGLZMJFOTP4Q7F5/bundle.json","state":"https://pith.science/pith/HWZ3XIAJUF2AGLZMJFOTP4Q7F5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWZ3XIAJUF2AGLZMJFOTP4Q7F5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HWZ3XIAJUF2AGLZMJFOTP4Q7F5","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":"640ccb987b0b8b9f081f6b9c22283fe366baea2cf8b69c117a0f0716002a1846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-18T14:07:31Z","title_canon_sha256":"db3cc8dc8886d019c2fc26fe87966c4d0c37d44c03e1944f1109ba28274c16c4"},"schema_version":"1.0","source":{"id":"1505.04646","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04646","created_at":"2026-05-18T01:40:58Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04646v4","created_at":"2026-05-18T01:40:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04646","created_at":"2026-05-18T01:40:58Z"},{"alias_kind":"pith_short_12","alias_value":"HWZ3XIAJUF2A","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWZ3XIAJUF2AGLZM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWZ3XIAJ","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:55818770fbabc8163f026f80472a1c20b93e41c41393e07385ee0994191974e6","target":"graph","created_at":"2026-05-18T01:40:58Z","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 is called a proper path if no two adjacent edges of the path are colored the same. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one proper path in $G$. In this paper, we show that almost all graphs have the proper connection number 2. More precisely, let $G(n,p)$ denote the Erd\\\"{o}s-R\\'{e}nyi random graph model, in which each of the $\\binom{n}{2}$ pairs of vertices appears as an edge with probabi","authors_text":"Ran Gu, Xueliang Li, Zhongmei Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-18T14:07:31Z","title":"Proper connection number of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04646","kind":"arxiv","version":4},"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:89904bdfec855fb6333274ec1d72b7a9b8d44015135768f588eb02d0463d16ef","target":"record","created_at":"2026-05-18T01:40:58Z","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":"640ccb987b0b8b9f081f6b9c22283fe366baea2cf8b69c117a0f0716002a1846","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-18T14:07:31Z","title_canon_sha256":"db3cc8dc8886d019c2fc26fe87966c4d0c37d44c03e1944f1109ba28274c16c4"},"schema_version":"1.0","source":{"id":"1505.04646","kind":"arxiv","version":4}},"canonical_sha256":"3db3bba009a174032f2c495d37f21f2f50d3c8acf20d11323dd4c9f2f3c01312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3db3bba009a174032f2c495d37f21f2f50d3c8acf20d11323dd4c9f2f3c01312","first_computed_at":"2026-05-18T01:40:58.114223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:58.114223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zgRhvgzjEGFwG/PzTrjwPj/mv/tNP9zzWPtJ6FPrdFZrV2jwW/jfDIPNOMA2cfl9C4CUqUMa1YrgfyEyR75CAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:58.114951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04646","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89904bdfec855fb6333274ec1d72b7a9b8d44015135768f588eb02d0463d16ef","sha256:55818770fbabc8163f026f80472a1c20b93e41c41393e07385ee0994191974e6"],"state_sha256":"8dd686b408938cc4e0e683e48e5e98edc16828b345e82869e4a861c646a29d8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+N5ZBv3nu3uWY7mw4U5eBClTUuC0ybxdxo/zsEW2g1x06zzLfpmC7/dq4ITf+hIdxfMGsXxnuEOTEmPgu9ayAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:10:25.422126Z","bundle_sha256":"c61fa5aeb7b8d4e983da845b2eee823bcc2d3e3287deee69e1c80ea1b416c50b"}}