{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5MZQINH3YQ32ZS725GTKC3J22N","short_pith_number":"pith:5MZQINH3","canonical_record":{"source":{"id":"1703.03304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-09T15:46:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b791ef4fc1b30a34d671c9e6df75860bbffa18abc90459e707c45552d809cbc3","abstract_canon_sha256":"65bd2c35af48366520583899846e580b9176ab371429ca45990d7af6db225bb5"},"schema_version":"1.0"},"canonical_sha256":"eb330434fbc437accbfae9a6a16d3ad34c20fa60066ec2f97c56d4dc28707eb8","source":{"kind":"arxiv","id":"1703.03304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03304","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03304v2","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03304","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"5MZQINH3YQ32","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5MZQINH3YQ32ZS72","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5MZQINH3","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5MZQINH3YQ32ZS725GTKC3J22N","target":"record","payload":{"canonical_record":{"source":{"id":"1703.03304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-09T15:46:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b791ef4fc1b30a34d671c9e6df75860bbffa18abc90459e707c45552d809cbc3","abstract_canon_sha256":"65bd2c35af48366520583899846e580b9176ab371429ca45990d7af6db225bb5"},"schema_version":"1.0"},"canonical_sha256":"eb330434fbc437accbfae9a6a16d3ad34c20fa60066ec2f97c56d4dc28707eb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:32.638971Z","signature_b64":"RanNarIoyCgKqykAoveiS9/atQirs8HBUlfAp7WboenS/BrmPn61tHMvvpHx7wjWq2LMPt3Q+pHhju+qANMIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb330434fbc437accbfae9a6a16d3ad34c20fa60066ec2f97c56d4dc28707eb8","last_reissued_at":"2026-05-17T23:39:32.638280Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:32.638280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.03304","source_version":2,"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-17T23:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErPRm1tM29Xt5r4fb9rvnvosbPxhffomylnlgGuBVntW1JsxUOkUsQ357PlCzDjD+QTi6Om/QfP0z6qr5u7oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:54:18.002665Z"},"content_sha256":"fe461a22d3f666ce716ccbaaf5102b44bdd497ae2263bfe1c7953394e00a7c1f","schema_version":"1.0","event_id":"sha256:fe461a22d3f666ce716ccbaaf5102b44bdd497ae2263bfe1c7953394e00a7c1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5MZQINH3YQ32ZS725GTKC3J22N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On low rank-width colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Micha{\\l} Pilipczuk, O-joung Kwon, Sebastian Siebertz","submitted_at":"2017-03-09T15:46:25Z","abstract_excerpt":"We introduce the concept of low rank-width colorings, generalising the notion of low tree-depth colorings introduced by Ne\\v{s}et\\v{r}il and Ossona de Mendez in [Grad and classes with bounded expansion I. Decompositions. EJC, 2008]. We say that a class $\\mathcal{C}$ of graphs admits low rank-width colourings if there exist functions $N\\colon \\mathbb{N}\\rightarrow\\mathbb{N}$ and $Q\\colon \\mathbb{N}\\rightarrow\\mathbb{N}$ such that for all $p\\in \\mathbb{N}$, every graph $G\\in \\mathcal{C}$ can be vertex colored with at most $N(p)$ colors such that the union of any $i\\leq p$ color classes induces a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03304","kind":"arxiv","version":2},"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-17T23:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Om95uyNGZioDNXEBZy9k0DdCLkRNbt9FDV+P7Am2OJGy55SlJDhq+mldALlNB39bcEbTmwY3fYcY+OzS+462Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:54:18.003555Z"},"content_sha256":"1af00cdcbe560c783a9affbf47299c82368679770bd996f3492d407089ba4d94","schema_version":"1.0","event_id":"sha256:1af00cdcbe560c783a9affbf47299c82368679770bd996f3492d407089ba4d94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MZQINH3YQ32ZS725GTKC3J22N/bundle.json","state_url":"https://pith.science/pith/5MZQINH3YQ32ZS725GTKC3J22N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MZQINH3YQ32ZS725GTKC3J22N/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-30T15:54:18Z","links":{"resolver":"https://pith.science/pith/5MZQINH3YQ32ZS725GTKC3J22N","bundle":"https://pith.science/pith/5MZQINH3YQ32ZS725GTKC3J22N/bundle.json","state":"https://pith.science/pith/5MZQINH3YQ32ZS725GTKC3J22N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MZQINH3YQ32ZS725GTKC3J22N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5MZQINH3YQ32ZS725GTKC3J22N","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":"65bd2c35af48366520583899846e580b9176ab371429ca45990d7af6db225bb5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-09T15:46:25Z","title_canon_sha256":"b791ef4fc1b30a34d671c9e6df75860bbffa18abc90459e707c45552d809cbc3"},"schema_version":"1.0","source":{"id":"1703.03304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03304","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03304v2","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03304","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"5MZQINH3YQ32","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5MZQINH3YQ32ZS72","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5MZQINH3","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:1af00cdcbe560c783a9affbf47299c82368679770bd996f3492d407089ba4d94","target":"graph","created_at":"2026-05-17T23:39:32Z","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":"We introduce the concept of low rank-width colorings, generalising the notion of low tree-depth colorings introduced by Ne\\v{s}et\\v{r}il and Ossona de Mendez in [Grad and classes with bounded expansion I. Decompositions. EJC, 2008]. We say that a class $\\mathcal{C}$ of graphs admits low rank-width colourings if there exist functions $N\\colon \\mathbb{N}\\rightarrow\\mathbb{N}$ and $Q\\colon \\mathbb{N}\\rightarrow\\mathbb{N}$ such that for all $p\\in \\mathbb{N}$, every graph $G\\in \\mathcal{C}$ can be vertex colored with at most $N(p)$ colors such that the union of any $i\\leq p$ color classes induces a","authors_text":"Micha{\\l} Pilipczuk, O-joung Kwon, Sebastian Siebertz","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-09T15:46:25Z","title":"On low rank-width colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03304","kind":"arxiv","version":2},"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:fe461a22d3f666ce716ccbaaf5102b44bdd497ae2263bfe1c7953394e00a7c1f","target":"record","created_at":"2026-05-17T23:39:32Z","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":"65bd2c35af48366520583899846e580b9176ab371429ca45990d7af6db225bb5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-09T15:46:25Z","title_canon_sha256":"b791ef4fc1b30a34d671c9e6df75860bbffa18abc90459e707c45552d809cbc3"},"schema_version":"1.0","source":{"id":"1703.03304","kind":"arxiv","version":2}},"canonical_sha256":"eb330434fbc437accbfae9a6a16d3ad34c20fa60066ec2f97c56d4dc28707eb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb330434fbc437accbfae9a6a16d3ad34c20fa60066ec2f97c56d4dc28707eb8","first_computed_at":"2026-05-17T23:39:32.638280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:32.638280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RanNarIoyCgKqykAoveiS9/atQirs8HBUlfAp7WboenS/BrmPn61tHMvvpHx7wjWq2LMPt3Q+pHhju+qANMIDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:32.638971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe461a22d3f666ce716ccbaaf5102b44bdd497ae2263bfe1c7953394e00a7c1f","sha256:1af00cdcbe560c783a9affbf47299c82368679770bd996f3492d407089ba4d94"],"state_sha256":"87e18ab06c95b319762513d2164e3918bb14a8c9ac8b522a179f86bfec820308"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KYvUN46HJ9CLmYTUexNVa/bHavqHff05mE/2//gyIQYZd9G7lnubucHqCp7XcckPM8eGyJfqmOHFXw0k6bJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:54:18.007818Z","bundle_sha256":"483845b3c8a8362f39697737b02eac7ca5faaf2f9f05ce0526c58c403af222bd"}}