{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PG77ABG3K363WNZNEKOYLC4DEH","short_pith_number":"pith:PG77ABG3","canonical_record":{"source":{"id":"2505.00412","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T09:15:53Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e068f788614108bd32706d5ad57146a8a4f2f945fa6237dd4bced9dce103ac9d","abstract_canon_sha256":"02666425ae6f7185eb3fed0ae45e7773ef808fdb6cd2d63bfe7724221f0698d5"},"schema_version":"1.0"},"canonical_sha256":"79bff004db56fdbb372d229d858b8321f6c5c651ff4e8c5ebe96fd896eb950ac","source":{"kind":"arxiv","id":"2505.00412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.00412","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"2505.00412v1","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00412","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"PG77ABG3K363","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"pith_short_16","alias_value":"PG77ABG3K363WNZN","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"pith_short_8","alias_value":"PG77ABG3","created_at":"2026-07-05T10:57:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PG77ABG3K363WNZNEKOYLC4DEH","target":"record","payload":{"canonical_record":{"source":{"id":"2505.00412","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T09:15:53Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"e068f788614108bd32706d5ad57146a8a4f2f945fa6237dd4bced9dce103ac9d","abstract_canon_sha256":"02666425ae6f7185eb3fed0ae45e7773ef808fdb6cd2d63bfe7724221f0698d5"},"schema_version":"1.0"},"canonical_sha256":"79bff004db56fdbb372d229d858b8321f6c5c651ff4e8c5ebe96fd896eb950ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:37.524864Z","signature_b64":"VQGlx/2cCikjW6LkTZzmoJtAwyZhLblaV+SqwCbhZoNfoLeRCP14xGlCqpzq7Gs/5d0cJ+5jSgfA4hVOwQhoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79bff004db56fdbb372d229d858b8321f6c5c651ff4e8c5ebe96fd896eb950ac","last_reissued_at":"2026-07-05T10:57:37.524299Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:37.524299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.00412","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-05T10:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuuDMUxePNOjjENKcjibQA4WnHFglQ1qG3H3mEmBFWD/NNE+MfBQHgOI+PQJR98IQCNAWcBWbdkJV6q1AFjOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:45:11.172391Z"},"content_sha256":"de20d67059acb100dcea74cb06ddd8d1317bc90faded18ba0b8c1825872d0cb0","schema_version":"1.0","event_id":"sha256:de20d67059acb100dcea74cb06ddd8d1317bc90faded18ba0b8c1825872d0cb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PG77ABG3K363WNZNEKOYLC4DEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Amir Nikabadi, Andrea Munaro, Esther Galby, Paloma T. Lima","submitted_at":"2025-05-01T09:15:53Z","abstract_excerpt":"We show that, for every fixed positive integers $r$ and $k$, \\textsc{Max-Weight List $r$-Colorable Induced Subgraph} admits a polynomial-time algorithm on $kP_3$-free graphs. This problem is a common generalization of \\textsc{Max-Weight Independent Set}, \\textsc{Odd Cycle Transversal} and \\textsc{List $r$-Coloring}, among others. Our result has several consequences.\n  First, it implies that, for every fixed $r \\geq 5$, assuming $\\mathsf{P}\\neq \\mathsf{NP}$, \\textsc{Max-Weight List $r$-Colorable Induced Subgraph} is polynomial-time solvable on $H$-free graphs if and only if $H$ is an induced su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00412","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/2505.00412/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-05T10:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrZrF+YyNMQcxD+14ubFDOtL4D06c6WtKGa1Oo7iqBMozD22tspN6S4a/OZpK9z73hXKy2FmLcSv+nTtG3CwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:45:11.172987Z"},"content_sha256":"b83aba350720a89e37cc7e7129fdf0fcbbd999697a947fe2e37f8170d891e809","schema_version":"1.0","event_id":"sha256:b83aba350720a89e37cc7e7129fdf0fcbbd999697a947fe2e37f8170d891e809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PG77ABG3K363WNZNEKOYLC4DEH/bundle.json","state_url":"https://pith.science/pith/PG77ABG3K363WNZNEKOYLC4DEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PG77ABG3K363WNZNEKOYLC4DEH/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-22T06:45:11Z","links":{"resolver":"https://pith.science/pith/PG77ABG3K363WNZNEKOYLC4DEH","bundle":"https://pith.science/pith/PG77ABG3K363WNZNEKOYLC4DEH/bundle.json","state":"https://pith.science/pith/PG77ABG3K363WNZNEKOYLC4DEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PG77ABG3K363WNZNEKOYLC4DEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PG77ABG3K363WNZNEKOYLC4DEH","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":"02666425ae6f7185eb3fed0ae45e7773ef808fdb6cd2d63bfe7724221f0698d5","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T09:15:53Z","title_canon_sha256":"e068f788614108bd32706d5ad57146a8a4f2f945fa6237dd4bced9dce103ac9d"},"schema_version":"1.0","source":{"id":"2505.00412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.00412","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"2505.00412v1","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00412","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"PG77ABG3K363","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"pith_short_16","alias_value":"PG77ABG3K363WNZN","created_at":"2026-07-05T10:57:37Z"},{"alias_kind":"pith_short_8","alias_value":"PG77ABG3","created_at":"2026-07-05T10:57:37Z"}],"graph_snapshots":[{"event_id":"sha256:b83aba350720a89e37cc7e7129fdf0fcbbd999697a947fe2e37f8170d891e809","target":"graph","created_at":"2026-07-05T10:57:37Z","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/2505.00412/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that, for every fixed positive integers $r$ and $k$, \\textsc{Max-Weight List $r$-Colorable Induced Subgraph} admits a polynomial-time algorithm on $kP_3$-free graphs. This problem is a common generalization of \\textsc{Max-Weight Independent Set}, \\textsc{Odd Cycle Transversal} and \\textsc{List $r$-Coloring}, among others. Our result has several consequences.\n  First, it implies that, for every fixed $r \\geq 5$, assuming $\\mathsf{P}\\neq \\mathsf{NP}$, \\textsc{Max-Weight List $r$-Colorable Induced Subgraph} is polynomial-time solvable on $H$-free graphs if and only if $H$ is an induced su","authors_text":"Amir Nikabadi, Andrea Munaro, Esther Galby, Paloma T. Lima","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T09:15:53Z","title":"Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00412","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:de20d67059acb100dcea74cb06ddd8d1317bc90faded18ba0b8c1825872d0cb0","target":"record","created_at":"2026-07-05T10:57:37Z","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":"02666425ae6f7185eb3fed0ae45e7773ef808fdb6cd2d63bfe7724221f0698d5","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-01T09:15:53Z","title_canon_sha256":"e068f788614108bd32706d5ad57146a8a4f2f945fa6237dd4bced9dce103ac9d"},"schema_version":"1.0","source":{"id":"2505.00412","kind":"arxiv","version":1}},"canonical_sha256":"79bff004db56fdbb372d229d858b8321f6c5c651ff4e8c5ebe96fd896eb950ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79bff004db56fdbb372d229d858b8321f6c5c651ff4e8c5ebe96fd896eb950ac","first_computed_at":"2026-07-05T10:57:37.524299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:57:37.524299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VQGlx/2cCikjW6LkTZzmoJtAwyZhLblaV+SqwCbhZoNfoLeRCP14xGlCqpzq7Gs/5d0cJ+5jSgfA4hVOwQhoDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:57:37.524864Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.00412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de20d67059acb100dcea74cb06ddd8d1317bc90faded18ba0b8c1825872d0cb0","sha256:b83aba350720a89e37cc7e7129fdf0fcbbd999697a947fe2e37f8170d891e809"],"state_sha256":"c4eea615ac66d63c3570531fd7b88aacef10299c1a007b819323e96a72907d80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFGPwX+fdiR7r9ZsSiweR+hVjXUMlFLGI6146OHPcb3jK/PqwAGBwCSfIM+Ld0hOvRSKFR3KB3P72hEN3uwMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T06:45:11.179011Z","bundle_sha256":"0827a666876a0d195af1d2b68e23449ebefddc17c06ec7466f32e4fcef364ffe"}}