{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5MMH5OHSCX7L22PLW734XF6ZWR","short_pith_number":"pith:5MMH5OHS","schema_version":"1.0","canonical_sha256":"eb187eb8f215febd69ebb7f7cb97d9b452f2fc377ef2c642a94270935c58dde6","source":{"kind":"arxiv","id":"2310.12552","version":2},"attestation_state":"computed","paper":{"title":"Semistrong edge coloring and $(0,1)$-relaxed strong edge coloring of graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wensong Lin, Yuquan Lin","submitted_at":"2023-10-19T08:00:32Z","abstract_excerpt":"In this work, we study two relaxations of the well-known strong edge coloring.\n  A semistrong edge coloring of a graph G is an edge coloring in which every color class forms a matching M such that every edge of M is incident with at least one vertex of degree 1 in the subgraph of G induced by the vertices covered by M.\n  For any two nonnegative integers s and t, an (s,t)-relaxed strong edge coloring of G is an edge coloring in which, for every edge e of G, at most s edges at distance 1 and at most t edges at distance 2 from e receive the same color as e. The corresponding chromatic indices are"},"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":"2310.12552","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-19T08:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"c37e19f7a4e08776bc6c77be791638331111ab98292fabc630e9e006079cc068","abstract_canon_sha256":"2a3627c30fe832931f79f34ca46a16c7c816c511b6aab38b3100b9305de4f442"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T00:06:42.759728Z","signature_b64":"EovivM+SmDZ/HT2AxcjzCv0mF9IKVK4jNQJ3xrWM4jITAgy0pF9QNCUvFC48WgQTJbf2kGqANnmPHMIpFqWEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb187eb8f215febd69ebb7f7cb97d9b452f2fc377ef2c642a94270935c58dde6","last_reissued_at":"2026-06-04T00:06:42.758185Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T00:06:42.758185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semistrong edge coloring and $(0,1)$-relaxed strong edge coloring of graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wensong Lin, Yuquan Lin","submitted_at":"2023-10-19T08:00:32Z","abstract_excerpt":"In this work, we study two relaxations of the well-known strong edge coloring.\n  A semistrong edge coloring of a graph G is an edge coloring in which every color class forms a matching M such that every edge of M is incident with at least one vertex of degree 1 in the subgraph of G induced by the vertices covered by M.\n  For any two nonnegative integers s and t, an (s,t)-relaxed strong edge coloring of G is an edge coloring in which, for every edge e of G, at most s edges at distance 1 and at most t edges at distance 2 from e receive the same color as e. The corresponding chromatic indices are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12552","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.12552/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":"2310.12552","created_at":"2026-06-04T00:06:42.758241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.12552v2","created_at":"2026-06-04T00:06:42.758241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12552","created_at":"2026-06-04T00:06:42.758241+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MMH5OHSCX7L","created_at":"2026-06-04T00:06:42.758241+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MMH5OHSCX7L22PL","created_at":"2026-06-04T00:06:42.758241+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MMH5OHS","created_at":"2026-06-04T00:06:42.758241+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/5MMH5OHSCX7L22PLW734XF6ZWR","json":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR.json","graph_json":"https://pith.science/api/pith-number/5MMH5OHSCX7L22PLW734XF6ZWR/graph.json","events_json":"https://pith.science/api/pith-number/5MMH5OHSCX7L22PLW734XF6ZWR/events.json","paper":"https://pith.science/paper/5MMH5OHS"},"agent_actions":{"view_html":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR","download_json":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR.json","view_paper":"https://pith.science/paper/5MMH5OHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.12552&json=true","fetch_graph":"https://pith.science/api/pith-number/5MMH5OHSCX7L22PLW734XF6ZWR/graph.json","fetch_events":"https://pith.science/api/pith-number/5MMH5OHSCX7L22PLW734XF6ZWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR/action/storage_attestation","attest_author":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR/action/author_attestation","sign_citation":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR/action/citation_signature","submit_replication":"https://pith.science/pith/5MMH5OHSCX7L22PLW734XF6ZWR/action/replication_record"}},"created_at":"2026-06-04T00:06:42.758241+00:00","updated_at":"2026-06-04T00:06:42.758241+00:00"}