{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GVIODL3L34XYNZZ6677M7ZAMBY","short_pith_number":"pith:GVIODL3L","canonical_record":{"source":{"id":"1907.07286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T23:22:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4936ef3170250cb725000f931bd0acb24c7cacae9e732f7a44c3790884fe0ffd","abstract_canon_sha256":"1f95e5055bde863711d17dc894821ef6b1ee1bf6b6537a6e46f9a7fd107289b1"},"schema_version":"1.0"},"canonical_sha256":"3550e1af6bdf2f86e73ef7fecfe40c0e06c7244463071198cbc5a5e04c28b89c","source":{"kind":"arxiv","id":"1907.07286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07286","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07286v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07286","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"GVIODL3L34XY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVIODL3L34XYNZZ6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVIODL3L","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GVIODL3L34XYNZZ6677M7ZAMBY","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T23:22:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4936ef3170250cb725000f931bd0acb24c7cacae9e732f7a44c3790884fe0ffd","abstract_canon_sha256":"1f95e5055bde863711d17dc894821ef6b1ee1bf6b6537a6e46f9a7fd107289b1"},"schema_version":"1.0"},"canonical_sha256":"3550e1af6bdf2f86e73ef7fecfe40c0e06c7244463071198cbc5a5e04c28b89c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.801748Z","signature_b64":"7G4eFixMAuI7yeWDM8NYVEUSM8UVxzIRAcRH19p/EiaJMb7lxaeX6lVa0M/RZ3QeW6nlBASc80aIxmGDOjqGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3550e1af6bdf2f86e73ef7fecfe40c0e06c7244463071198cbc5a5e04c28b89c","last_reissued_at":"2026-05-17T23:40:22.801193Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.801193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07286","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-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tb9c2CkzHOf9Se8TQxYObcFbOPEOq+521SYEgyWMRfINFeD0vXkJVIisMOkNMbW9TDYziecU5/BMU3SJsOYMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:41:54.738502Z"},"content_sha256":"a435343cddba458d78d5feb6fedbce1e53a6e44b8a0f2b4cb0b6f64ce1e63d38","schema_version":"1.0","event_id":"sha256:a435343cddba458d78d5feb6fedbce1e53a6e44b8a0f2b4cb0b6f64ce1e63d38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GVIODL3L34XYNZZ6677M7ZAMBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex arboricity of cographs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez Cruz, Pavol Hell, Payam Valadkhan, Sebasti\\'an Gonz\\'alez Hermosillo de la Maza, Seyyed Aliasghar Hosseini","submitted_at":"2019-07-16T23:22:10Z","abstract_excerpt":"Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we are partitioning the vertices into independent sets, for the arboricity we want to partition the vertices into cycle-free subsets (i.e., forests). Arboricity is NP-hard in general, and our focus is on the arboricity of cographs. For arboricity two, we obtain the complete list of minimal cograph obstructions. These minimal obstructions do generalize to higher arboricities; however, we no longer have a complete list, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07286","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-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FALuKdqbWNxlpLWMgT8wa2E8IOtbm4fDto2z6MmmbG+hKowJlZU2WWYJThlhqw6LDUK+otqiAcYeJr+005OvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:41:54.739153Z"},"content_sha256":"b48567193776b73a91f21b9ec03837b532cb7b5fa0b604f9f237f215d6ae6719","schema_version":"1.0","event_id":"sha256:b48567193776b73a91f21b9ec03837b532cb7b5fa0b604f9f237f215d6ae6719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVIODL3L34XYNZZ6677M7ZAMBY/bundle.json","state_url":"https://pith.science/pith/GVIODL3L34XYNZZ6677M7ZAMBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVIODL3L34XYNZZ6677M7ZAMBY/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-02T14:41:54Z","links":{"resolver":"https://pith.science/pith/GVIODL3L34XYNZZ6677M7ZAMBY","bundle":"https://pith.science/pith/GVIODL3L34XYNZZ6677M7ZAMBY/bundle.json","state":"https://pith.science/pith/GVIODL3L34XYNZZ6677M7ZAMBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVIODL3L34XYNZZ6677M7ZAMBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GVIODL3L34XYNZZ6677M7ZAMBY","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":"1f95e5055bde863711d17dc894821ef6b1ee1bf6b6537a6e46f9a7fd107289b1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T23:22:10Z","title_canon_sha256":"4936ef3170250cb725000f931bd0acb24c7cacae9e732f7a44c3790884fe0ffd"},"schema_version":"1.0","source":{"id":"1907.07286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07286","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07286v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07286","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"GVIODL3L34XY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVIODL3L34XYNZZ6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVIODL3L","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:b48567193776b73a91f21b9ec03837b532cb7b5fa0b604f9f237f215d6ae6719","target":"graph","created_at":"2026-05-17T23:40:22Z","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":"Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we are partitioning the vertices into independent sets, for the arboricity we want to partition the vertices into cycle-free subsets (i.e., forests). Arboricity is NP-hard in general, and our focus is on the arboricity of cographs. For arboricity two, we obtain the complete list of minimal cograph obstructions. These minimal obstructions do generalize to higher arboricities; however, we no longer have a complete list, ","authors_text":"C\\'esar Hern\\'andez Cruz, Pavol Hell, Payam Valadkhan, Sebasti\\'an Gonz\\'alez Hermosillo de la Maza, Seyyed Aliasghar Hosseini","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T23:22:10Z","title":"Vertex arboricity of cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07286","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:a435343cddba458d78d5feb6fedbce1e53a6e44b8a0f2b4cb0b6f64ce1e63d38","target":"record","created_at":"2026-05-17T23:40:22Z","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":"1f95e5055bde863711d17dc894821ef6b1ee1bf6b6537a6e46f9a7fd107289b1","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-16T23:22:10Z","title_canon_sha256":"4936ef3170250cb725000f931bd0acb24c7cacae9e732f7a44c3790884fe0ffd"},"schema_version":"1.0","source":{"id":"1907.07286","kind":"arxiv","version":1}},"canonical_sha256":"3550e1af6bdf2f86e73ef7fecfe40c0e06c7244463071198cbc5a5e04c28b89c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3550e1af6bdf2f86e73ef7fecfe40c0e06c7244463071198cbc5a5e04c28b89c","first_computed_at":"2026-05-17T23:40:22.801193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:22.801193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7G4eFixMAuI7yeWDM8NYVEUSM8UVxzIRAcRH19p/EiaJMb7lxaeX6lVa0M/RZ3QeW6nlBASc80aIxmGDOjqGBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:22.801748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a435343cddba458d78d5feb6fedbce1e53a6e44b8a0f2b4cb0b6f64ce1e63d38","sha256:b48567193776b73a91f21b9ec03837b532cb7b5fa0b604f9f237f215d6ae6719"],"state_sha256":"910a90526aa9ab331e91583ee89ff153de8957de39e31f8c1e78b9122dc613a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QohgwKkF6PFh6B3KVhMB2PaBcVwIveA/VOKKTT3qQrlr9M3UqxVYbE+whh6HFyf6Jch4bZU1rAErTSn/V8LiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:41:54.742699Z","bundle_sha256":"55f80db8bfad0c8653d40520de5852f499d1394590dccb3715127a507008167c"}}