{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BU3SIQ3SXMEZO2PN4RQZFKK6HA","short_pith_number":"pith:BU3SIQ3S","schema_version":"1.0","canonical_sha256":"0d37244372bb099769ede46192a95e380fd7a111cc6d6d056e6a2ca77e954e96","source":{"kind":"arxiv","id":"1508.02851","version":1},"attestation_state":"computed","paper":{"title":"On interval edge-colorings of bipartite graphs of small order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hrant Khachatrian, Tigran Mamikonyan","submitted_at":"2015-08-12T08:48:24Z","abstract_excerpt":"An edge-coloring of a graph $G$ with colors $1,\\ldots,t$ is an interval $t$-coloring if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval colorable if it has an interval $t$-coloring for some positive integer $t$. The problem of deciding whether a bipartite graph is interval colorable is NP-complete. The smallest known examples of interval non-colorable bipartite graphs have $19$ vertices. On the other hand it is known that the bipartite graphs on at most $14$ vertices are interval colorable. In th"},"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":"1508.02851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-12T08:48:24Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e59cbf1340ad48af4d2a70be45ce157fb538ea30912c2f6203998b87d0bc39fb","abstract_canon_sha256":"2837341161a78388f6e1a550ba4cc249e3c83a0406a5324ff358b3c31bee778c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:59.775339Z","signature_b64":"4Q+t84TdArUdYy7XSy4osYLUkzCRTEKrI2jOV78dOhT/xTnZU8uAUCCh+SRuroZjHmIt/tTyPP5JnnAXSuJ8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d37244372bb099769ede46192a95e380fd7a111cc6d6d056e6a2ca77e954e96","last_reissued_at":"2026-05-18T01:17:59.774703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:59.774703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On interval edge-colorings of bipartite graphs of small order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hrant Khachatrian, Tigran Mamikonyan","submitted_at":"2015-08-12T08:48:24Z","abstract_excerpt":"An edge-coloring of a graph $G$ with colors $1,\\ldots,t$ is an interval $t$-coloring if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval colorable if it has an interval $t$-coloring for some positive integer $t$. The problem of deciding whether a bipartite graph is interval colorable is NP-complete. The smallest known examples of interval non-colorable bipartite graphs have $19$ vertices. On the other hand it is known that the bipartite graphs on at most $14$ vertices are interval colorable. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02851","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":"1508.02851","created_at":"2026-05-18T01:17:59.774820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02851v1","created_at":"2026-05-18T01:17:59.774820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02851","created_at":"2026-05-18T01:17:59.774820+00:00"},{"alias_kind":"pith_short_12","alias_value":"BU3SIQ3SXMEZ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BU3SIQ3SXMEZO2PN","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BU3SIQ3S","created_at":"2026-05-18T12:29:14.074870+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/BU3SIQ3SXMEZO2PN4RQZFKK6HA","json":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA.json","graph_json":"https://pith.science/api/pith-number/BU3SIQ3SXMEZO2PN4RQZFKK6HA/graph.json","events_json":"https://pith.science/api/pith-number/BU3SIQ3SXMEZO2PN4RQZFKK6HA/events.json","paper":"https://pith.science/paper/BU3SIQ3S"},"agent_actions":{"view_html":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA","download_json":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA.json","view_paper":"https://pith.science/paper/BU3SIQ3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02851&json=true","fetch_graph":"https://pith.science/api/pith-number/BU3SIQ3SXMEZO2PN4RQZFKK6HA/graph.json","fetch_events":"https://pith.science/api/pith-number/BU3SIQ3SXMEZO2PN4RQZFKK6HA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/action/storage_attestation","attest_author":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/action/author_attestation","sign_citation":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/action/citation_signature","submit_replication":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/action/replication_record"}},"created_at":"2026-05-18T01:17:59.774820+00:00","updated_at":"2026-05-18T01:17:59.774820+00:00"}