{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:REHM6A56TS4XHCMOYULD3M722N","short_pith_number":"pith:REHM6A56","schema_version":"1.0","canonical_sha256":"890ecf03be9cb973898ec5163db3fad377ac387bca4ad76b3f2d36160231b547","source":{"kind":"arxiv","id":"1508.05024","version":1},"attestation_state":"computed","paper":{"title":"Distant set distinguishing edge 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-20T16:11:03Z","abstract_excerpt":"We consider the following extension of the concept of adjacent strong edge colourings of graphs without isolated edges. Two distinct vertices which are at distant at most $r$ in a graph are called $r$-adjacent. The least number of colours in a proper edge colouring of a graph $G$ such that the sets of colours met by any $r$-adjacent vertices in $G$ are distinct is called the $r$-adjacent strong chromatic index of $G$ and denoted by $\\chi'_{a,r}(G)$. It has been conjectured that $\\chi'_{a,1}(G)\\leq\\Delta+2$ if $G$ is connected of maximum degree $\\Delta$ and non-isomorphic to $C_5$, while Hatami"},"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":"1508.05024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-20T16:11:03Z","cross_cats_sorted":[],"title_canon_sha256":"5b59fddc7051392060dc5bb9a26f10ab6f0ffc28a487712323eae653321f5e64","abstract_canon_sha256":"e264ee5ea144b56566002ad5093be8f6242de89869b31cff063fd45517e9538b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:37.999704Z","signature_b64":"DWHXHr+NErZJheMIOWuAQDelHUHa5gUWtCGcvVl6SAkq6OKETpl62KyssPtGyQBWKsVoJkoTy9mShO9P8XnGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"890ecf03be9cb973898ec5163db3fad377ac387bca4ad76b3f2d36160231b547","last_reissued_at":"2026-05-18T00:21:37.998985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:37.998985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distant set distinguishing edge 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-20T16:11:03Z","abstract_excerpt":"We consider the following extension of the concept of adjacent strong edge colourings of graphs without isolated edges. Two distinct vertices which are at distant at most $r$ in a graph are called $r$-adjacent. The least number of colours in a proper edge colouring of a graph $G$ such that the sets of colours met by any $r$-adjacent vertices in $G$ are distinct is called the $r$-adjacent strong chromatic index of $G$ and denoted by $\\chi'_{a,r}(G)$. It has been conjectured that $\\chi'_{a,1}(G)\\leq\\Delta+2$ if $G$ is connected of maximum degree $\\Delta$ and non-isomorphic to $C_5$, while Hatami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05024","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.05024","created_at":"2026-05-18T00:21:37.999117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05024v1","created_at":"2026-05-18T00:21:37.999117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05024","created_at":"2026-05-18T00:21:37.999117+00:00"},{"alias_kind":"pith_short_12","alias_value":"REHM6A56TS4X","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"REHM6A56TS4XHCMO","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"REHM6A56","created_at":"2026-05-18T12:29:39.896362+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/REHM6A56TS4XHCMOYULD3M722N","json":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N.json","graph_json":"https://pith.science/api/pith-number/REHM6A56TS4XHCMOYULD3M722N/graph.json","events_json":"https://pith.science/api/pith-number/REHM6A56TS4XHCMOYULD3M722N/events.json","paper":"https://pith.science/paper/REHM6A56"},"agent_actions":{"view_html":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N","download_json":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N.json","view_paper":"https://pith.science/paper/REHM6A56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05024&json=true","fetch_graph":"https://pith.science/api/pith-number/REHM6A56TS4XHCMOYULD3M722N/graph.json","fetch_events":"https://pith.science/api/pith-number/REHM6A56TS4XHCMOYULD3M722N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N/action/storage_attestation","attest_author":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N/action/author_attestation","sign_citation":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N/action/citation_signature","submit_replication":"https://pith.science/pith/REHM6A56TS4XHCMOYULD3M722N/action/replication_record"}},"created_at":"2026-05-18T00:21:37.999117+00:00","updated_at":"2026-05-18T00:21:37.999117+00:00"}