{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DROKNJ4BYIKUIJ3AJT4A3N3UM7","short_pith_number":"pith:DROKNJ4B","canonical_record":{"source":{"id":"1305.6866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T16:53:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5437ada48306057182d0d38931beb539095cc78aa2c5b68b668e7fd8047fe9f1","abstract_canon_sha256":"d45dcf911152eb45e65d42362d74d032531caa6c6e589e0fed06bfcff1a24883"},"schema_version":"1.0"},"canonical_sha256":"1c5ca6a781c2154427604cf80db77467d02ab266c3be5bf67d3bae118f328643","source":{"kind":"arxiv","id":"1305.6866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6866","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6866v1","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6866","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"DROKNJ4BYIKU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DROKNJ4BYIKUIJ3A","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DROKNJ4B","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DROKNJ4BYIKUIJ3AJT4A3N3UM7","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T16:53:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5437ada48306057182d0d38931beb539095cc78aa2c5b68b668e7fd8047fe9f1","abstract_canon_sha256":"d45dcf911152eb45e65d42362d74d032531caa6c6e589e0fed06bfcff1a24883"},"schema_version":"1.0"},"canonical_sha256":"1c5ca6a781c2154427604cf80db77467d02ab266c3be5bf67d3bae118f328643","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:17.749886Z","signature_b64":"pRJGydFlxaJS7B9r1RwTX2x5kHSOuROTeqR9ebn39hGB5ftsOw5n7ZWXUqOLSps+tJi/V7NWAJcOSQcdBLSrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c5ca6a781c2154427604cf80db77467d02ab266c3be5bf67d3bae118f328643","last_reissued_at":"2026-05-18T03:22:17.749484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:17.749484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6866","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-18T03:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOW7cWJ/pYTaqnhNKZ5dWajaenDk9OqvNoF1jau/mSbTGezE59qzrgKmZeLLWCXsqoV7XL+tDYmDBCKmgfvJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:47.192933Z"},"content_sha256":"1c443834f3ebcbf42ea926062491dd0e4770b5b14092f98c7e9e3a992b5dd720","schema_version":"1.0","event_id":"sha256:1c443834f3ebcbf42ea926062491dd0e4770b5b14092f98c7e9e3a992b5dd720"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DROKNJ4BYIKUIJ3AJT4A3N3UM7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Examples of cyclically-interval non-colorable bipartite graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"R.R. Kamalian","submitted_at":"2013-05-29T16:53:38Z","abstract_excerpt":"For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\\varphi:E(G)\\rightarrow\\{1,2,\\ldots,t\\}$ is called a proper edge $t$-coloring of a graph $G$ if adjacent edges are colored differently and each of $t$ colors is used. An arbitrary nonempty subset of consecutive integers is called an interval. If $\\varphi$ is a proper edge $t$-coloring of a graph $G$ and $x\\in V(G)$, then $S_G(x,\\varphi)$ denotes the set of colors of edges of $G$ which are incident with $x$. A proper edge $t$-coloring $\\varphi$ of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6866","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-18T03:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDDKS6M/g9DRLzfqSn+ymLqGwn23z7FJTEJPZWlimViLQjJMuUyicGoAjimeT6Pe3t7HsM3O/31CTTafzdSZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:47.193573Z"},"content_sha256":"06c7386652c24de8c25c557ef546c21be024d3be402f8d1506a22d3a28715a9d","schema_version":"1.0","event_id":"sha256:06c7386652c24de8c25c557ef546c21be024d3be402f8d1506a22d3a28715a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DROKNJ4BYIKUIJ3AJT4A3N3UM7/bundle.json","state_url":"https://pith.science/pith/DROKNJ4BYIKUIJ3AJT4A3N3UM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DROKNJ4BYIKUIJ3AJT4A3N3UM7/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-05-30T07:45:47Z","links":{"resolver":"https://pith.science/pith/DROKNJ4BYIKUIJ3AJT4A3N3UM7","bundle":"https://pith.science/pith/DROKNJ4BYIKUIJ3AJT4A3N3UM7/bundle.json","state":"https://pith.science/pith/DROKNJ4BYIKUIJ3AJT4A3N3UM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DROKNJ4BYIKUIJ3AJT4A3N3UM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DROKNJ4BYIKUIJ3AJT4A3N3UM7","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":"d45dcf911152eb45e65d42362d74d032531caa6c6e589e0fed06bfcff1a24883","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T16:53:38Z","title_canon_sha256":"5437ada48306057182d0d38931beb539095cc78aa2c5b68b668e7fd8047fe9f1"},"schema_version":"1.0","source":{"id":"1305.6866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6866","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6866v1","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6866","created_at":"2026-05-18T03:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"DROKNJ4BYIKU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DROKNJ4BYIKUIJ3A","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DROKNJ4B","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:06c7386652c24de8c25c557ef546c21be024d3be402f8d1506a22d3a28715a9d","target":"graph","created_at":"2026-05-18T03:22:17Z","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":"For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\\varphi:E(G)\\rightarrow\\{1,2,\\ldots,t\\}$ is called a proper edge $t$-coloring of a graph $G$ if adjacent edges are colored differently and each of $t$ colors is used. An arbitrary nonempty subset of consecutive integers is called an interval. If $\\varphi$ is a proper edge $t$-coloring of a graph $G$ and $x\\in V(G)$, then $S_G(x,\\varphi)$ denotes the set of colors of edges of $G$ which are incident with $x$. A proper edge $t$-coloring $\\varphi$ of ","authors_text":"R.R. Kamalian","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T16:53:38Z","title":"Examples of cyclically-interval non-colorable bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6866","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:1c443834f3ebcbf42ea926062491dd0e4770b5b14092f98c7e9e3a992b5dd720","target":"record","created_at":"2026-05-18T03:22:17Z","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":"d45dcf911152eb45e65d42362d74d032531caa6c6e589e0fed06bfcff1a24883","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-29T16:53:38Z","title_canon_sha256":"5437ada48306057182d0d38931beb539095cc78aa2c5b68b668e7fd8047fe9f1"},"schema_version":"1.0","source":{"id":"1305.6866","kind":"arxiv","version":1}},"canonical_sha256":"1c5ca6a781c2154427604cf80db77467d02ab266c3be5bf67d3bae118f328643","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c5ca6a781c2154427604cf80db77467d02ab266c3be5bf67d3bae118f328643","first_computed_at":"2026-05-18T03:22:17.749484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:17.749484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pRJGydFlxaJS7B9r1RwTX2x5kHSOuROTeqR9ebn39hGB5ftsOw5n7ZWXUqOLSps+tJi/V7NWAJcOSQcdBLSrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:17.749886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c443834f3ebcbf42ea926062491dd0e4770b5b14092f98c7e9e3a992b5dd720","sha256:06c7386652c24de8c25c557ef546c21be024d3be402f8d1506a22d3a28715a9d"],"state_sha256":"2dd5bfcb06f5de215036851f2854a9cd894a11ea627bcee7616801b1ff472487"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRvg2DLlPyLM273M9lQc/6Y6gFHEgtkJpNP0nLPCEZiYll+vaQNKq52Mx1k2BgMvhPm6POsrezXh63R6sDE+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:45:47.196186Z","bundle_sha256":"5fc5c51a2e484a3acfa933f30953c3ad70aa7741c96d9ac60ee9701155312f11"}}