{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LKEVELGUYOEJJDKUINYK7TPPFQ","short_pith_number":"pith:LKEVELGU","schema_version":"1.0","canonical_sha256":"5a89522cd4c388948d544370afcdef2c1b9e63cd8aa14cf7e1979d0dbdb4fca4","source":{"kind":"arxiv","id":"1408.3190","version":2},"attestation_state":"computed","paper":{"title":"On the neighbour sum distinguishing index of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jakub Przyby{\\l}o, Marthe Bonamy","submitted_at":"2014-08-14T04:22:07Z","abstract_excerpt":"Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\\ldots,k$. Then $k\\geq \\Delta(G)$, while by Vizing's theorem, no more than $k=\\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating irregularities in graphs, it has been moreover conjectured that only slightly larger $k$, i.e., $k=\\Delta(G)+2$ enables enforcing additional strong feature of $c$, namely that it attributes distinct sums of incident colours to adjacent vertices in $G$ if only this graph has no isolated edges and is not isomorphic to $C_5$. We prove the conjecture is valid for p"},"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":"1408.3190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-14T04:22:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a51f61e3d85321c57c36a5ac478bd08a8cf3891a15ee04ec5a6ff33abcab01ac","abstract_canon_sha256":"b40bff109b1ac204a3460dcec6620ec46b518d2ba50dba7308bdef360bcee64d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:57.472282Z","signature_b64":"gzXdr6/iIBL1BNI/lYYSZO4n+V1JwwJu1qkdu/+0FZ3L2Sb2qDG1rfmBjDR8HewnWc0mtCIuavIkpEYu9J21Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a89522cd4c388948d544370afcdef2c1b9e63cd8aa14cf7e1979d0dbdb4fca4","last_reissued_at":"2026-05-18T00:21:57.471618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:57.471618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the neighbour sum distinguishing index of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jakub Przyby{\\l}o, Marthe Bonamy","submitted_at":"2014-08-14T04:22:07Z","abstract_excerpt":"Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\\ldots,k$. Then $k\\geq \\Delta(G)$, while by Vizing's theorem, no more than $k=\\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating irregularities in graphs, it has been moreover conjectured that only slightly larger $k$, i.e., $k=\\Delta(G)+2$ enables enforcing additional strong feature of $c$, namely that it attributes distinct sums of incident colours to adjacent vertices in $G$ if only this graph has no isolated edges and is not isomorphic to $C_5$. We prove the conjecture is valid for p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3190","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":"1408.3190","created_at":"2026-05-18T00:21:57.471716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3190v2","created_at":"2026-05-18T00:21:57.471716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3190","created_at":"2026-05-18T00:21:57.471716+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKEVELGUYOEJ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKEVELGUYOEJJDKU","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKEVELGU","created_at":"2026-05-18T12:28:38.356838+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/LKEVELGUYOEJJDKUINYK7TPPFQ","json":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ.json","graph_json":"https://pith.science/api/pith-number/LKEVELGUYOEJJDKUINYK7TPPFQ/graph.json","events_json":"https://pith.science/api/pith-number/LKEVELGUYOEJJDKUINYK7TPPFQ/events.json","paper":"https://pith.science/paper/LKEVELGU"},"agent_actions":{"view_html":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ","download_json":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ.json","view_paper":"https://pith.science/paper/LKEVELGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3190&json=true","fetch_graph":"https://pith.science/api/pith-number/LKEVELGUYOEJJDKUINYK7TPPFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LKEVELGUYOEJJDKUINYK7TPPFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ/action/storage_attestation","attest_author":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ/action/author_attestation","sign_citation":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ/action/citation_signature","submit_replication":"https://pith.science/pith/LKEVELGUYOEJJDKUINYK7TPPFQ/action/replication_record"}},"created_at":"2026-05-18T00:21:57.471716+00:00","updated_at":"2026-05-18T00:21:57.471716+00:00"}