{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QVSOKJKEVD3RZOZEEP2WHFLPYQ","short_pith_number":"pith:QVSOKJKE","canonical_record":{"source":{"id":"2508.18793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-26T08:18:28Z","cross_cats_sorted":[],"title_canon_sha256":"44e1508f45d7856bd6ca597b193fe8b13d74c69838ffd6d3c62073e2f15b8a76","abstract_canon_sha256":"90a01e0c6bb449863489204e1dbeea01e33d21b4d851976afbcaad0601207581"},"schema_version":"1.0"},"canonical_sha256":"8564e52544a8f71cbb2423f563956fc4395039b633ef777a2539fe7a14bc99dd","source":{"kind":"arxiv","id":"2508.18793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.18793","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"2508.18793v1","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18793","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"QVSOKJKEVD3R","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"pith_short_16","alias_value":"QVSOKJKEVD3RZOZE","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"pith_short_8","alias_value":"QVSOKJKE","created_at":"2026-07-05T11:59:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QVSOKJKEVD3RZOZEEP2WHFLPYQ","target":"record","payload":{"canonical_record":{"source":{"id":"2508.18793","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-26T08:18:28Z","cross_cats_sorted":[],"title_canon_sha256":"44e1508f45d7856bd6ca597b193fe8b13d74c69838ffd6d3c62073e2f15b8a76","abstract_canon_sha256":"90a01e0c6bb449863489204e1dbeea01e33d21b4d851976afbcaad0601207581"},"schema_version":"1.0"},"canonical_sha256":"8564e52544a8f71cbb2423f563956fc4395039b633ef777a2539fe7a14bc99dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:31.140438Z","signature_b64":"Wn1gTN874/G4ixY9JtOxj6aM2Y31qNcetsiY9LlhbTQrAL2j0NfHe2wAMN0FajW+9rx1I7enaGABg1E60ZxFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8564e52544a8f71cbb2423f563956fc4395039b633ef777a2539fe7a14bc99dd","last_reissued_at":"2026-07-05T11:59:31.139887Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:31.139887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.18793","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-05T11:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8mhzVQ+g2nWigSQ7eiNQb6xBFNGq9LZn9zj+VM2WOAZc6TSZSgzA2csJsB1cM0i4qJnTDSrG5pcgxLZNWSXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:58:56.546194Z"},"content_sha256":"4c0d7faa03c03877a23a11a3a5724903400e81a61ae47b3f781a6496def367f5","schema_version":"1.0","event_id":"sha256:4c0d7faa03c03877a23a11a3a5724903400e81a61ae47b3f781a6496def367f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QVSOKJKEVD3RZOZEEP2WHFLPYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hoffman colorability of (strongly) regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aida Abiad, Bart De Bruyn, Thijs van Veluw","submitted_at":"2025-08-26T08:18:28Z","abstract_excerpt":"Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph regularity: regular, (co-)edge-regular, and strongly regular. For strongly regular graphs, we prove that Hoffman colorability implies pseudo-geometricity, and we strengthen Haemers' finiteness result on strongly regular graphs with a bounded chromatic number by considering the Hoffman bound instead of the chromatic number. Furthermore, by using Hoffman color"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18793","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/2508.18793/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-05T11:59:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE+8FcDPlFoNvQH4Pt/nYzTGy6fs3duJlFFLaeJjCC0CK334zdwJ+6cEURYUGiq+rta1yesSKQ8Muk3bB/meDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:58:56.547064Z"},"content_sha256":"dd028791c092c16bcb66e621fa1666c9c7db91a2885906432d52912f055e50c0","schema_version":"1.0","event_id":"sha256:dd028791c092c16bcb66e621fa1666c9c7db91a2885906432d52912f055e50c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVSOKJKEVD3RZOZEEP2WHFLPYQ/bundle.json","state_url":"https://pith.science/pith/QVSOKJKEVD3RZOZEEP2WHFLPYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVSOKJKEVD3RZOZEEP2WHFLPYQ/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-09T02:58:56Z","links":{"resolver":"https://pith.science/pith/QVSOKJKEVD3RZOZEEP2WHFLPYQ","bundle":"https://pith.science/pith/QVSOKJKEVD3RZOZEEP2WHFLPYQ/bundle.json","state":"https://pith.science/pith/QVSOKJKEVD3RZOZEEP2WHFLPYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVSOKJKEVD3RZOZEEP2WHFLPYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QVSOKJKEVD3RZOZEEP2WHFLPYQ","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":"90a01e0c6bb449863489204e1dbeea01e33d21b4d851976afbcaad0601207581","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-26T08:18:28Z","title_canon_sha256":"44e1508f45d7856bd6ca597b193fe8b13d74c69838ffd6d3c62073e2f15b8a76"},"schema_version":"1.0","source":{"id":"2508.18793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.18793","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"arxiv_version","alias_value":"2508.18793v1","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18793","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"pith_short_12","alias_value":"QVSOKJKEVD3R","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"pith_short_16","alias_value":"QVSOKJKEVD3RZOZE","created_at":"2026-07-05T11:59:31Z"},{"alias_kind":"pith_short_8","alias_value":"QVSOKJKE","created_at":"2026-07-05T11:59:31Z"}],"graph_snapshots":[{"event_id":"sha256:dd028791c092c16bcb66e621fa1666c9c7db91a2885906432d52912f055e50c0","target":"graph","created_at":"2026-07-05T11:59:31Z","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.18793/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph regularity: regular, (co-)edge-regular, and strongly regular. For strongly regular graphs, we prove that Hoffman colorability implies pseudo-geometricity, and we strengthen Haemers' finiteness result on strongly regular graphs with a bounded chromatic number by considering the Hoffman bound instead of the chromatic number. Furthermore, by using Hoffman color","authors_text":"Aida Abiad, Bart De Bruyn, Thijs van Veluw","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-26T08:18:28Z","title":"Hoffman colorability of (strongly) regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18793","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:4c0d7faa03c03877a23a11a3a5724903400e81a61ae47b3f781a6496def367f5","target":"record","created_at":"2026-07-05T11:59:31Z","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":"90a01e0c6bb449863489204e1dbeea01e33d21b4d851976afbcaad0601207581","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-26T08:18:28Z","title_canon_sha256":"44e1508f45d7856bd6ca597b193fe8b13d74c69838ffd6d3c62073e2f15b8a76"},"schema_version":"1.0","source":{"id":"2508.18793","kind":"arxiv","version":1}},"canonical_sha256":"8564e52544a8f71cbb2423f563956fc4395039b633ef777a2539fe7a14bc99dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8564e52544a8f71cbb2423f563956fc4395039b633ef777a2539fe7a14bc99dd","first_computed_at":"2026-07-05T11:59:31.139887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:59:31.139887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wn1gTN874/G4ixY9JtOxj6aM2Y31qNcetsiY9LlhbTQrAL2j0NfHe2wAMN0FajW+9rx1I7enaGABg1E60ZxFCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:59:31.140438Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.18793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c0d7faa03c03877a23a11a3a5724903400e81a61ae47b3f781a6496def367f5","sha256:dd028791c092c16bcb66e621fa1666c9c7db91a2885906432d52912f055e50c0"],"state_sha256":"33671dea67100700e86688565a23d4c302d85ef7348287cdc2c0c966b681e02b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u68HjYQHmDriRtGcPpfhgg8dUIW2Ms6dHPeBAfxGa5fj1ns+st9wN1hO6xhtSMr1cYwA3jXHtWF/8hH2nKeMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:58:56.554262Z","bundle_sha256":"a74a3ce65cd9abc66d0dd12d63ba9bbd006b2d963a404d3e3962424b1e888162"}}