{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NX6TEKM4IAZN4RXPTSSWYFXQFQ","short_pith_number":"pith:NX6TEKM4","canonical_record":{"source":{"id":"1512.00726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-02T15:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"f9a69960292676f222808036e514bd0fbcc6e47b893ee50ccf10829d44e2625c","abstract_canon_sha256":"2e6d77c6ebdfe49ead281d4708fe47b182869095906f053bcae18bf4d43701e2"},"schema_version":"1.0"},"canonical_sha256":"6dfd32299c4032de46ef9ca56c16f02c28988d8e5a881b3fc538e55b3bae1090","source":{"kind":"arxiv","id":"1512.00726","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00726","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00726v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00726","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"NX6TEKM4IAZN","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NX6TEKM4IAZN4RXP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NX6TEKM4","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NX6TEKM4IAZN4RXPTSSWYFXQFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-02T15:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"f9a69960292676f222808036e514bd0fbcc6e47b893ee50ccf10829d44e2625c","abstract_canon_sha256":"2e6d77c6ebdfe49ead281d4708fe47b182869095906f053bcae18bf4d43701e2"},"schema_version":"1.0"},"canonical_sha256":"6dfd32299c4032de46ef9ca56c16f02c28988d8e5a881b3fc538e55b3bae1090","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:25.239331Z","signature_b64":"km4gtQqZYdB+AmdhQ2AE38UE0JARB8XbUM4YtPsjkXaEi/i8kDCCi1LfjZgPOwdnG2fMRyGy53oScNGiYm1SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dfd32299c4032de46ef9ca56c16f02c28988d8e5a881b3fc538e55b3bae1090","last_reissued_at":"2026-05-18T01:25:25.238886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:25.238886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00726","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-18T01:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqcIXUn5UKopELIGcXDVV8OW4eBZvqkZbEtDrWrqdh2QmTm6PgKPzZvlNg4aVzdqoxQSYF2OpINeqrql9ik4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:21:48.547880Z"},"content_sha256":"975cdd679454d65f3309728c07e3ff1c1e878c1ee9af1daf233e53cdc08d6a5b","schema_version":"1.0","event_id":"sha256:975cdd679454d65f3309728c07e3ff1c1e878c1ee9af1daf233e53cdc08d6a5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NX6TEKM4IAZN4RXPTSSWYFXQFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total proper connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hui Jiang, Xueliang Li, Yingying Zhang","submitted_at":"2015-12-02T15:01:51Z","abstract_excerpt":"A graph is said to be {\\it total-colored} if all the edges and the vertices of the graph is 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 num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00726","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-18T01:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a58dfRQGYO/EWkTTPTE807sdhQ65RkhDWaZN+cxQCg80I5ZYjnuYxhe5hjVrxoasWOTk2Mj/szNz0JW7y6VDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:21:48.548564Z"},"content_sha256":"c83f412804f364b1029b4cd9128909883b998a0f611cb100b4036424f5a18889","schema_version":"1.0","event_id":"sha256:c83f412804f364b1029b4cd9128909883b998a0f611cb100b4036424f5a18889"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NX6TEKM4IAZN4RXPTSSWYFXQFQ/bundle.json","state_url":"https://pith.science/pith/NX6TEKM4IAZN4RXPTSSWYFXQFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NX6TEKM4IAZN4RXPTSSWYFXQFQ/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-04T06:21:48Z","links":{"resolver":"https://pith.science/pith/NX6TEKM4IAZN4RXPTSSWYFXQFQ","bundle":"https://pith.science/pith/NX6TEKM4IAZN4RXPTSSWYFXQFQ/bundle.json","state":"https://pith.science/pith/NX6TEKM4IAZN4RXPTSSWYFXQFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NX6TEKM4IAZN4RXPTSSWYFXQFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NX6TEKM4IAZN4RXPTSSWYFXQFQ","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":"2e6d77c6ebdfe49ead281d4708fe47b182869095906f053bcae18bf4d43701e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-02T15:01:51Z","title_canon_sha256":"f9a69960292676f222808036e514bd0fbcc6e47b893ee50ccf10829d44e2625c"},"schema_version":"1.0","source":{"id":"1512.00726","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00726","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00726v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00726","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"NX6TEKM4IAZN","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NX6TEKM4IAZN4RXP","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NX6TEKM4","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:c83f412804f364b1029b4cd9128909883b998a0f611cb100b4036424f5a18889","target":"graph","created_at":"2026-05-18T01:25:25Z","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 the vertices of the graph is 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 num","authors_text":"Hui Jiang, Xueliang Li, Yingying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-02T15:01:51Z","title":"Total proper connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00726","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:975cdd679454d65f3309728c07e3ff1c1e878c1ee9af1daf233e53cdc08d6a5b","target":"record","created_at":"2026-05-18T01:25:25Z","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":"2e6d77c6ebdfe49ead281d4708fe47b182869095906f053bcae18bf4d43701e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-02T15:01:51Z","title_canon_sha256":"f9a69960292676f222808036e514bd0fbcc6e47b893ee50ccf10829d44e2625c"},"schema_version":"1.0","source":{"id":"1512.00726","kind":"arxiv","version":1}},"canonical_sha256":"6dfd32299c4032de46ef9ca56c16f02c28988d8e5a881b3fc538e55b3bae1090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dfd32299c4032de46ef9ca56c16f02c28988d8e5a881b3fc538e55b3bae1090","first_computed_at":"2026-05-18T01:25:25.238886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:25.238886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"km4gtQqZYdB+AmdhQ2AE38UE0JARB8XbUM4YtPsjkXaEi/i8kDCCi1LfjZgPOwdnG2fMRyGy53oScNGiYm1SAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:25.239331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00726","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:975cdd679454d65f3309728c07e3ff1c1e878c1ee9af1daf233e53cdc08d6a5b","sha256:c83f412804f364b1029b4cd9128909883b998a0f611cb100b4036424f5a18889"],"state_sha256":"7003f43a71e5ec29fd9d7df5d9083eecd21e93b33fae6576b0375c7be55cbfbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TtSz6/wfcgGDlHDqo1u5whBNICLvEc+3WYb9/Eb8UxgB3d8zTNK8zenkKYcCzuE+roPYg8H3vWxSyf2nNCp9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:21:48.552506Z","bundle_sha256":"81ebd9cce915387a931f1a18e1df902fad7ee7645935ec4d532bbbe1e2546cd5"}}