{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:INFH7XL5WGKGLEI3UE3VYJABKE","short_pith_number":"pith:INFH7XL5","canonical_record":{"source":{"id":"2508.08119","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T15:57:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"773603ac28789447e9bd159a1f90209fc7177d77d64f5194d38a8da31d0ad706","abstract_canon_sha256":"1e6e4690f874c40c1f89d6b5b9355dafa5b907347f6bdd71b42662386c50ce2f"},"schema_version":"1.0"},"canonical_sha256":"434a7fdd7db19465911ba1375c2401511854659abd36e641e7bed0d6f368a076","source":{"kind":"arxiv","id":"2508.08119","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.08119","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"2508.08119v3","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.08119","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"INFH7XL5WGKG","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"pith_short_16","alias_value":"INFH7XL5WGKGLEI3","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"pith_short_8","alias_value":"INFH7XL5","created_at":"2026-07-03T01:17:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:INFH7XL5WGKGLEI3UE3VYJABKE","target":"record","payload":{"canonical_record":{"source":{"id":"2508.08119","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T15:57:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"773603ac28789447e9bd159a1f90209fc7177d77d64f5194d38a8da31d0ad706","abstract_canon_sha256":"1e6e4690f874c40c1f89d6b5b9355dafa5b907347f6bdd71b42662386c50ce2f"},"schema_version":"1.0"},"canonical_sha256":"434a7fdd7db19465911ba1375c2401511854659abd36e641e7bed0d6f368a076","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:12.610890Z","signature_b64":"Dbw7ATvFgIWbfr9P3QjCpUVglzwf5og8dOCylVIXIawa+It73LvpEqU03irKOOqQb+aM9xNLMibHSa+F1HSdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"434a7fdd7db19465911ba1375c2401511854659abd36e641e7bed0d6f368a076","last_reissued_at":"2026-07-03T01:17:12.610440Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:12.610440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.08119","source_version":3,"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-03T01:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luXOKRE7LzNpLy9YlACInsbXCzlPyzwz+zpLEZlkpcYa+K49D+3+SrDY2OgnzewTLgfuRf/RP6p4RICm15kSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T00:33:37.576027Z"},"content_sha256":"f85f86a352e89b5720a4d8468e598a2a14746da9ff92a2030a6de05783b70e1f","schema_version":"1.0","event_id":"sha256:f85f86a352e89b5720a4d8468e598a2a14746da9ff92a2030a6de05783b70e1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:INFH7XL5WGKGLEI3UE3VYJABKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring Graphs With No Totally Odd Clique Immersion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Caleb McFarland","submitted_at":"2025-08-11T15:57:58Z","abstract_excerpt":"We prove that graphs that do not contain a totally odd immersion of $K_t$ are $\\mathcal{O}(t)$-colorable. In particular, we show that any graph with no totally odd immersion of $K_t$ is the union of a bipartite graph and a graph which forbids an immersion of $K_{\\mathcal{O}(t)}$. Our results are algorithmic, and we give a fixed-parameter tractable algorithm (in $t$) to find such a decomposition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.08119","kind":"arxiv","version":3},"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/2508.08119/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-03T01:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAi4sSVApBSjt/+o0E/8/+lErMFDhRfsAt1DDbqbOb+8y/vE3aYEgLD9Jy9lfbFA4C07jWeqprxE20Tobse4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T00:33:37.576497Z"},"content_sha256":"6fb5c6f3f6c21675b3a84e1be19fa12ea5aba0daab90a265042272a53e8edd70","schema_version":"1.0","event_id":"sha256:6fb5c6f3f6c21675b3a84e1be19fa12ea5aba0daab90a265042272a53e8edd70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INFH7XL5WGKGLEI3UE3VYJABKE/bundle.json","state_url":"https://pith.science/pith/INFH7XL5WGKGLEI3UE3VYJABKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INFH7XL5WGKGLEI3UE3VYJABKE/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-07-04T00:33:37Z","links":{"resolver":"https://pith.science/pith/INFH7XL5WGKGLEI3UE3VYJABKE","bundle":"https://pith.science/pith/INFH7XL5WGKGLEI3UE3VYJABKE/bundle.json","state":"https://pith.science/pith/INFH7XL5WGKGLEI3UE3VYJABKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INFH7XL5WGKGLEI3UE3VYJABKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:INFH7XL5WGKGLEI3UE3VYJABKE","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":"1e6e4690f874c40c1f89d6b5b9355dafa5b907347f6bdd71b42662386c50ce2f","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T15:57:58Z","title_canon_sha256":"773603ac28789447e9bd159a1f90209fc7177d77d64f5194d38a8da31d0ad706"},"schema_version":"1.0","source":{"id":"2508.08119","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.08119","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"2508.08119v3","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.08119","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"INFH7XL5WGKG","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"pith_short_16","alias_value":"INFH7XL5WGKGLEI3","created_at":"2026-07-03T01:17:12Z"},{"alias_kind":"pith_short_8","alias_value":"INFH7XL5","created_at":"2026-07-03T01:17:12Z"}],"graph_snapshots":[{"event_id":"sha256:6fb5c6f3f6c21675b3a84e1be19fa12ea5aba0daab90a265042272a53e8edd70","target":"graph","created_at":"2026-07-03T01:17:12Z","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/2508.08119/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that graphs that do not contain a totally odd immersion of $K_t$ are $\\mathcal{O}(t)$-colorable. In particular, we show that any graph with no totally odd immersion of $K_t$ is the union of a bipartite graph and a graph which forbids an immersion of $K_{\\mathcal{O}(t)}$. Our results are algorithmic, and we give a fixed-parameter tractable algorithm (in $t$) to find such a decomposition.","authors_text":"Caleb McFarland","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T15:57:58Z","title":"Coloring Graphs With No Totally Odd Clique Immersion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.08119","kind":"arxiv","version":3},"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:f85f86a352e89b5720a4d8468e598a2a14746da9ff92a2030a6de05783b70e1f","target":"record","created_at":"2026-07-03T01:17:12Z","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":"1e6e4690f874c40c1f89d6b5b9355dafa5b907347f6bdd71b42662386c50ce2f","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T15:57:58Z","title_canon_sha256":"773603ac28789447e9bd159a1f90209fc7177d77d64f5194d38a8da31d0ad706"},"schema_version":"1.0","source":{"id":"2508.08119","kind":"arxiv","version":3}},"canonical_sha256":"434a7fdd7db19465911ba1375c2401511854659abd36e641e7bed0d6f368a076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"434a7fdd7db19465911ba1375c2401511854659abd36e641e7bed0d6f368a076","first_computed_at":"2026-07-03T01:17:12.610440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:12.610440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dbw7ATvFgIWbfr9P3QjCpUVglzwf5og8dOCylVIXIawa+It73LvpEqU03irKOOqQb+aM9xNLMibHSa+F1HSdCw==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:12.610890Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.08119","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f85f86a352e89b5720a4d8468e598a2a14746da9ff92a2030a6de05783b70e1f","sha256:6fb5c6f3f6c21675b3a84e1be19fa12ea5aba0daab90a265042272a53e8edd70"],"state_sha256":"aed88189d822b52a7b8d3c7fa91d1662019bb494064c490cb5b607b8d4b59854"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqohyGccZIi+NK+BJVdGovKhd8Mc3slRA78bBObDt9R2Qo73o3b+bIdFC7wZ8I2kEQtDtFCBLxZO6GkwRNjpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T00:33:37.579674Z","bundle_sha256":"266581c94efcd22dcd20f43077122952a6eea9677d10f39194907a51264d2450"}}