{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EMTOYUARGF4RCOHKC6EPHQWDH5","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":"6c1ae6eb33ae0f0993f5a0269ed34b5d9b3612d0e42a38812e0cabec480166f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-16T13:52:20Z","title_canon_sha256":"3f76e377e5d78d18c51a752942a64f32f771ae9d27dfb5d26fd12f652b33c0d2"},"schema_version":"1.0","source":{"id":"1601.04162","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04162","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04162v3","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04162","created_at":"2026-05-18T01:20:03Z"},{"alias_kind":"pith_short_12","alias_value":"EMTOYUARGF4R","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMTOYUARGF4RCOHK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMTOYUAR","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:b79ce015f6877af50464f8bba74ff2f591e710d1fcc490f492912b69c8216ee2","target":"graph","created_at":"2026-05-18T01:20:03Z","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 receive the same color. 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$. Recently, Li and Magnant in [Theory Appl. Graphs 0(1)(2015), Art.2] posed the following conjecture: If $G$ is a connected noncomplete graph of order $n \\geq 5$ and minimum degree $\\delta(G) \\geq n/4$, then $pc(G)=2$. In this paper, we show that t","authors_text":"Colton Magnant, Fei Huang, Xueliang Li, Zhongmei Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-16T13:52:20Z","title":"Solution to a conjecture on the proper connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04162","kind":"arxiv","version":3},"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:aac0e8bfa9e267c0098d0abaffd2821692384ff5453f115c4ce9dd9109efb5c3","target":"record","created_at":"2026-05-18T01:20:03Z","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":"6c1ae6eb33ae0f0993f5a0269ed34b5d9b3612d0e42a38812e0cabec480166f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-16T13:52:20Z","title_canon_sha256":"3f76e377e5d78d18c51a752942a64f32f771ae9d27dfb5d26fd12f652b33c0d2"},"schema_version":"1.0","source":{"id":"1601.04162","kind":"arxiv","version":3}},"canonical_sha256":"2326ec501131791138ea1788f3c2c33f66567f1cb54539794602077d743629ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2326ec501131791138ea1788f3c2c33f66567f1cb54539794602077d743629ae","first_computed_at":"2026-05-18T01:20:03.197902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:03.197902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1SUGVtONKCZIxZhU7gO8lhZ3M9wzi9dam486X1Fn22LU7uMZVijAYLYweM45km4PlirT2N+qrt765u614Lt7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:03.198538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04162","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aac0e8bfa9e267c0098d0abaffd2821692384ff5453f115c4ce9dd9109efb5c3","sha256:b79ce015f6877af50464f8bba74ff2f591e710d1fcc490f492912b69c8216ee2"],"state_sha256":"28c7ca79bb2c46869a526cd6be5e77a8146f2d25fa505b5857afdb5c87131c90"}