{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:56AFQWCYL6HYDKUTM4HXY4VYFD","short_pith_number":"pith:56AFQWCY","canonical_record":{"source":{"id":"1507.07573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T20:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"9ab63a6d350e681cf1eedd2024bea8759a1886f399ed45f640ffb050d14b44f2","abstract_canon_sha256":"d5d97337d73ba055458b0e9a5cad429af62a12af886242d42515f9399250fa72"},"schema_version":"1.0"},"canonical_sha256":"ef805858585f8f81aa93670f7c72b828e190b277094cea1c6cce94bbebcd643c","source":{"kind":"arxiv","id":"1507.07573","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07573","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07573v2","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07573","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"56AFQWCYL6HY","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"56AFQWCYL6HYDKUT","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"56AFQWCY","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:56AFQWCYL6HYDKUTM4HXY4VYFD","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T20:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"9ab63a6d350e681cf1eedd2024bea8759a1886f399ed45f640ffb050d14b44f2","abstract_canon_sha256":"d5d97337d73ba055458b0e9a5cad429af62a12af886242d42515f9399250fa72"},"schema_version":"1.0"},"canonical_sha256":"ef805858585f8f81aa93670f7c72b828e190b277094cea1c6cce94bbebcd643c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.242142Z","signature_b64":"CL3b+0bNZghAw1KXTViPFpRgE3sL5BY4Rtt2MNyKcTMVNKlBkL4IRqsj8iDWE4a06UHWSBViTqb98u5sQiOcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef805858585f8f81aa93670f7c72b828e190b277094cea1c6cce94bbebcd643c","last_reissued_at":"2026-05-18T01:09:46.241494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.241494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07573","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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cL1bqNTejthzaeq/EA4nEfyTg2R6ugSVtEHAyfojnPu8E5p2T3IcH4CqxPJ78q7SukBQ8b+nmPaglZJ1BWP9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:01.987933Z"},"content_sha256":"e469c644c0b6c1cb5f459f42f64d0e5a24c93fbbd3b943d209af40e55008c494","schema_version":"1.0","event_id":"sha256:e469c644c0b6c1cb5f459f42f64d0e5a24c93fbbd3b943d209af40e55008c494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:56AFQWCYL6HYDKUTM4HXY4VYFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically optimal neighbor sum distinguishing total colorings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Przyby{\\l}o, Sarah Loeb, Yunfang Tang","submitted_at":"2015-07-27T20:17:17Z","abstract_excerpt":"Given a proper total $k$-coloring $c:V(G)\\cup E(G)\\to\\{1,2,\\ldots,k\\}$ of a graph $G$, we define the value of a vertex $v$ to be $c(v) + \\sum_{uv \\in E(G)} c(uv)$. The smallest integer $k$ such that $G$ has a proper total $k$-coloring whose values form a proper coloring is the neighbor sum distinguishing total chromatic number of $G$, $\\chi\"_{\\Sigma}(G)$. Pil\\'sniak and Wo\\'zniak (2013) conjectured that $\\chi\"_{\\Sigma}(G)\\leq \\Delta(G)+3$ for any simple graph with maximum degree $\\Delta(G)$. In this paper, we prove this bound to be asymptotically correct by showing that $\\chi\"_{\\Sigma}(G)\\leq "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07573","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-18T01:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jIlNN/R523ButiBdmh2gY4nRDVb15ZjYvvASqsJX0L7nsiSM52HjemFJg2e3OxgeoEFutdRJH3Ry4n2OfX+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:01.988279Z"},"content_sha256":"26e6e374dd4de1da31893a957d4dcac314d9942c0626033dcce3a07010ffb4a2","schema_version":"1.0","event_id":"sha256:26e6e374dd4de1da31893a957d4dcac314d9942c0626033dcce3a07010ffb4a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/bundle.json","state_url":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/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-30T05:20:01Z","links":{"resolver":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD","bundle":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/bundle.json","state":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:56AFQWCYL6HYDKUTM4HXY4VYFD","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":"d5d97337d73ba055458b0e9a5cad429af62a12af886242d42515f9399250fa72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T20:17:17Z","title_canon_sha256":"9ab63a6d350e681cf1eedd2024bea8759a1886f399ed45f640ffb050d14b44f2"},"schema_version":"1.0","source":{"id":"1507.07573","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07573","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07573v2","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07573","created_at":"2026-05-18T01:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"56AFQWCYL6HY","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"56AFQWCYL6HYDKUT","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"56AFQWCY","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:26e6e374dd4de1da31893a957d4dcac314d9942c0626033dcce3a07010ffb4a2","target":"graph","created_at":"2026-05-18T01:09:46Z","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":"Given a proper total $k$-coloring $c:V(G)\\cup E(G)\\to\\{1,2,\\ldots,k\\}$ of a graph $G$, we define the value of a vertex $v$ to be $c(v) + \\sum_{uv \\in E(G)} c(uv)$. The smallest integer $k$ such that $G$ has a proper total $k$-coloring whose values form a proper coloring is the neighbor sum distinguishing total chromatic number of $G$, $\\chi\"_{\\Sigma}(G)$. Pil\\'sniak and Wo\\'zniak (2013) conjectured that $\\chi\"_{\\Sigma}(G)\\leq \\Delta(G)+3$ for any simple graph with maximum degree $\\Delta(G)$. In this paper, we prove this bound to be asymptotically correct by showing that $\\chi\"_{\\Sigma}(G)\\leq ","authors_text":"Jakub Przyby{\\l}o, Sarah Loeb, Yunfang Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T20:17:17Z","title":"Asymptotically optimal neighbor sum distinguishing total colorings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07573","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:e469c644c0b6c1cb5f459f42f64d0e5a24c93fbbd3b943d209af40e55008c494","target":"record","created_at":"2026-05-18T01:09:46Z","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":"d5d97337d73ba055458b0e9a5cad429af62a12af886242d42515f9399250fa72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T20:17:17Z","title_canon_sha256":"9ab63a6d350e681cf1eedd2024bea8759a1886f399ed45f640ffb050d14b44f2"},"schema_version":"1.0","source":{"id":"1507.07573","kind":"arxiv","version":2}},"canonical_sha256":"ef805858585f8f81aa93670f7c72b828e190b277094cea1c6cce94bbebcd643c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef805858585f8f81aa93670f7c72b828e190b277094cea1c6cce94bbebcd643c","first_computed_at":"2026-05-18T01:09:46.241494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:46.241494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CL3b+0bNZghAw1KXTViPFpRgE3sL5BY4Rtt2MNyKcTMVNKlBkL4IRqsj8iDWE4a06UHWSBViTqb98u5sQiOcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:46.242142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07573","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e469c644c0b6c1cb5f459f42f64d0e5a24c93fbbd3b943d209af40e55008c494","sha256:26e6e374dd4de1da31893a957d4dcac314d9942c0626033dcce3a07010ffb4a2"],"state_sha256":"14b2f3a5b139c1ed9e59b529540620dd38e502c4b5290fc27c0bda03c1a6ece3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXhlOOEaS7tYQmM+6+X7q0RWxyCg914WNIbZ//4mHn9gWO1B3Q2xikcbb8LFjI4jR8cATpRll7XN0cKGIBXCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:20:01.990360Z","bundle_sha256":"ebe065aa48602b6dfc4a90df5c2a75b07018cbe177b8c3c2bd1ee35b715e96e4"}}