{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LVB2SK7LHZSDKDIKHKMV2N7BD5","short_pith_number":"pith:LVB2SK7L","schema_version":"1.0","canonical_sha256":"5d43a92beb3e64350d0a3a995d37e11f7d0bd485bbfc475f598177850720ba63","source":{"kind":"arxiv","id":"1508.03515","version":1},"attestation_state":"computed","paper":{"title":"On the Strong Chromatic Index of Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidicky, Derrick Stolee, Eric Sullivan, Jennifer Diemunsch, Luke L. Nelsen, Michael Ferrara, Nathan Graber, Philip DeOrsey, Sogol Jahanbekam, Stephen G. Hartke","submitted_at":"2015-08-14T14:36:15Z","abstract_excerpt":"The strong chromatic index of a graph $G$, denoted $\\chi_s'(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted $\\chi_{s,\\ell}'(G)$, is the least integer $k$ such that if arbitrary lists of size $k$ are assigned to each edge then $G$ can be edge-colored from those lists where edges at distance at most two receive distinct colors. We use the discharging method, the Combinatorial Nullstellensatz, and computation to show that if $G$ is a subcubic planar graph with $\\operatorname{girth}("},"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.03515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-14T14:36:15Z","cross_cats_sorted":[],"title_canon_sha256":"9826add717f0690cff3ebb4ca75b3e8aa77e09982adb57ee38a20063274a9c84","abstract_canon_sha256":"49667cde36ee7ba830daee26546c506d74c6732921daebbd5ffadd78cd14a792"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:59.257047Z","signature_b64":"ZOnO2DDms9IQMNB27k3w27ssPTzcOWNGbISpzBjfVCUuL9npv0BHZQ+ii0g2S8z9syjpvX17+YNOYLu30vkfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d43a92beb3e64350d0a3a995d37e11f7d0bd485bbfc475f598177850720ba63","last_reissued_at":"2026-07-05T04:18:59.256681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:59.256681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Strong Chromatic Index of Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidicky, Derrick Stolee, Eric Sullivan, Jennifer Diemunsch, Luke L. Nelsen, Michael Ferrara, Nathan Graber, Philip DeOrsey, Sogol Jahanbekam, Stephen G. Hartke","submitted_at":"2015-08-14T14:36:15Z","abstract_excerpt":"The strong chromatic index of a graph $G$, denoted $\\chi_s'(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted $\\chi_{s,\\ell}'(G)$, is the least integer $k$ such that if arbitrary lists of size $k$ are assigned to each edge then $G$ can be edge-colored from those lists where edges at distance at most two receive distinct colors. We use the discharging method, the Combinatorial Nullstellensatz, and computation to show that if $G$ is a subcubic planar graph with $\\operatorname{girth}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03515","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1508.03515/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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.03515","created_at":"2026-07-05T04:18:59.256737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03515v1","created_at":"2026-07-05T04:18:59.256737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03515","created_at":"2026-07-05T04:18:59.256737+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVB2SK7LHZSD","created_at":"2026-07-05T04:18:59.256737+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVB2SK7LHZSDKDIK","created_at":"2026-07-05T04:18:59.256737+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVB2SK7L","created_at":"2026-07-05T04:18:59.256737+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/LVB2SK7LHZSDKDIKHKMV2N7BD5","json":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5.json","graph_json":"https://pith.science/api/pith-number/LVB2SK7LHZSDKDIKHKMV2N7BD5/graph.json","events_json":"https://pith.science/api/pith-number/LVB2SK7LHZSDKDIKHKMV2N7BD5/events.json","paper":"https://pith.science/paper/LVB2SK7L"},"agent_actions":{"view_html":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5","download_json":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5.json","view_paper":"https://pith.science/paper/LVB2SK7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03515&json=true","fetch_graph":"https://pith.science/api/pith-number/LVB2SK7LHZSDKDIKHKMV2N7BD5/graph.json","fetch_events":"https://pith.science/api/pith-number/LVB2SK7LHZSDKDIKHKMV2N7BD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5/action/storage_attestation","attest_author":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5/action/author_attestation","sign_citation":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5/action/citation_signature","submit_replication":"https://pith.science/pith/LVB2SK7LHZSDKDIKHKMV2N7BD5/action/replication_record"}},"created_at":"2026-07-05T04:18:59.256737+00:00","updated_at":"2026-07-05T04:18:59.256737+00:00"}