{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UDVXJY4BAZFBS456GSCP7M5FPQ","short_pith_number":"pith:UDVXJY4B","schema_version":"1.0","canonical_sha256":"a0eb74e381064a1973be3484ffb3a57c115e4490b7bcfd68cf33b1e15e0f7337","source":{"kind":"arxiv","id":"1611.08990","version":2},"attestation_state":"computed","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}"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.08990","created_at":"2026-05-18T00:56:11.708934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08990v2","created_at":"2026-05-18T00:56:11.708934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08990","created_at":"2026-05-18T00:56:11.708934+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDVXJY4BAZFB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDVXJY4BAZFBS456","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDVXJY4B","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ","json":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ.json","graph_json":"https://pith.science/api/pith-number/UDVXJY4BAZFBS456GSCP7M5FPQ/graph.json","events_json":"https://pith.science/api/pith-number/UDVXJY4BAZFBS456GSCP7M5FPQ/events.json","paper":"https://pith.science/paper/UDVXJY4B"},"agent_actions":{"view_html":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ","download_json":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ.json","view_paper":"https://pith.science/paper/UDVXJY4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08990&json=true","fetch_graph":"https://pith.science/api/pith-number/UDVXJY4BAZFBS456GSCP7M5FPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UDVXJY4BAZFBS456GSCP7M5FPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/action/storage_attestation","attest_author":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/action/author_attestation","sign_citation":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/action/citation_signature","submit_replication":"https://pith.science/pith/UDVXJY4BAZFBS456GSCP7M5FPQ/action/replication_record"}},"created_at":"2026-05-18T00:56:11.708934+00:00","updated_at":"2026-05-18T00:56:11.708934+00:00"}