{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CANCY4OUGLHZV24HYQCEOSAAIU","short_pith_number":"pith:CANCY4OU","canonical_record":{"source":{"id":"1507.06254","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T16:57:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3dda63d3df198d2123410fd25a70ba75c669cfa7ffd40e74481730b966663d0b","abstract_canon_sha256":"3cd2a119a719ebfe624284e12ca337f867b22946042ebfff64453b63dba930da"},"schema_version":"1.0"},"canonical_sha256":"101a2c71d432cf9aeb87c404474800452d2481a78585334190bc9bb4a5bb127b","source":{"kind":"arxiv","id":"1507.06254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06254","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06254v2","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06254","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"CANCY4OUGLHZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CANCY4OUGLHZV24H","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CANCY4OU","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CANCY4OUGLHZV24HYQCEOSAAIU","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06254","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T16:57:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3dda63d3df198d2123410fd25a70ba75c669cfa7ffd40e74481730b966663d0b","abstract_canon_sha256":"3cd2a119a719ebfe624284e12ca337f867b22946042ebfff64453b63dba930da"},"schema_version":"1.0"},"canonical_sha256":"101a2c71d432cf9aeb87c404474800452d2481a78585334190bc9bb4a5bb127b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.799344Z","signature_b64":"eIlVkZScTSrHGDLnBilFZrcjovt2n4N2ijvO3S8TwSK1qGayxb0/KFj1QAzZUfImyJr2gWifZZanlk+FtypgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"101a2c71d432cf9aeb87c404474800452d2481a78585334190bc9bb4a5bb127b","last_reissued_at":"2026-05-18T00:53:17.798878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.798878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06254","source_version":2,"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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Svibu/Wv2lundlU3ptBEaFp75hhM60niRlAXsQEr4Gb6/RhymkMIgbfJxeuNJ7qPrOvBms9VOvV4vqR3MOkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:00.540308Z"},"content_sha256":"21df30223b6058e4e2963f067db7b7b99f091ee7f535a3377324039971776995","schema_version":"1.0","event_id":"sha256:21df30223b6058e4e2963f067db7b7b99f091ee7f535a3377324039971776995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CANCY4OUGLHZV24HYQCEOSAAIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-cut and extendability of matchings in distance-regular graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jack H. Koolen, Sebastian M. Cioab\\u{a}, Weiqiang Li","submitted_at":"2015-07-22T16:57:16Z","abstract_excerpt":"Let $G$ be a distance-regular graph of order $v$ and size $e$. In this paper, we show that the max-cut in $G$ is at most $e(1-1/g)$, where $g$ is the odd girth of $G$. This result implies that the independence number of $G$ is at most $\\frac{v}{2}(1-1/g)$. We use this fact to also study the extendability of matchings in distance-regular graphs. A graph $G$ of even order $v$ is called $t$-extendable if it contains a perfect matching, $t<v/2$ and any matching of $t$ edges is contained in some perfect matching. The extendability of $G$ is the maximum $t$ such that $G$ is $t$-extendable. We genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06254","kind":"arxiv","version":2},"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-18T00:53:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+sy0kz98uk/VJdNJKZtUWFFE7VBbklBtwjBBdCEFVaB1XtZAei0WXsqxmMh2Y5FfNBJGP2tfU0jYv0Fp7ScCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:00.541036Z"},"content_sha256":"b1917d80e6f7e231e9ae6d4baff37fb35df09138ccd17787384f6d64540daab6","schema_version":"1.0","event_id":"sha256:b1917d80e6f7e231e9ae6d4baff37fb35df09138ccd17787384f6d64540daab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CANCY4OUGLHZV24HYQCEOSAAIU/bundle.json","state_url":"https://pith.science/pith/CANCY4OUGLHZV24HYQCEOSAAIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CANCY4OUGLHZV24HYQCEOSAAIU/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-05-31T09:21:00Z","links":{"resolver":"https://pith.science/pith/CANCY4OUGLHZV24HYQCEOSAAIU","bundle":"https://pith.science/pith/CANCY4OUGLHZV24HYQCEOSAAIU/bundle.json","state":"https://pith.science/pith/CANCY4OUGLHZV24HYQCEOSAAIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CANCY4OUGLHZV24HYQCEOSAAIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CANCY4OUGLHZV24HYQCEOSAAIU","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":"3cd2a119a719ebfe624284e12ca337f867b22946042ebfff64453b63dba930da","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T16:57:16Z","title_canon_sha256":"3dda63d3df198d2123410fd25a70ba75c669cfa7ffd40e74481730b966663d0b"},"schema_version":"1.0","source":{"id":"1507.06254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06254","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06254v2","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06254","created_at":"2026-05-18T00:53:17Z"},{"alias_kind":"pith_short_12","alias_value":"CANCY4OUGLHZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CANCY4OUGLHZV24H","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CANCY4OU","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:b1917d80e6f7e231e9ae6d4baff37fb35df09138ccd17787384f6d64540daab6","target":"graph","created_at":"2026-05-18T00:53:17Z","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":"Let $G$ be a distance-regular graph of order $v$ and size $e$. In this paper, we show that the max-cut in $G$ is at most $e(1-1/g)$, where $g$ is the odd girth of $G$. This result implies that the independence number of $G$ is at most $\\frac{v}{2}(1-1/g)$. We use this fact to also study the extendability of matchings in distance-regular graphs. A graph $G$ of even order $v$ is called $t$-extendable if it contains a perfect matching, $t<v/2$ and any matching of $t$ edges is contained in some perfect matching. The extendability of $G$ is the maximum $t$ such that $G$ is $t$-extendable. We genera","authors_text":"Jack H. Koolen, Sebastian M. Cioab\\u{a}, Weiqiang Li","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T16:57:16Z","title":"Max-cut and extendability of matchings in distance-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06254","kind":"arxiv","version":2},"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:21df30223b6058e4e2963f067db7b7b99f091ee7f535a3377324039971776995","target":"record","created_at":"2026-05-18T00:53:17Z","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":"3cd2a119a719ebfe624284e12ca337f867b22946042ebfff64453b63dba930da","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T16:57:16Z","title_canon_sha256":"3dda63d3df198d2123410fd25a70ba75c669cfa7ffd40e74481730b966663d0b"},"schema_version":"1.0","source":{"id":"1507.06254","kind":"arxiv","version":2}},"canonical_sha256":"101a2c71d432cf9aeb87c404474800452d2481a78585334190bc9bb4a5bb127b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"101a2c71d432cf9aeb87c404474800452d2481a78585334190bc9bb4a5bb127b","first_computed_at":"2026-05-18T00:53:17.798878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:17.798878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eIlVkZScTSrHGDLnBilFZrcjovt2n4N2ijvO3S8TwSK1qGayxb0/KFj1QAzZUfImyJr2gWifZZanlk+FtypgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:17.799344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21df30223b6058e4e2963f067db7b7b99f091ee7f535a3377324039971776995","sha256:b1917d80e6f7e231e9ae6d4baff37fb35df09138ccd17787384f6d64540daab6"],"state_sha256":"730edab55fae73bb35456f6720388e4eb920f7fd152716c30b6b6c001b784edc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGdsYbJfoJU13hwUNzuv6N4abIi0ohgD2Shfi0MWdaf2+/qltP809hpGfx4/q81c6FTtlcow1XXNvQGkPoNRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:21:00.544655Z","bundle_sha256":"2761b13b27f287ba2b5b0d55cd72f8d8cb3a78a9e5163954e50fe19847e903e5"}}