{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XVLPAYTTTWVJIS7WL25YC55CJ7","short_pith_number":"pith:XVLPAYTT","canonical_record":{"source":{"id":"1107.3597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-18T23:39:59Z","cross_cats_sorted":[],"title_canon_sha256":"ff64cf52810482e16a4e90065eaf169a67c64b08a1606660ce570ba13a00cacf","abstract_canon_sha256":"f331ba096d85e1330117d55114f5973112e6dd5dc61cf4b6337124fde79ee184"},"schema_version":"1.0"},"canonical_sha256":"bd56f062739daa944bf65ebb8177a24fd510b9dfab926d87891bf66cfefb6039","source":{"kind":"arxiv","id":"1107.3597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3597","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3597v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3597","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"XVLPAYTTTWVJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XVLPAYTTTWVJIS7W","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XVLPAYTT","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XVLPAYTTTWVJIS7WL25YC55CJ7","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-18T23:39:59Z","cross_cats_sorted":[],"title_canon_sha256":"ff64cf52810482e16a4e90065eaf169a67c64b08a1606660ce570ba13a00cacf","abstract_canon_sha256":"f331ba096d85e1330117d55114f5973112e6dd5dc61cf4b6337124fde79ee184"},"schema_version":"1.0"},"canonical_sha256":"bd56f062739daa944bf65ebb8177a24fd510b9dfab926d87891bf66cfefb6039","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.688394Z","signature_b64":"c/k7jCHhray3phUgj0duuRg1mfTx0FAZy6EdtqLXC8rfWwDbQmcvEcJ+fTQard9F8kQGNwoDGeryXLloY9kpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd56f062739daa944bf65ebb8177a24fd510b9dfab926d87891bf66cfefb6039","last_reissued_at":"2026-05-18T01:11:00.687959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.687959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3597","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmedX1pM0pbqYgo+duUoCBH0lbJx0e+zTe0LYUTQS2evi+AosVMxxzhJeBuRqAZz9iqu7Q5uvNRApNJC1H6kBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:18:45.497797Z"},"content_sha256":"440eefacb03f35c8b8fd1751dd1c6b7f3cdc4683f441a32fc7d63c55a97193fb","schema_version":"1.0","event_id":"sha256:440eefacb03f35c8b8fd1751dd1c6b7f3cdc4683f441a32fc7d63c55a97193fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XVLPAYTTTWVJIS7WL25YC55CJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Krausz dimension and its generalizations in special graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olga Glebova, Pavel Skums, Yury Metelsky","submitted_at":"2011-07-18T23:39:59Z","abstract_excerpt":"A {\\it krausz $(k,m)$-partition} of a graph $G$ is the partition of $G$ into cliques, such that any vertex belongs to at most $k$ cliques and any two cliques have at most $m$ vertices in common. The {\\it $m$-krausz} dimension $kdim_m(G)$ of the graph $G$ is the minimum number $k$ such that $G$ has a krausz $(k,m)$-partition. 1-krausz dimension is known and studied krausz dimension of graph $kdim(G)$.\n  In this paper we prove, that the problem $\"kdim(G)\\leq 3\"$ is polynomially solvable for chordal graphs, thus partially solving the problem of P. Hlineny and J. Kratochvil. We show, that the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3597","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItgD4Nk8RH75caPJ2mvmlQCUEd0+0YyhZyueIshe22nDqv4tbBNPmrf/cOIzQiRzJQZuahkE2VmPIEJC76ljDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:18:45.498151Z"},"content_sha256":"5f7a50c6f2db5a2d54cdbf39993319a3e60a9afb902b1b757a6a6f416042f4e2","schema_version":"1.0","event_id":"sha256:5f7a50c6f2db5a2d54cdbf39993319a3e60a9afb902b1b757a6a6f416042f4e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVLPAYTTTWVJIS7WL25YC55CJ7/bundle.json","state_url":"https://pith.science/pith/XVLPAYTTTWVJIS7WL25YC55CJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVLPAYTTTWVJIS7WL25YC55CJ7/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-23T23:18:45Z","links":{"resolver":"https://pith.science/pith/XVLPAYTTTWVJIS7WL25YC55CJ7","bundle":"https://pith.science/pith/XVLPAYTTTWVJIS7WL25YC55CJ7/bundle.json","state":"https://pith.science/pith/XVLPAYTTTWVJIS7WL25YC55CJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVLPAYTTTWVJIS7WL25YC55CJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XVLPAYTTTWVJIS7WL25YC55CJ7","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":"f331ba096d85e1330117d55114f5973112e6dd5dc61cf4b6337124fde79ee184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-18T23:39:59Z","title_canon_sha256":"ff64cf52810482e16a4e90065eaf169a67c64b08a1606660ce570ba13a00cacf"},"schema_version":"1.0","source":{"id":"1107.3597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3597","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3597v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3597","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"XVLPAYTTTWVJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XVLPAYTTTWVJIS7W","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XVLPAYTT","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:5f7a50c6f2db5a2d54cdbf39993319a3e60a9afb902b1b757a6a6f416042f4e2","target":"graph","created_at":"2026-05-18T01:11:00Z","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 {\\it krausz $(k,m)$-partition} of a graph $G$ is the partition of $G$ into cliques, such that any vertex belongs to at most $k$ cliques and any two cliques have at most $m$ vertices in common. The {\\it $m$-krausz} dimension $kdim_m(G)$ of the graph $G$ is the minimum number $k$ such that $G$ has a krausz $(k,m)$-partition. 1-krausz dimension is known and studied krausz dimension of graph $kdim(G)$.\n  In this paper we prove, that the problem $\"kdim(G)\\leq 3\"$ is polynomially solvable for chordal graphs, thus partially solving the problem of P. Hlineny and J. Kratochvil. We show, that the prob","authors_text":"Olga Glebova, Pavel Skums, Yury Metelsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-18T23:39:59Z","title":"Krausz dimension and its generalizations in special graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3597","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:440eefacb03f35c8b8fd1751dd1c6b7f3cdc4683f441a32fc7d63c55a97193fb","target":"record","created_at":"2026-05-18T01:11:00Z","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":"f331ba096d85e1330117d55114f5973112e6dd5dc61cf4b6337124fde79ee184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-18T23:39:59Z","title_canon_sha256":"ff64cf52810482e16a4e90065eaf169a67c64b08a1606660ce570ba13a00cacf"},"schema_version":"1.0","source":{"id":"1107.3597","kind":"arxiv","version":1}},"canonical_sha256":"bd56f062739daa944bf65ebb8177a24fd510b9dfab926d87891bf66cfefb6039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd56f062739daa944bf65ebb8177a24fd510b9dfab926d87891bf66cfefb6039","first_computed_at":"2026-05-18T01:11:00.687959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.687959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c/k7jCHhray3phUgj0duuRg1mfTx0FAZy6EdtqLXC8rfWwDbQmcvEcJ+fTQard9F8kQGNwoDGeryXLloY9kpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.688394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:440eefacb03f35c8b8fd1751dd1c6b7f3cdc4683f441a32fc7d63c55a97193fb","sha256:5f7a50c6f2db5a2d54cdbf39993319a3e60a9afb902b1b757a6a6f416042f4e2"],"state_sha256":"0ee81d6fb668e2b40d6afcf0506e1ca46d02ead22c9b804f95d7f5b3ccf2646a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f98lm76PD35bDab+6NjXJws6dXZvOsvJSPcLTr0Q32oVJVrTwisRjIC/fUIVzcDDh8Kk37S/un4glxTPv0DaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:18:45.500114Z","bundle_sha256":"5b3076094cdba0a3a673b0e18fd65a2d75539a000115f9e9c29c004a06ea9cba"}}