{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:S7TYTQXECUKFIVDO2HZTVWHXHE","short_pith_number":"pith:S7TYTQXE","schema_version":"1.0","canonical_sha256":"97e789c2e4151454546ed1f33ad8f73908e960fcfb40caf807cd33dbb0b9863f","source":{"kind":"arxiv","id":"1408.2317","version":1},"attestation_state":"computed","paper":{"title":"Interval Total Colorings of Complete Multipartite Graphs and Hypercubes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Nerses A. Khachatryan, Petros A. Petrosyan","submitted_at":"2014-08-11T05:37:07Z","abstract_excerpt":"A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An interval total $t$-coloring of a graph $G$ is a total coloring of $G$ with colors $1,\\ldots,t$ such that all colors are used, and the edges incident to each vertex $v$ together with $v$ are colored by $d_{G}(v)+1$ consecutive colors, where $d_{G}(v)$ is the degree of a vertex $v$ in $G$. In this paper we prove that all complete multipartite graphs with the same number of vertices in each part are interval total colorable. Mo"},"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":"1408.2317","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-08-11T05:37:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"49feb7c4082df63669b63a2081f4cbd0ffad447d594f1119af4206cf99eaa072","abstract_canon_sha256":"8f815781522760dedd288792761377180784db91ddf632ce9282a0449dcf9c86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:29.714161Z","signature_b64":"wxP5TA0P54B7nQwylnbiRUfArwaLrziYpgrNZg8yHAwo3iqAzjwAVQPu8s2GIl4JGLdCk8uQZ50851Bh/jHMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e789c2e4151454546ed1f33ad8f73908e960fcfb40caf807cd33dbb0b9863f","last_reissued_at":"2026-05-18T02:45:29.713689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:29.713689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interval Total Colorings of Complete Multipartite Graphs and Hypercubes","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Nerses A. Khachatryan, Petros A. Petrosyan","submitted_at":"2014-08-11T05:37:07Z","abstract_excerpt":"A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An interval total $t$-coloring of a graph $G$ is a total coloring of $G$ with colors $1,\\ldots,t$ such that all colors are used, and the edges incident to each vertex $v$ together with $v$ are colored by $d_{G}(v)+1$ consecutive colors, where $d_{G}(v)$ is the degree of a vertex $v$ in $G$. In this paper we prove that all complete multipartite graphs with the same number of vertices in each part are interval total colorable. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2317","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":"1408.2317","created_at":"2026-05-18T02:45:29.713765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2317v1","created_at":"2026-05-18T02:45:29.713765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2317","created_at":"2026-05-18T02:45:29.713765+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7TYTQXECUKF","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7TYTQXECUKFIVDO","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7TYTQXE","created_at":"2026-05-18T12:28:49.207871+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/S7TYTQXECUKFIVDO2HZTVWHXHE","json":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE.json","graph_json":"https://pith.science/api/pith-number/S7TYTQXECUKFIVDO2HZTVWHXHE/graph.json","events_json":"https://pith.science/api/pith-number/S7TYTQXECUKFIVDO2HZTVWHXHE/events.json","paper":"https://pith.science/paper/S7TYTQXE"},"agent_actions":{"view_html":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE","download_json":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE.json","view_paper":"https://pith.science/paper/S7TYTQXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2317&json=true","fetch_graph":"https://pith.science/api/pith-number/S7TYTQXECUKFIVDO2HZTVWHXHE/graph.json","fetch_events":"https://pith.science/api/pith-number/S7TYTQXECUKFIVDO2HZTVWHXHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE/action/storage_attestation","attest_author":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE/action/author_attestation","sign_citation":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE/action/citation_signature","submit_replication":"https://pith.science/pith/S7TYTQXECUKFIVDO2HZTVWHXHE/action/replication_record"}},"created_at":"2026-05-18T02:45:29.713765+00:00","updated_at":"2026-05-18T02:45:29.713765+00:00"}