{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BU3SIQ3SXMEZO2PN4RQZFKK6HA","short_pith_number":"pith:BU3SIQ3S","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"},"canonical_sha256":"0d37244372bb099769ede46192a95e380fd7a111cc6d6d056e6a2ca77e954e96","source":{"kind":"arxiv","id":"1508.02851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02851","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02851v1","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02851","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"BU3SIQ3SXMEZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BU3SIQ3SXMEZO2PN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BU3SIQ3S","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BU3SIQ3SXMEZO2PN4RQZFKK6HA","target":"record","payload":{"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"},"canonical_sha256":"0d37244372bb099769ede46192a95e380fd7a111cc6d6d056e6a2ca77e954e96","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"},"source_kind":"arxiv","source_id":"1508.02851","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUvmEHQCBDc3Cb11Vjecz/MIul2j6hvFJaaO79Z+xf6eDsfuzeyMN+XU0ZAgQMqQyAz2Pp7GVWanKfXCCblJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:29:23.308753Z"},"content_sha256":"2f9f6a52aeacab411ac980e6f1ddf7df57001e26ec66416c456aab671703f95b","schema_version":"1.0","event_id":"sha256:2f9f6a52aeacab411ac980e6f1ddf7df57001e26ec66416c456aab671703f95b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BU3SIQ3SXMEZO2PN4RQZFKK6HA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nn4SmhQk6m6Ywvu0kuSW5Z18srqh0YBiRkx/LptOqOQrSG7LezZNOwrGmToypVFKFpgUqDjSwO7NCQksq9qeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:29:23.309102Z"},"content_sha256":"3eea7d3c461e85d547b4d15d2c2987615b8c63cba7f4abd9ba6a697d6ca70e51","schema_version":"1.0","event_id":"sha256:3eea7d3c461e85d547b4d15d2c2987615b8c63cba7f4abd9ba6a697d6ca70e51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/bundle.json","state_url":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T23:29:23Z","links":{"resolver":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA","bundle":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/bundle.json","state":"https://pith.science/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BU3SIQ3SXMEZO2PN4RQZFKK6HA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BU3SIQ3SXMEZO2PN4RQZFKK6HA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2837341161a78388f6e1a550ba4cc249e3c83a0406a5324ff358b3c31bee778c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-12T08:48:24Z","title_canon_sha256":"e59cbf1340ad48af4d2a70be45ce157fb538ea30912c2f6203998b87d0bc39fb"},"schema_version":"1.0","source":{"id":"1508.02851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02851","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02851v1","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02851","created_at":"2026-05-18T01:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"BU3SIQ3SXMEZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BU3SIQ3SXMEZO2PN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BU3SIQ3S","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:3eea7d3c461e85d547b4d15d2c2987615b8c63cba7f4abd9ba6a697d6ca70e51","target":"graph","created_at":"2026-05-18T01:17:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hrant Khachatrian, Tigran Mamikonyan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-12T08:48:24Z","title":"On interval edge-colorings of bipartite graphs of small order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02851","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2f9f6a52aeacab411ac980e6f1ddf7df57001e26ec66416c456aab671703f95b","target":"record","created_at":"2026-05-18T01:17:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2837341161a78388f6e1a550ba4cc249e3c83a0406a5324ff358b3c31bee778c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-12T08:48:24Z","title_canon_sha256":"e59cbf1340ad48af4d2a70be45ce157fb538ea30912c2f6203998b87d0bc39fb"},"schema_version":"1.0","source":{"id":"1508.02851","kind":"arxiv","version":1}},"canonical_sha256":"0d37244372bb099769ede46192a95e380fd7a111cc6d6d056e6a2ca77e954e96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d37244372bb099769ede46192a95e380fd7a111cc6d6d056e6a2ca77e954e96","first_computed_at":"2026-05-18T01:17:59.774703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:59.774703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Q+t84TdArUdYy7XSy4osYLUkzCRTEKrI2jOV78dOhT/xTnZU8uAUCCh+SRuroZjHmIt/tTyPP5JnnAXSuJ8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:59.775339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f9f6a52aeacab411ac980e6f1ddf7df57001e26ec66416c456aab671703f95b","sha256:3eea7d3c461e85d547b4d15d2c2987615b8c63cba7f4abd9ba6a697d6ca70e51"],"state_sha256":"7289befeb865120490eb32cbd6c753911d77f6a02028e1182114e18ab6c6964b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnt2LXsmDc2Un0pzNC5pSdI27d+O2Ya0FnvVVWv6f4ty1ANqQs4NhlpqUHPBNQ5y4IMHRKhYL9epjFSjZvtIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:29:23.311341Z","bundle_sha256":"0dddcf64f5c82a4534ffd3e5369f5ff03248936c514209c29301afe419c490c4"}}