{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JBTCN3J2RTS5W6QH64GSOWPEFD","short_pith_number":"pith:JBTCN3J2","canonical_record":{"source":{"id":"1705.02487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:19:27Z","cross_cats_sorted":[],"title_canon_sha256":"b82df414abb3d01da3d2bd78fcd5f705556df0d5cc4a4d3ab49c00f546808459","abstract_canon_sha256":"6847c1f7c1547e9cb0c12dc4dfd5715f2f637091f1b143271b313e287c317646"},"schema_version":"1.0"},"canonical_sha256":"486626ed3a8ce5db7a07f70d2759e428c272217352d261f8afca80eddfe0d91b","source":{"kind":"arxiv","id":"1705.02487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02487","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02487v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02487","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"JBTCN3J2RTS5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JBTCN3J2RTS5W6QH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JBTCN3J2","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JBTCN3J2RTS5W6QH64GSOWPEFD","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:19:27Z","cross_cats_sorted":[],"title_canon_sha256":"b82df414abb3d01da3d2bd78fcd5f705556df0d5cc4a4d3ab49c00f546808459","abstract_canon_sha256":"6847c1f7c1547e9cb0c12dc4dfd5715f2f637091f1b143271b313e287c317646"},"schema_version":"1.0"},"canonical_sha256":"486626ed3a8ce5db7a07f70d2759e428c272217352d261f8afca80eddfe0d91b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:56.400407Z","signature_b64":"0IYbWaq2VsjBnliOwFFM5CLp4FxJlwtl4CoHcDeV60F/novlxpTgoygNoTIcor48iyWia1rWVQDaYWIvoZfKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486626ed3a8ce5db7a07f70d2759e428c272217352d261f8afca80eddfe0d91b","last_reissued_at":"2026-05-18T00:44:56.399867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:56.399867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02487","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:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDVgm5jmOc+xJusEO1OIUGyv1flkNPwFua5nH9qw7fG5MS46vnUozt4owmUUCuDlBA704ZYaaRRwxF8unLz+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:45.827502Z"},"content_sha256":"cffc099901f40abbb8706751caab88b260c8476977ff42cd8009f2cadcd516b3","schema_version":"1.0","event_id":"sha256:cffc099901f40abbb8706751caab88b260c8476977ff42cd8009f2cadcd516b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JBTCN3J2RTS5W6QH64GSOWPEFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total proper connection and graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu Zhu, Yingying Zhang","submitted_at":"2017-05-06T14:19:27Z","abstract_excerpt":"A graph is said to be {\\it total-colored} if all the edges and vertices of the graph are colored. A path in a total-colored graph is a {\\it total proper path} if $(i)$ any two adjacent edges on the path differ in color, $(ii)$ any two internal adjacent vertices on the path differ in color, and $(iii)$ any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph is called {\\it total-proper connected} if any two vertices of the graph are connected by a total proper path of the graph. For a connected graph $G$, the {\\it total proper connection number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02487","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:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACqxUviR8D2b370vJAXJi9nzGSv4UHviW/G1k9astSq3lzJXiutIiQe0lf60z/PbeRc5Borv0HE1Ss65oxQPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:45.828140Z"},"content_sha256":"1c5e85efcb9c082f4fdef9480333cad94cf88c3b7fe964ce2d523b27ea91aedb","schema_version":"1.0","event_id":"sha256:1c5e85efcb9c082f4fdef9480333cad94cf88c3b7fe964ce2d523b27ea91aedb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBTCN3J2RTS5W6QH64GSOWPEFD/bundle.json","state_url":"https://pith.science/pith/JBTCN3J2RTS5W6QH64GSOWPEFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBTCN3J2RTS5W6QH64GSOWPEFD/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-31T07:13:45Z","links":{"resolver":"https://pith.science/pith/JBTCN3J2RTS5W6QH64GSOWPEFD","bundle":"https://pith.science/pith/JBTCN3J2RTS5W6QH64GSOWPEFD/bundle.json","state":"https://pith.science/pith/JBTCN3J2RTS5W6QH64GSOWPEFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBTCN3J2RTS5W6QH64GSOWPEFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JBTCN3J2RTS5W6QH64GSOWPEFD","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":"6847c1f7c1547e9cb0c12dc4dfd5715f2f637091f1b143271b313e287c317646","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:19:27Z","title_canon_sha256":"b82df414abb3d01da3d2bd78fcd5f705556df0d5cc4a4d3ab49c00f546808459"},"schema_version":"1.0","source":{"id":"1705.02487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02487","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02487v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02487","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"JBTCN3J2RTS5","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JBTCN3J2RTS5W6QH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JBTCN3J2","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:1c5e85efcb9c082f4fdef9480333cad94cf88c3b7fe964ce2d523b27ea91aedb","target":"graph","created_at":"2026-05-18T00:44:56Z","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 graph is said to be {\\it total-colored} if all the edges and vertices of the graph are colored. A path in a total-colored graph is a {\\it total proper path} if $(i)$ any two adjacent edges on the path differ in color, $(ii)$ any two internal adjacent vertices on the path differ in color, and $(iii)$ any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph is called {\\it total-proper connected} if any two vertices of the graph are connected by a total proper path of the graph. For a connected graph $G$, the {\\it total proper connection number","authors_text":"Xiaoyu Zhu, Yingying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:19:27Z","title":"Total proper connection and graph operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02487","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:cffc099901f40abbb8706751caab88b260c8476977ff42cd8009f2cadcd516b3","target":"record","created_at":"2026-05-18T00:44:56Z","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":"6847c1f7c1547e9cb0c12dc4dfd5715f2f637091f1b143271b313e287c317646","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:19:27Z","title_canon_sha256":"b82df414abb3d01da3d2bd78fcd5f705556df0d5cc4a4d3ab49c00f546808459"},"schema_version":"1.0","source":{"id":"1705.02487","kind":"arxiv","version":1}},"canonical_sha256":"486626ed3a8ce5db7a07f70d2759e428c272217352d261f8afca80eddfe0d91b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"486626ed3a8ce5db7a07f70d2759e428c272217352d261f8afca80eddfe0d91b","first_computed_at":"2026-05-18T00:44:56.399867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:56.399867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0IYbWaq2VsjBnliOwFFM5CLp4FxJlwtl4CoHcDeV60F/novlxpTgoygNoTIcor48iyWia1rWVQDaYWIvoZfKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:56.400407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cffc099901f40abbb8706751caab88b260c8476977ff42cd8009f2cadcd516b3","sha256:1c5e85efcb9c082f4fdef9480333cad94cf88c3b7fe964ce2d523b27ea91aedb"],"state_sha256":"76c589d68ed0ae67d57c1322cd19e5b98a3c831d6cfda8b8f70b89c6c865e46d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ynAaaJtiy/FDtwSavC/7fg/9QZgamj2GjEBCCAYpJ2NjfndP/REY1pSnFhUBXDD2oY85PlYubhVBE72klbasDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:13:45.830705Z","bundle_sha256":"14fe8d5a41340a2c2d52d09de6d19a93bf5ec5824c5a9a3f08dfc5671085d8cc"}}