{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WGEMWTZXU7BZM7A7EZQ5IZCPXO","short_pith_number":"pith:WGEMWTZX","canonical_record":{"source":{"id":"1508.01062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T13:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"e139eef0b90f3c782b942eed70ae50c4feeef20a31c29a038fc63d9bcb4160f2","abstract_canon_sha256":"ad0c3e19ec4c11a982097bebfef035e6b18d38fa72f2c6ee69678922827f9a03"},"schema_version":"1.0"},"canonical_sha256":"b188cb4f37a7c3967c1f2661d4644fbb8125494a67e682f9e5a1eca27ed4054e","source":{"kind":"arxiv","id":"1508.01062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01062","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01062v1","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01062","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"WGEMWTZXU7BZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WGEMWTZXU7BZM7A7","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WGEMWTZX","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WGEMWTZXU7BZM7A7EZQ5IZCPXO","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T13:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"e139eef0b90f3c782b942eed70ae50c4feeef20a31c29a038fc63d9bcb4160f2","abstract_canon_sha256":"ad0c3e19ec4c11a982097bebfef035e6b18d38fa72f2c6ee69678922827f9a03"},"schema_version":"1.0"},"canonical_sha256":"b188cb4f37a7c3967c1f2661d4644fbb8125494a67e682f9e5a1eca27ed4054e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:44.149390Z","signature_b64":"dF5Mf7Iu0Q0w3UiOsX6UIHb9AeLdNItflwrNC9pDhQXE4QXeyCisgBmxMwl4Lhov7Ev2useDkZoSXY2Pgc4eAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b188cb4f37a7c3967c1f2661d4644fbb8125494a67e682f9e5a1eca27ed4054e","last_reissued_at":"2026-05-18T01:35:44.148915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:44.148915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01062","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:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRKFr7zLZbJztqTuDyBinXmtrhORjXKZ2EmEFhaIZy3iHSPbRmtdKqiPTO1PPsYBOLHyCmu2KsCZ1y/EE6S/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:30:11.360732Z"},"content_sha256":"53e62e540e1a7866b942b38f9f2ece2329ac02d8e22f363a021e939cbfb99d87","schema_version":"1.0","event_id":"sha256:53e62e540e1a7866b942b38f9f2ece2329ac02d8e22f363a021e939cbfb99d87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WGEMWTZXU7BZM7A7EZQ5IZCPXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically optimal neighbour sum distinguishing total colourings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Przyby{\\l}o","submitted_at":"2015-08-05T13:11:33Z","abstract_excerpt":"Consider a simple graph $G=(V,E)$ of maximum degree $\\Delta$ and its proper total colouring $c$ with the elements of the set $\\{1,2,\\ldots,k\\}$. The colouring $c$ is said to be \\emph{neighbour sum distinguishing} if for every pair of adjacent vertices $u$, $v$, we have $c(u)+\\sum_{e\\ni u}c(e)\\neq c(v)+\\sum_{e\\ni v}c(e)$. The least integer $k$ for which it exists is denoted by $\\chi\"_{\\sum}(G)$, hence $\\chi\"_{\\sum}(G) \\geq \\Delta+1$. On the other hand, it has been daringly conjectured that just one more label than presumed in the famous Total Colouring Conjecture suffices to construct such tota"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01062","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:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vtqufbFicJwY7/RJ7wbUhzwU93KFnpzQmCt9gjX4Xh6ExUukbdVsa+wcOldjKw+jXXx7qvauiRZBgcAWm0oaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:30:11.361078Z"},"content_sha256":"a53831ee7b545effd563180251bf0afb902b9490fcf14e307bb1c1e20f735c80","schema_version":"1.0","event_id":"sha256:a53831ee7b545effd563180251bf0afb902b9490fcf14e307bb1c1e20f735c80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGEMWTZXU7BZM7A7EZQ5IZCPXO/bundle.json","state_url":"https://pith.science/pith/WGEMWTZXU7BZM7A7EZQ5IZCPXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGEMWTZXU7BZM7A7EZQ5IZCPXO/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-20T20:30:11Z","links":{"resolver":"https://pith.science/pith/WGEMWTZXU7BZM7A7EZQ5IZCPXO","bundle":"https://pith.science/pith/WGEMWTZXU7BZM7A7EZQ5IZCPXO/bundle.json","state":"https://pith.science/pith/WGEMWTZXU7BZM7A7EZQ5IZCPXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGEMWTZXU7BZM7A7EZQ5IZCPXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WGEMWTZXU7BZM7A7EZQ5IZCPXO","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":"ad0c3e19ec4c11a982097bebfef035e6b18d38fa72f2c6ee69678922827f9a03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T13:11:33Z","title_canon_sha256":"e139eef0b90f3c782b942eed70ae50c4feeef20a31c29a038fc63d9bcb4160f2"},"schema_version":"1.0","source":{"id":"1508.01062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01062","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01062v1","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01062","created_at":"2026-05-18T01:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"WGEMWTZXU7BZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WGEMWTZXU7BZM7A7","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WGEMWTZX","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:a53831ee7b545effd563180251bf0afb902b9490fcf14e307bb1c1e20f735c80","target":"graph","created_at":"2026-05-18T01:35:44Z","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":"Consider a simple graph $G=(V,E)$ of maximum degree $\\Delta$ and its proper total colouring $c$ with the elements of the set $\\{1,2,\\ldots,k\\}$. The colouring $c$ is said to be \\emph{neighbour sum distinguishing} if for every pair of adjacent vertices $u$, $v$, we have $c(u)+\\sum_{e\\ni u}c(e)\\neq c(v)+\\sum_{e\\ni v}c(e)$. The least integer $k$ for which it exists is denoted by $\\chi\"_{\\sum}(G)$, hence $\\chi\"_{\\sum}(G) \\geq \\Delta+1$. On the other hand, it has been daringly conjectured that just one more label than presumed in the famous Total Colouring Conjecture suffices to construct such tota","authors_text":"Jakub Przyby{\\l}o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T13:11:33Z","title":"Asymptotically optimal neighbour sum distinguishing total colourings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01062","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:53e62e540e1a7866b942b38f9f2ece2329ac02d8e22f363a021e939cbfb99d87","target":"record","created_at":"2026-05-18T01:35:44Z","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":"ad0c3e19ec4c11a982097bebfef035e6b18d38fa72f2c6ee69678922827f9a03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-05T13:11:33Z","title_canon_sha256":"e139eef0b90f3c782b942eed70ae50c4feeef20a31c29a038fc63d9bcb4160f2"},"schema_version":"1.0","source":{"id":"1508.01062","kind":"arxiv","version":1}},"canonical_sha256":"b188cb4f37a7c3967c1f2661d4644fbb8125494a67e682f9e5a1eca27ed4054e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b188cb4f37a7c3967c1f2661d4644fbb8125494a67e682f9e5a1eca27ed4054e","first_computed_at":"2026-05-18T01:35:44.148915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:44.148915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dF5Mf7Iu0Q0w3UiOsX6UIHb9AeLdNItflwrNC9pDhQXE4QXeyCisgBmxMwl4Lhov7Ev2useDkZoSXY2Pgc4eAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:44.149390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53e62e540e1a7866b942b38f9f2ece2329ac02d8e22f363a021e939cbfb99d87","sha256:a53831ee7b545effd563180251bf0afb902b9490fcf14e307bb1c1e20f735c80"],"state_sha256":"b6c22e36b2d6f63f5ff4b536ffdc458485161188529da9b8f059649db7e74ff0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD7jClKKuct8RKcdAJp2p3MXd2YlWTOZA2bADDTBCOuNkFzhFy028fH/yUI6AMtTpK06qHHs1JODXOZVHiAXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:30:11.363263Z","bundle_sha256":"31cc1eedd86ebf2ef9da54027031142ffb4e5b532cdd5f76a780d4ec019aaf31"}}