{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AC2OBOKG635YSVSK3IFBWFVVSD","short_pith_number":"pith:AC2OBOKG","schema_version":"1.0","canonical_sha256":"00b4e0b946f6fb89564ada0a1b16b590cef2f2cf3c2c9005ffa8c0d9f1f61a99","source":{"kind":"arxiv","id":"1301.3811","version":2},"attestation_state":"computed","paper":{"title":"Interval non-edge-colorable bipartite graphs and multigraphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hrant H. Khachatrian, Petros A. Petrosyan","submitted_at":"2013-01-16T20:11:07Z","abstract_excerpt":"An edge-coloring of a graph $G$ with colors $1,...,t$ is called an interval $t$-coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct and form an interval of integers. In 1991 Erd\\H{o}s constructed a bipartite graph with 27 vertices and maximum degree 13 which has no interval coloring. Erd\\H{o}s's counterexample is the smallest (in a sense of maximum degree) known bipartite graph which is not interval colorable. On the other hand, in 1992 Hansen showed that all bipartite graphs with maximum degree at most 3 have an interval coloring. In this paper "},"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":"1301.3811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-01-16T20:11:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6e4de66d3dd8f5d0c7316759ecde9889ed6f3bbb3f03c28d0e653f62937ac8d4","abstract_canon_sha256":"323885b41d299ee550522b0261132ad71c3eb8e65a6a09093ca25eb22f7b7a3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.946164Z","signature_b64":"ZOzaI6iP8EI/kvq6fKfC7jXBs/FkSCgAbrcigtOWnWgGbzcWdWr4mDUWSB1CbkLWn+SymxqKBlh3Uvu/fI8oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00b4e0b946f6fb89564ada0a1b16b590cef2f2cf3c2c9005ffa8c0d9f1f61a99","last_reissued_at":"2026-05-18T03:36:05.945480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.945480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interval non-edge-colorable bipartite graphs and multigraphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Hrant H. Khachatrian, Petros A. Petrosyan","submitted_at":"2013-01-16T20:11:07Z","abstract_excerpt":"An edge-coloring of a graph $G$ with colors $1,...,t$ is called an interval $t$-coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct and form an interval of integers. In 1991 Erd\\H{o}s constructed a bipartite graph with 27 vertices and maximum degree 13 which has no interval coloring. Erd\\H{o}s's counterexample is the smallest (in a sense of maximum degree) known bipartite graph which is not interval colorable. On the other hand, in 1992 Hansen showed that all bipartite graphs with maximum degree at most 3 have an interval coloring. In this paper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3811","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":""},"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":"1301.3811","created_at":"2026-05-18T03:36:05.945594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3811v2","created_at":"2026-05-18T03:36:05.945594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3811","created_at":"2026-05-18T03:36:05.945594+00:00"},{"alias_kind":"pith_short_12","alias_value":"AC2OBOKG635Y","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AC2OBOKG635YSVSK","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AC2OBOKG","created_at":"2026-05-18T12:27:38.830355+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/AC2OBOKG635YSVSK3IFBWFVVSD","json":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD.json","graph_json":"https://pith.science/api/pith-number/AC2OBOKG635YSVSK3IFBWFVVSD/graph.json","events_json":"https://pith.science/api/pith-number/AC2OBOKG635YSVSK3IFBWFVVSD/events.json","paper":"https://pith.science/paper/AC2OBOKG"},"agent_actions":{"view_html":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD","download_json":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD.json","view_paper":"https://pith.science/paper/AC2OBOKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3811&json=true","fetch_graph":"https://pith.science/api/pith-number/AC2OBOKG635YSVSK3IFBWFVVSD/graph.json","fetch_events":"https://pith.science/api/pith-number/AC2OBOKG635YSVSK3IFBWFVVSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD/action/storage_attestation","attest_author":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD/action/author_attestation","sign_citation":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD/action/citation_signature","submit_replication":"https://pith.science/pith/AC2OBOKG635YSVSK3IFBWFVVSD/action/replication_record"}},"created_at":"2026-05-18T03:36:05.945594+00:00","updated_at":"2026-05-18T03:36:05.945594+00:00"}