{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UDVXJY4BAZFBS456GSCP7M5FPQ","short_pith_number":"pith:UDVXJY4B","canonical_record":{"source":{"id":"1611.08990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T05:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"5e572a6ce3b8454ba8f03a3f46e668a296b5a82afe8343f025657ffc126ee8b7","abstract_canon_sha256":"afa08eac05818cc7cb66477328cac8233bd3cc88625c60856f5cd00a023aec77"},"schema_version":"1.0"},"canonical_sha256":"a0eb74e381064a1973be3484ffb3a57c115e4490b7bcfd68cf33b1e15e0f7337","source":{"kind":"arxiv","id":"1611.08990","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08990","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08990v2","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08990","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"UDVXJY4BAZFB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UDVXJY4BAZFBS456","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UDVXJY4B","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UDVXJY4BAZFBS456GSCP7M5FPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T05:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"5e572a6ce3b8454ba8f03a3f46e668a296b5a82afe8343f025657ffc126ee8b7","abstract_canon_sha256":"afa08eac05818cc7cb66477328cac8233bd3cc88625c60856f5cd00a023aec77"},"schema_version":"1.0"},"canonical_sha256":"a0eb74e381064a1973be3484ffb3a57c115e4490b7bcfd68cf33b1e15e0f7337","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:11.709271Z","signature_b64":"SsQ/4DWJlWkYMPTmBRoA1yJxposCLSUr+NNafaMoZcNSueJOu+g8P0YVSZsH5JqRtkC23vcsYbjdXwU19yp7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0eb74e381064a1973be3484ffb3a57c115e4490b7bcfd68cf33b1e15e0f7337","last_reissued_at":"2026-05-18T00:56:11.708876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:11.708876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08990","source_version":2,"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"optzICXxCDpv7WCLShn+z/Mvzdj11111fjxoO3mYGeaNzNLdj8vwO151kOpwAEZD048Fhzi8UKu5XDrJ1NJcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:55.567358Z"},"content_sha256":"b009dfdedbb331b1079b42b7916ef6f4f7a0826de29614593d68a46cea9bfd6e","schema_version":"1.0","event_id":"sha256:b009dfdedbb331b1079b42b7916ef6f4f7a0826de29614593d68a46cea9bfd6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UDVXJY4BAZFBS456GSCP7M5FPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nordhaus-Gaddum-type theorem for total proper connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","submitted_at":"2016-11-28T05:41:33Z","abstract_excerpt":"A graph is said to be \\emph{total-colored} if all the edges and the vertices of the graph are colored. A path $P$ in a total-colored graph $G$ is called a \\emph{total-proper path} if $(i)$ any two adjacent edges of $P$ are assigned distinct colors; $(ii)$ any two adjacent internal vertices of $P$ are assigned distinct colors; $(iii)$ any internal vertex of $P$ is assigned a distinct color from its incident edges of $P$. The total-colored graph $G$ is \\emph{total-proper connected} if any two distinct vertices of $G$ are connected by a total-proper path. The \\emph{total-proper connection number}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08990","kind":"arxiv","version":2},"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/izCtm8iaeoPBs2eybDknKtoFDRmwYmC/UrYZj/mtFsr8/3mxvZLF/FWAYpvdqLhHB5Y/DLjWPUdCC5pWh8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:55.567715Z"},"content_sha256":"5705a9927cbc476720ba865cf5e8bb4721e95026401c2246c4026fdc7f33c535","schema_version":"1.0","event_id":"sha256:5705a9927cbc476720ba865cf5e8bb4721e95026401c2246c4026fdc7f33c535"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/bundle.json","state_url":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/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-01T15:55:55Z","links":{"resolver":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ","bundle":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/bundle.json","state":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UDVXJY4BAZFBS456GSCP7M5FPQ","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":"afa08eac05818cc7cb66477328cac8233bd3cc88625c60856f5cd00a023aec77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T05:41:33Z","title_canon_sha256":"5e572a6ce3b8454ba8f03a3f46e668a296b5a82afe8343f025657ffc126ee8b7"},"schema_version":"1.0","source":{"id":"1611.08990","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08990","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08990v2","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08990","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"UDVXJY4BAZFB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UDVXJY4BAZFBS456","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UDVXJY4B","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:5705a9927cbc476720ba865cf5e8bb4721e95026401c2246c4026fdc7f33c535","target":"graph","created_at":"2026-05-18T00:56:11Z","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 \\emph{total-colored} if all the edges and the vertices of the graph are colored. A path $P$ in a total-colored graph $G$ is called a \\emph{total-proper path} if $(i)$ any two adjacent edges of $P$ are assigned distinct colors; $(ii)$ any two adjacent internal vertices of $P$ are assigned distinct colors; $(iii)$ any internal vertex of $P$ is assigned a distinct color from its incident edges of $P$. The total-colored graph $G$ is \\emph{total-proper connected} if any two distinct vertices of $G$ are connected by a total-proper path. The \\emph{total-proper connection number}","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T05:41:33Z","title":"Nordhaus-Gaddum-type theorem for total proper connection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08990","kind":"arxiv","version":2},"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:b009dfdedbb331b1079b42b7916ef6f4f7a0826de29614593d68a46cea9bfd6e","target":"record","created_at":"2026-05-18T00:56:11Z","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":"afa08eac05818cc7cb66477328cac8233bd3cc88625c60856f5cd00a023aec77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-28T05:41:33Z","title_canon_sha256":"5e572a6ce3b8454ba8f03a3f46e668a296b5a82afe8343f025657ffc126ee8b7"},"schema_version":"1.0","source":{"id":"1611.08990","kind":"arxiv","version":2}},"canonical_sha256":"a0eb74e381064a1973be3484ffb3a57c115e4490b7bcfd68cf33b1e15e0f7337","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0eb74e381064a1973be3484ffb3a57c115e4490b7bcfd68cf33b1e15e0f7337","first_computed_at":"2026-05-18T00:56:11.708876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:11.708876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SsQ/4DWJlWkYMPTmBRoA1yJxposCLSUr+NNafaMoZcNSueJOu+g8P0YVSZsH5JqRtkC23vcsYbjdXwU19yp7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:11.709271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08990","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b009dfdedbb331b1079b42b7916ef6f4f7a0826de29614593d68a46cea9bfd6e","sha256:5705a9927cbc476720ba865cf5e8bb4721e95026401c2246c4026fdc7f33c535"],"state_sha256":"737e2f2e357679ad4441a12de9c5e4e7d9b3cba272020cea1c69ec49a60d480b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlK+yK6Pn0HGg3kC9/g/LRuLJT4ZYHt5OuYHHji08E5p1q3iY2zAVexyCGSOegWzdDxzh01VlM3UyxOEpzq0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:55.569681Z","bundle_sha256":"d784fcbecc7a24b38233610dba700a1ef0d60372a7bfb42f4175161bd9fd50fb"}}