{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LVB2SK7LHZSDKDIKHKMV2N7BD5","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":"49667cde36ee7ba830daee26546c506d74c6732921daebbd5ffadd78cd14a792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-14T14:36:15Z","title_canon_sha256":"9826add717f0690cff3ebb4ca75b3e8aa77e09982adb57ee38a20063274a9c84"},"schema_version":"1.0","source":{"id":"1508.03515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03515","created_at":"2026-07-05T04:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03515v1","created_at":"2026-07-05T04:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03515","created_at":"2026-07-05T04:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"LVB2SK7LHZSD","created_at":"2026-07-05T04:18:59Z"},{"alias_kind":"pith_short_16","alias_value":"LVB2SK7LHZSDKDIK","created_at":"2026-07-05T04:18:59Z"},{"alias_kind":"pith_short_8","alias_value":"LVB2SK7L","created_at":"2026-07-05T04:18:59Z"}],"graph_snapshots":[{"event_id":"sha256:1197102d33ec1d9420bc8f98e9068280ba699b3040fcb42d46fb8221874d2df4","target":"graph","created_at":"2026-07-05T04:18:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1508.03515/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}(","authors_text":"Bernard Lidicky, Derrick Stolee, Eric Sullivan, Jennifer Diemunsch, Luke L. Nelsen, Michael Ferrara, Nathan Graber, Philip DeOrsey, Sogol Jahanbekam, Stephen G. Hartke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-14T14:36:15Z","title":"On the Strong Chromatic Index of Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03515","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:c8606ee52d1cb2af12e28db4308af479a53b08b35065ae57257ddb09bfd6ba61","target":"record","created_at":"2026-07-05T04:18:59Z","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":"49667cde36ee7ba830daee26546c506d74c6732921daebbd5ffadd78cd14a792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-14T14:36:15Z","title_canon_sha256":"9826add717f0690cff3ebb4ca75b3e8aa77e09982adb57ee38a20063274a9c84"},"schema_version":"1.0","source":{"id":"1508.03515","kind":"arxiv","version":1}},"canonical_sha256":"5d43a92beb3e64350d0a3a995d37e11f7d0bd485bbfc475f598177850720ba63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d43a92beb3e64350d0a3a995d37e11f7d0bd485bbfc475f598177850720ba63","first_computed_at":"2026-07-05T04:18:59.256681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:18:59.256681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZOnO2DDms9IQMNB27k3w27ssPTzcOWNGbISpzBjfVCUuL9npv0BHZQ+ii0g2S8z9syjpvX17+YNOYLu30vkfAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:18:59.257047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8606ee52d1cb2af12e28db4308af479a53b08b35065ae57257ddb09bfd6ba61","sha256:1197102d33ec1d9420bc8f98e9068280ba699b3040fcb42d46fb8221874d2df4"],"state_sha256":"258a46e34828da2bffe43bd4195632579b82e58671b74a004f49b337868eeb73"}