{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HPWV3W63FFQFRCTNS4O5TURJGB","short_pith_number":"pith:HPWV3W63","canonical_record":{"source":{"id":"2607.00263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T23:25:42Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"da8e1387e4743527f3672d0028ab7b0c8a1797a029336874b3983aded104e668","abstract_canon_sha256":"d6f5f323889e5405f3cbf763a505f0a1572b7b394b11cbc9672c47ff4ccaf52a"},"schema_version":"1.0"},"canonical_sha256":"3bed5ddbdb2960588a6d971dd9d229306a5b43d17ed85102f1cdc28770ae62c5","source":{"kind":"arxiv","id":"2607.00263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00263","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00263v1","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00263","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"HPWV3W63FFQF","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"pith_short_16","alias_value":"HPWV3W63FFQFRCTN","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"pith_short_8","alias_value":"HPWV3W63","created_at":"2026-07-02T00:18:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HPWV3W63FFQFRCTNS4O5TURJGB","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T23:25:42Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"da8e1387e4743527f3672d0028ab7b0c8a1797a029336874b3983aded104e668","abstract_canon_sha256":"d6f5f323889e5405f3cbf763a505f0a1572b7b394b11cbc9672c47ff4ccaf52a"},"schema_version":"1.0"},"canonical_sha256":"3bed5ddbdb2960588a6d971dd9d229306a5b43d17ed85102f1cdc28770ae62c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:41.596137Z","signature_b64":"sJqNGibR0UGKJu4Xw2MyFEExZH0X04OFhhoBpWM/yOz/1xksHAw2+h6tfTQIk5j2GkG1cU2RU5vDqFe0+i+PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bed5ddbdb2960588a6d971dd9d229306a5b43d17ed85102f1cdc28770ae62c5","last_reissued_at":"2026-07-02T00:18:41.595248Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:41.595248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00263","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-07-02T00:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDNlWffXsbCD/AtnWFHzEPG/HLD6QkpXWO2BOLcG0n3LVoRusWu8yjlC/bt2Q2RF6JaftH/5AbvNGYhlqamdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:13:40.651472Z"},"content_sha256":"a854ae83dea8cecd0c700bf414072bb6ec5638e3e1de1a0ac9496a72be90e991","schema_version":"1.0","event_id":"sha256:a854ae83dea8cecd0c700bf414072bb6ec5638e3e1de1a0ac9496a72be90e991"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HPWV3W63FFQFRCTNS4O5TURJGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Determining the Complexity of Chromatic Sum in Classes Defined by a Set of Forbidden Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Cl\\'ement Dallard, Dani\\\"el Paulusma, Erik Jan van Leeuwen","submitted_at":"2026-06-30T23:25:42Z","abstract_excerpt":"The Chromatic Sum problem asks, given a graph $G$ and an integer $k$, whether $G$ admits a colouring $c$ with sum $\\sum_{v\\in V}c(v) \\leq k$. We study the complexity of Chromatic Sum on graph classes defined by some set of forbidden graphs. First, we show that three known frameworks fully classify the complexity of Chromatic Sum on $HH$-minor-free graphs and $HH$-topological-minor-free graphs for any set of graphs $HH$, and on $HH$-subgraph-free graphs for any finite set of graphs $HH$. To show this, we prove a new NP-completeness result for Chromatic Sum on certain subdivisions of planar subc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00263","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00263/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-02T00:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIjS4zcZBQIPy8jNjSyTutgfS5Xs5wiRDG/he8HOSJe+1tfh02b1FHDx4uIYybWZmWoN6KcQdYkE5ihL0kpwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:13:40.652466Z"},"content_sha256":"ae3f326da4b713153a129cf4e93dc0bdb8c869b9f75e6e782b3375efa617f94f","schema_version":"1.0","event_id":"sha256:ae3f326da4b713153a129cf4e93dc0bdb8c869b9f75e6e782b3375efa617f94f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPWV3W63FFQFRCTNS4O5TURJGB/bundle.json","state_url":"https://pith.science/pith/HPWV3W63FFQFRCTNS4O5TURJGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPWV3W63FFQFRCTNS4O5TURJGB/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-08-18T11:13:40Z","links":{"resolver":"https://pith.science/pith/HPWV3W63FFQFRCTNS4O5TURJGB","bundle":"https://pith.science/pith/HPWV3W63FFQFRCTNS4O5TURJGB/bundle.json","state":"https://pith.science/pith/HPWV3W63FFQFRCTNS4O5TURJGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPWV3W63FFQFRCTNS4O5TURJGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HPWV3W63FFQFRCTNS4O5TURJGB","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":"d6f5f323889e5405f3cbf763a505f0a1572b7b394b11cbc9672c47ff4ccaf52a","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T23:25:42Z","title_canon_sha256":"da8e1387e4743527f3672d0028ab7b0c8a1797a029336874b3983aded104e668"},"schema_version":"1.0","source":{"id":"2607.00263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00263","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00263v1","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00263","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"HPWV3W63FFQF","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"pith_short_16","alias_value":"HPWV3W63FFQFRCTN","created_at":"2026-07-02T00:18:41Z"},{"alias_kind":"pith_short_8","alias_value":"HPWV3W63","created_at":"2026-07-02T00:18:41Z"}],"graph_snapshots":[{"event_id":"sha256:ae3f326da4b713153a129cf4e93dc0bdb8c869b9f75e6e782b3375efa617f94f","target":"graph","created_at":"2026-07-02T00:18:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00263/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Chromatic Sum problem asks, given a graph $G$ and an integer $k$, whether $G$ admits a colouring $c$ with sum $\\sum_{v\\in V}c(v) \\leq k$. We study the complexity of Chromatic Sum on graph classes defined by some set of forbidden graphs. First, we show that three known frameworks fully classify the complexity of Chromatic Sum on $HH$-minor-free graphs and $HH$-topological-minor-free graphs for any set of graphs $HH$, and on $HH$-subgraph-free graphs for any finite set of graphs $HH$. To show this, we prove a new NP-completeness result for Chromatic Sum on certain subdivisions of planar subc","authors_text":"Cl\\'ement Dallard, Dani\\\"el Paulusma, Erik Jan van Leeuwen","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T23:25:42Z","title":"Determining the Complexity of Chromatic Sum in Classes Defined by a Set of Forbidden Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00263","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:a854ae83dea8cecd0c700bf414072bb6ec5638e3e1de1a0ac9496a72be90e991","target":"record","created_at":"2026-07-02T00:18:41Z","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":"d6f5f323889e5405f3cbf763a505f0a1572b7b394b11cbc9672c47ff4ccaf52a","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T23:25:42Z","title_canon_sha256":"da8e1387e4743527f3672d0028ab7b0c8a1797a029336874b3983aded104e668"},"schema_version":"1.0","source":{"id":"2607.00263","kind":"arxiv","version":1}},"canonical_sha256":"3bed5ddbdb2960588a6d971dd9d229306a5b43d17ed85102f1cdc28770ae62c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bed5ddbdb2960588a6d971dd9d229306a5b43d17ed85102f1cdc28770ae62c5","first_computed_at":"2026-07-02T00:18:41.595248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:41.595248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sJqNGibR0UGKJu4Xw2MyFEExZH0X04OFhhoBpWM/yOz/1xksHAw2+h6tfTQIk5j2GkG1cU2RU5vDqFe0+i+PCg==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:41.596137Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a854ae83dea8cecd0c700bf414072bb6ec5638e3e1de1a0ac9496a72be90e991","sha256:ae3f326da4b713153a129cf4e93dc0bdb8c869b9f75e6e782b3375efa617f94f"],"state_sha256":"f9b344bbf87004aee95b58807d648e07ff405860568e7bd172a431b471406b13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOqr8ySlSsTwgApTBeqc0WrGJjKtaD4zPUy1ohhF3qziOArc+BgYk13qhNmC6XPXGaq0YiKcndB3AaE48zQkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T11:13:40.661357Z","bundle_sha256":"e6166707bc84ffe198cbb008d0e1d0453339199703e5ec891dd9e241e25035d7"}}