{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7PA7EHEZKR5ECL6ZG435PP2I6Z","short_pith_number":"pith:7PA7EHEZ","canonical_record":{"source":{"id":"1802.09665","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T01:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"ca80b5896397b63d43d6ba16ee217ad484e6e2940cfa0b22fd5add4206b10369","abstract_canon_sha256":"fa33364d5ea509f649623e1e3fb27fda99708b4f3852ae55706f63092b307ccb"},"schema_version":"1.0"},"canonical_sha256":"fbc1f21c99547a412fd93737d7bf48f678db927ba96d739a1df00a8ec7dbfe5a","source":{"kind":"arxiv","id":"1802.09665","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09665","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09665v4","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09665","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"7PA7EHEZKR5E","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7PA7EHEZKR5ECL6Z","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7PA7EHEZ","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7PA7EHEZKR5ECL6ZG435PP2I6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09665","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T01:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"ca80b5896397b63d43d6ba16ee217ad484e6e2940cfa0b22fd5add4206b10369","abstract_canon_sha256":"fa33364d5ea509f649623e1e3fb27fda99708b4f3852ae55706f63092b307ccb"},"schema_version":"1.0"},"canonical_sha256":"fbc1f21c99547a412fd93737d7bf48f678db927ba96d739a1df00a8ec7dbfe5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:52.614115Z","signature_b64":"NPSVnF/FgTlIWJSKrlk6vWyH4krrkNoZTNheONkkZTm0K18VeDTjRt4HhWcaBPTB2MvvztgLEbwJDLnNLXilDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbc1f21c99547a412fd93737d7bf48f678db927ba96d739a1df00a8ec7dbfe5a","last_reissued_at":"2026-05-18T00:09:52.613509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:52.613509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09665","source_version":4,"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-18T00:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fV5R15jnM8UquRyGPBbsYdYq5YSCjeSYZfcw/jvXWtWkd8+2PncO+5IVnGPY3ySOdNpIyF4PjhJZ0H4sSuKqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:47:28.670962Z"},"content_sha256":"b69f37a0b39b289e239c07de0fe8c81a1f43095d21ab8e786c6a08f66aab4a3a","schema_version":"1.0","event_id":"sha256:b69f37a0b39b289e239c07de0fe8c81a1f43095d21ab8e786c6a08f66aab4a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7PA7EHEZKR5ECL6ZG435PP2I6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Treedepth Bounds in Linear Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Blair D. Sullivan, Jeremy Kun, Marcin Pilipczuk, Michael P. O'Brien","submitted_at":"2018-02-27T01:13:43Z","abstract_excerpt":"Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors have bounded treedepth. These colorings have an implicit tradeoff between the total number of colors used and the treedepth bound, and prior empirical work suggests that the former dominates the run time of existing algorithms in practice. We introduce $p$-linear colorings as an alternative to the commonly used $p$-centered colorings. They can be efficiently computed in bounded expansion classes and use at most as many colors as $p$-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09665","kind":"arxiv","version":4},"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-18T00:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLamFNq+RPNo8ReY8rlLZBgHZqvJ8yVGSmo1rzbnA8AfkDPn11ZjduziF2uMfmShfVvfWZimgDnK+ChyBPr/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:47:28.671324Z"},"content_sha256":"fbdb11f129fc0e51976a7febbc8397fda7a327880d2a600ce40349b63f1dfe0d","schema_version":"1.0","event_id":"sha256:fbdb11f129fc0e51976a7febbc8397fda7a327880d2a600ce40349b63f1dfe0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PA7EHEZKR5ECL6ZG435PP2I6Z/bundle.json","state_url":"https://pith.science/pith/7PA7EHEZKR5ECL6ZG435PP2I6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PA7EHEZKR5ECL6ZG435PP2I6Z/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-01T12:47:28Z","links":{"resolver":"https://pith.science/pith/7PA7EHEZKR5ECL6ZG435PP2I6Z","bundle":"https://pith.science/pith/7PA7EHEZKR5ECL6ZG435PP2I6Z/bundle.json","state":"https://pith.science/pith/7PA7EHEZKR5ECL6ZG435PP2I6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PA7EHEZKR5ECL6ZG435PP2I6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7PA7EHEZKR5ECL6ZG435PP2I6Z","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":"fa33364d5ea509f649623e1e3fb27fda99708b4f3852ae55706f63092b307ccb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T01:13:43Z","title_canon_sha256":"ca80b5896397b63d43d6ba16ee217ad484e6e2940cfa0b22fd5add4206b10369"},"schema_version":"1.0","source":{"id":"1802.09665","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09665","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09665v4","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09665","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"7PA7EHEZKR5E","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7PA7EHEZKR5ECL6Z","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7PA7EHEZ","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:fbdb11f129fc0e51976a7febbc8397fda7a327880d2a600ce40349b63f1dfe0d","target":"graph","created_at":"2026-05-18T00:09:52Z","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":"Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors have bounded treedepth. These colorings have an implicit tradeoff between the total number of colors used and the treedepth bound, and prior empirical work suggests that the former dominates the run time of existing algorithms in practice. We introduce $p$-linear colorings as an alternative to the commonly used $p$-centered colorings. They can be efficiently computed in bounded expansion classes and use at most as many colors as $p$-c","authors_text":"Blair D. Sullivan, Jeremy Kun, Marcin Pilipczuk, Michael P. O'Brien","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T01:13:43Z","title":"Polynomial Treedepth Bounds in Linear Colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09665","kind":"arxiv","version":4},"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:b69f37a0b39b289e239c07de0fe8c81a1f43095d21ab8e786c6a08f66aab4a3a","target":"record","created_at":"2026-05-18T00:09:52Z","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":"fa33364d5ea509f649623e1e3fb27fda99708b4f3852ae55706f63092b307ccb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-27T01:13:43Z","title_canon_sha256":"ca80b5896397b63d43d6ba16ee217ad484e6e2940cfa0b22fd5add4206b10369"},"schema_version":"1.0","source":{"id":"1802.09665","kind":"arxiv","version":4}},"canonical_sha256":"fbc1f21c99547a412fd93737d7bf48f678db927ba96d739a1df00a8ec7dbfe5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbc1f21c99547a412fd93737d7bf48f678db927ba96d739a1df00a8ec7dbfe5a","first_computed_at":"2026-05-18T00:09:52.613509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:52.613509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NPSVnF/FgTlIWJSKrlk6vWyH4krrkNoZTNheONkkZTm0K18VeDTjRt4HhWcaBPTB2MvvztgLEbwJDLnNLXilDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:52.614115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09665","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b69f37a0b39b289e239c07de0fe8c81a1f43095d21ab8e786c6a08f66aab4a3a","sha256:fbdb11f129fc0e51976a7febbc8397fda7a327880d2a600ce40349b63f1dfe0d"],"state_sha256":"111194c8c322e5c42d21957c6e2ddcd48f8a8204e71f2e5159ce4c11ee26c9e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kvt2Ih7OqWTOcXrcHbN20tp0QPHf5sqUPGl8pxLFWUkmNnFr+6JFjXH2byv7cQnheGsWIoSP5zUSk//SpUwEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:47:28.673454Z","bundle_sha256":"c232a54b5ee866b3cedd3b59d0a98a7a78aa30c3c422a531ca12420694798490"}}