{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QI4HD4QKVJECXJB2PAZQDBHGBS","short_pith_number":"pith:QI4HD4QK","schema_version":"1.0","canonical_sha256":"823871f20aaa482ba43a78330184e60c940187929a433673f19a3516e9ee6ed0","source":{"kind":"arxiv","id":"1705.01637","version":1},"attestation_state":"computed","paper":{"title":"Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Kwa\\'sny, Jakub Przyby{\\l}o","submitted_at":"2017-05-03T21:51:09Z","abstract_excerpt":"An adjacent vertex distinguishing edge colouring of a graph $G$ without isolated edges is its proper edge colouring such that no pair of adjacent vertices meets the same set of colours in $G$. We show that such colouring can be chosen from any set of lists associated to the edges of $G$ as long as the size of every list is at least $\\Delta+C\\Delta^{\\frac{1}{2}}(\\log\\Delta)^4$, where $\\Delta$ is the maximum degree of $G$ and $C$ is a constant. The proof is probabilistic. The same is true in the environment of total colourings."},"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":"1705.01637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-03T21:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"c46d942b047bf81de06863328189ca53ed3847fa5a021d818e4b345e4cb1320e","abstract_canon_sha256":"5b5a9f4ffa68de4a81242b40a3ea1ca575442c67b20127aca1ca01c9a9dc7bfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:55.980179Z","signature_b64":"GSrVHdnsbnhDJnquTXnjgggXKuI+c63seu7V7h++2jLWGrZ/iOZBQMEtfTVsCvr7rmtETHyHCfrz8xChCLeIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823871f20aaa482ba43a78330184e60c940187929a433673f19a3516e9ee6ed0","last_reissued_at":"2026-05-17T23:56:55.979566Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:55.979566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Kwa\\'sny, Jakub Przyby{\\l}o","submitted_at":"2017-05-03T21:51:09Z","abstract_excerpt":"An adjacent vertex distinguishing edge colouring of a graph $G$ without isolated edges is its proper edge colouring such that no pair of adjacent vertices meets the same set of colours in $G$. We show that such colouring can be chosen from any set of lists associated to the edges of $G$ as long as the size of every list is at least $\\Delta+C\\Delta^{\\frac{1}{2}}(\\log\\Delta)^4$, where $\\Delta$ is the maximum degree of $G$ and $C$ is a constant. The proof is probabilistic. The same is true in the environment of total colourings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01637","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":"1705.01637","created_at":"2026-05-17T23:56:55.979690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01637v1","created_at":"2026-05-17T23:56:55.979690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01637","created_at":"2026-05-17T23:56:55.979690+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI4HD4QKVJEC","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI4HD4QKVJECXJB2","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI4HD4QK","created_at":"2026-05-18T12:31:39.905425+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/QI4HD4QKVJECXJB2PAZQDBHGBS","json":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS.json","graph_json":"https://pith.science/api/pith-number/QI4HD4QKVJECXJB2PAZQDBHGBS/graph.json","events_json":"https://pith.science/api/pith-number/QI4HD4QKVJECXJB2PAZQDBHGBS/events.json","paper":"https://pith.science/paper/QI4HD4QK"},"agent_actions":{"view_html":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS","download_json":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS.json","view_paper":"https://pith.science/paper/QI4HD4QK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01637&json=true","fetch_graph":"https://pith.science/api/pith-number/QI4HD4QKVJECXJB2PAZQDBHGBS/graph.json","fetch_events":"https://pith.science/api/pith-number/QI4HD4QKVJECXJB2PAZQDBHGBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS/action/storage_attestation","attest_author":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS/action/author_attestation","sign_citation":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS/action/citation_signature","submit_replication":"https://pith.science/pith/QI4HD4QKVJECXJB2PAZQDBHGBS/action/replication_record"}},"created_at":"2026-05-17T23:56:55.979690+00:00","updated_at":"2026-05-17T23:56:55.979690+00:00"}