{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FIATGKORRPQUXCZUHQ7ZEQUR6R","short_pith_number":"pith:FIATGKOR","canonical_record":{"source":{"id":"1211.5311","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T15:33:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"326997d7a9c461aab70a552332118499d011f5eba6a65dc6e7c46f48df457e73","abstract_canon_sha256":"1715294135e173c8411034249b6cda5cbeff2b43a858a914521a2cc77a7f8f2b"},"schema_version":"1.0"},"canonical_sha256":"2a013329d18be14b8b343c3f924291f467efa1fff0d3a8cbe81a12570fb901ab","source":{"kind":"arxiv","id":"1211.5311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5311","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5311v1","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5311","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"FIATGKORRPQU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FIATGKORRPQUXCZU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FIATGKOR","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FIATGKORRPQUXCZUHQ7ZEQUR6R","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5311","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T15:33:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"326997d7a9c461aab70a552332118499d011f5eba6a65dc6e7c46f48df457e73","abstract_canon_sha256":"1715294135e173c8411034249b6cda5cbeff2b43a858a914521a2cc77a7f8f2b"},"schema_version":"1.0"},"canonical_sha256":"2a013329d18be14b8b343c3f924291f467efa1fff0d3a8cbe81a12570fb901ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:04.743151Z","signature_b64":"naF8I5d3wN35B0+J8YrT6H4Wrzb+kSCRatnqZOl1aOgfd6IjoRSfPh9CptnkzTdC9wW8tGk5fOnDEfqIWwlnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a013329d18be14b8b343c3f924291f467efa1fff0d3a8cbe81a12570fb901ab","last_reissued_at":"2026-05-18T03:40:04.742028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:04.742028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5311","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:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjCSZJrxMKgcDnrXSa/0eI3rG/UStlB8nYLWpZ3ElKQAF80YZO/t2TPkGlzPFgyDK5D4DFpD07aFa3vigkStBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:41:18.322813Z"},"content_sha256":"61f2a98ee8046a6433aae27d10167ec7fce4ef4f4beb25061d727c5d911bafa3","schema_version":"1.0","event_id":"sha256:61f2a98ee8046a6433aae27d10167ec7fce4ef4f4beb25061d727c5d911bafa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FIATGKORRPQUXCZUHQ7ZEQUR6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval colorings of complete balanced multipartite graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Petros A. Petrosyan","submitted_at":"2012-11-22T15:33:36Z","abstract_excerpt":"A graph $G$ is called a complete $k$-partite ($k\\geq 2$) graph if its vertices can be partitioned into $k$ independent sets $V_{1},...,V_{k}$ such that each vertex in $V_{i}$ is adjacent to all the other vertices in $V_{j}$ for $1\\leq i<j\\leq k$. A complete $k$-partite graph $G$ is a complete balanced $k$-partite graph if $|V_{1}| = |V_{2}| =... = |V_{k}|$. An edge-coloring of a graph $G$ with colors $1,...,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 colorabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5311","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:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FsiiuqOsD8M47Ye52jq7oHCLcNkQrU8wzzRi+AcoeMjfIK0dYJp3UfX4v6UT20Ma8Xt9m9xtqz10ZQSnUNfNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:41:18.323156Z"},"content_sha256":"70566dbbf412b74588e07ba5d7ebf07d9f6916db7a9f8126c34c12912f4dc2b2","schema_version":"1.0","event_id":"sha256:70566dbbf412b74588e07ba5d7ebf07d9f6916db7a9f8126c34c12912f4dc2b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIATGKORRPQUXCZUHQ7ZEQUR6R/bundle.json","state_url":"https://pith.science/pith/FIATGKORRPQUXCZUHQ7ZEQUR6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIATGKORRPQUXCZUHQ7ZEQUR6R/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-06-26T13:41:18Z","links":{"resolver":"https://pith.science/pith/FIATGKORRPQUXCZUHQ7ZEQUR6R","bundle":"https://pith.science/pith/FIATGKORRPQUXCZUHQ7ZEQUR6R/bundle.json","state":"https://pith.science/pith/FIATGKORRPQUXCZUHQ7ZEQUR6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIATGKORRPQUXCZUHQ7ZEQUR6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FIATGKORRPQUXCZUHQ7ZEQUR6R","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":"1715294135e173c8411034249b6cda5cbeff2b43a858a914521a2cc77a7f8f2b","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T15:33:36Z","title_canon_sha256":"326997d7a9c461aab70a552332118499d011f5eba6a65dc6e7c46f48df457e73"},"schema_version":"1.0","source":{"id":"1211.5311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5311","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5311v1","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5311","created_at":"2026-05-18T03:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"FIATGKORRPQU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FIATGKORRPQUXCZU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FIATGKOR","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:70566dbbf412b74588e07ba5d7ebf07d9f6916db7a9f8126c34c12912f4dc2b2","target":"graph","created_at":"2026-05-18T03:40:04Z","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":"A graph $G$ is called a complete $k$-partite ($k\\geq 2$) graph if its vertices can be partitioned into $k$ independent sets $V_{1},...,V_{k}$ such that each vertex in $V_{i}$ is adjacent to all the other vertices in $V_{j}$ for $1\\leq i<j\\leq k$. A complete $k$-partite graph $G$ is a complete balanced $k$-partite graph if $|V_{1}| = |V_{2}| =... = |V_{k}|$. An edge-coloring of a graph $G$ with colors $1,...,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 colorabl","authors_text":"Petros A. Petrosyan","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T15:33:36Z","title":"Interval colorings of complete balanced multipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5311","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:61f2a98ee8046a6433aae27d10167ec7fce4ef4f4beb25061d727c5d911bafa3","target":"record","created_at":"2026-05-18T03:40:04Z","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":"1715294135e173c8411034249b6cda5cbeff2b43a858a914521a2cc77a7f8f2b","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-11-22T15:33:36Z","title_canon_sha256":"326997d7a9c461aab70a552332118499d011f5eba6a65dc6e7c46f48df457e73"},"schema_version":"1.0","source":{"id":"1211.5311","kind":"arxiv","version":1}},"canonical_sha256":"2a013329d18be14b8b343c3f924291f467efa1fff0d3a8cbe81a12570fb901ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a013329d18be14b8b343c3f924291f467efa1fff0d3a8cbe81a12570fb901ab","first_computed_at":"2026-05-18T03:40:04.742028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:04.742028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"naF8I5d3wN35B0+J8YrT6H4Wrzb+kSCRatnqZOl1aOgfd6IjoRSfPh9CptnkzTdC9wW8tGk5fOnDEfqIWwlnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:04.743151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61f2a98ee8046a6433aae27d10167ec7fce4ef4f4beb25061d727c5d911bafa3","sha256:70566dbbf412b74588e07ba5d7ebf07d9f6916db7a9f8126c34c12912f4dc2b2"],"state_sha256":"0a2912054e209e7158b7deb3545fb3573a44ab1463da34c141804e918d09b2a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGemWZqoFf38x/hXB3fW2+xt8Q83tzV305Aq6bbqr6Rhpm2M65DWEeD9xIR4Saw9G0qZBNOWP3bzPh89OewODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:41:18.325160Z","bundle_sha256":"fde5c777e32b280b15611437c22fe7582294fabe039a723a4ecb73c0d070264d"}}