{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QLAZ2GL5B4NFNPSE6KEFDB7RWA","short_pith_number":"pith:QLAZ2GL5","schema_version":"1.0","canonical_sha256":"82c19d197d0f1a56be44f2885187f1b000c26227ce3214fe758e9068342e41e0","source":{"kind":"arxiv","id":"2312.14881","version":2},"attestation_state":"computed","paper":{"title":"On the interval coloring impropriety of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eun-Kyung Cho, Leilani Pai, MacKenzie Carr, Nicholas Crawford, Rebecca Robinson, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2023-12-22T18:01:01Z","abstract_excerpt":"An improper interval (edge) coloring of a graph $G$ is an assignment of colors to the edges of $G$ satisfying the condition that, for every vertex $v \\in V(G)$, the set of colors assigned to the edges incident with $v$ forms an integral interval. An interval coloring is $k$-improper if at most $k$ edges with the same color all share a common endpoint. The minimum integer $k$ such that there exists a $k$-improper interval coloring of the graph $G$ is the interval coloring impropriety of $G$, denoted by $\\mu_{int}(G)$. In this paper, we provide a construction of an interval coloring of a subclas"},"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":"2312.14881","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-22T18:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"dc464499cfece93e6846f5c1f219050108a8cf05f4a9314d09d53579410d11e9","abstract_canon_sha256":"bfb0a36f7eee0ecdfb8c0c0eb6c5372d39909f61aa156cde35508bf760e43ca0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:25:30.781605Z","signature_b64":"kPfoBUhCe/+RdYKvTQC/MDwPXwf0i4MFOOqKdLEV/hjwrGOIX1thCVYHzkDZkGPcUwF88OI+ba3IN5aY2oM7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82c19d197d0f1a56be44f2885187f1b000c26227ce3214fe758e9068342e41e0","last_reissued_at":"2026-07-05T08:25:30.781028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:25:30.781028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the interval coloring impropriety of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eun-Kyung Cho, Leilani Pai, MacKenzie Carr, Nicholas Crawford, Rebecca Robinson, Vesna Ir\\v{s}i\\v{c}","submitted_at":"2023-12-22T18:01:01Z","abstract_excerpt":"An improper interval (edge) coloring of a graph $G$ is an assignment of colors to the edges of $G$ satisfying the condition that, for every vertex $v \\in V(G)$, the set of colors assigned to the edges incident with $v$ forms an integral interval. An interval coloring is $k$-improper if at most $k$ edges with the same color all share a common endpoint. The minimum integer $k$ such that there exists a $k$-improper interval coloring of the graph $G$ is the interval coloring impropriety of $G$, denoted by $\\mu_{int}(G)$. In this paper, we provide a construction of an interval coloring of a subclas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14881","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/2312.14881/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":"2312.14881","created_at":"2026-07-05T08:25:30.781099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.14881v2","created_at":"2026-07-05T08:25:30.781099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14881","created_at":"2026-07-05T08:25:30.781099+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLAZ2GL5B4NF","created_at":"2026-07-05T08:25:30.781099+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLAZ2GL5B4NFNPSE","created_at":"2026-07-05T08:25:30.781099+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLAZ2GL5","created_at":"2026-07-05T08:25:30.781099+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/QLAZ2GL5B4NFNPSE6KEFDB7RWA","json":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA.json","graph_json":"https://pith.science/api/pith-number/QLAZ2GL5B4NFNPSE6KEFDB7RWA/graph.json","events_json":"https://pith.science/api/pith-number/QLAZ2GL5B4NFNPSE6KEFDB7RWA/events.json","paper":"https://pith.science/paper/QLAZ2GL5"},"agent_actions":{"view_html":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA","download_json":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA.json","view_paper":"https://pith.science/paper/QLAZ2GL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.14881&json=true","fetch_graph":"https://pith.science/api/pith-number/QLAZ2GL5B4NFNPSE6KEFDB7RWA/graph.json","fetch_events":"https://pith.science/api/pith-number/QLAZ2GL5B4NFNPSE6KEFDB7RWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA/action/storage_attestation","attest_author":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA/action/author_attestation","sign_citation":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA/action/citation_signature","submit_replication":"https://pith.science/pith/QLAZ2GL5B4NFNPSE6KEFDB7RWA/action/replication_record"}},"created_at":"2026-07-05T08:25:30.781099+00:00","updated_at":"2026-07-05T08:25:30.781099+00:00"}