{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BNVYZXBCVWMEVSX7RCGU6SK73Z","short_pith_number":"pith:BNVYZXBC","canonical_record":{"source":{"id":"2607.27452","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T20:34:55Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"646e2c2b150e1009562b5549728e54685582b69aa9f87bf08dc8de3ca4400fe0","abstract_canon_sha256":"7af15f927f4f3fd207a771e780ea799ba6c1ee4a7c5d6023781d42f1e44f7b6e"},"schema_version":"1.0"},"canonical_sha256":"0b6b8cdc22ad984acaff888d4f495fde76947f16cc89b4d2b5aa13994890c6f8","source":{"kind":"arxiv","id":"2607.27452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27452","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27452v1","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27452","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"BNVYZXBCVWME","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"pith_short_16","alias_value":"BNVYZXBCVWMEVSX7","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"pith_short_8","alias_value":"BNVYZXBC","created_at":"2026-07-31T00:12:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BNVYZXBCVWMEVSX7RCGU6SK73Z","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27452","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T20:34:55Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"646e2c2b150e1009562b5549728e54685582b69aa9f87bf08dc8de3ca4400fe0","abstract_canon_sha256":"7af15f927f4f3fd207a771e780ea799ba6c1ee4a7c5d6023781d42f1e44f7b6e"},"schema_version":"1.0"},"canonical_sha256":"0b6b8cdc22ad984acaff888d4f495fde76947f16cc89b4d2b5aa13994890c6f8","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b6b8cdc22ad984acaff888d4f495fde76947f16cc89b4d2b5aa13994890c6f8","last_reissued_at":"2026-07-31T00:12:12.561895Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T00:12:12.561895Z"},"source_kind":"arxiv","source_id":"2607.27452","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-31T00:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uG2XHBpla2J6GhvH9rl2pzn9zdtRyhZbqq58sJVhc4NeJXj5g8EPHi3dZlu0Nc8azsTVcc1BmhNiSnStGBhOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:05:31.075696Z"},"content_sha256":"f779e1602ccd4978f2757d41511b0f14cd330d150c95464e2e6bf824a608c02d","schema_version":"1.0","event_id":"sha256:f779e1602ccd4978f2757d41511b0f14cd330d150c95464e2e6bf824a608c02d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BNVYZXBCVWMEVSX7RCGU6SK73Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counterexamples, Spectral Obstructions, and Deletion Stability for WOW-284","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Samuil Petkov","submitted_at":"2026-07-29T20:34:55Z","abstract_excerpt":"WOW-284 asserts that the minimum dual degree of every connected graph of order at least three and girth at least five does not exceed the negative of its least distance eigenvalue. We refute it with exact counterexamples of orders $38,39,40,42$, and $50$, and develop a structural theory of the failure. For a connected $k$-regular graph of girth at least five and diameter three, we prove $\\delta^*(G)+\\lambda_{\\min}(D(G))=2k-2-\\max_{\\theta\\ne k}(\\theta+1)^2$. Here $\\theta$ ranges over the nonprincipal adjacency eigenvalues. We further prove that every regular strict counterexample has degree at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27452","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.27452/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-31T00:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqhWu7zqpAYFMdCImWBoFH9o7jBH3KmY9cOxuLn/tz+gOC+d22JTROm3Dop35stjJqzNeLnY/qqPbhsTUpIwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:05:31.076242Z"},"content_sha256":"905278ec8463bc20f9b32d4d1e1e4a530bd4c5a2c06b43ffd5aad9c05dc18671","schema_version":"1.0","event_id":"sha256:905278ec8463bc20f9b32d4d1e1e4a530bd4c5a2c06b43ffd5aad9c05dc18671"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:BNVYZXBCVWMEVSX7RCGU6SK73Z","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.disc.2004.08.029 resolves to 'Girth 5 graphs from relative difference sets'. A reader following the printed text alone cannot reach it.","snippet":"Leif K. Jørgensen. Girth 5 graphs from relative difference sets.Discrete Mathematics, 293(1–3):177–184, 2005. doi: 10.1016/j.disc.2004. 08.029","arxiv_id":"2607.27452","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":"Girth 5 graphs from relative difference sets","printed_excerpt":"10.1016/j.disc.2004","reconstructed_doi":"10.1016/j.disc.2004.08.029"},"severity":"advisory","ref_index":19,"audited_at":"2026-07-31T00:31:36.609923Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.disc.2004.08.029","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0b0a109e1a1051231ad821bffee8deca9a0a062481448f021829f3dcc799c13e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Girth 5 graphs from relative difference sets","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14142,"payload_sha256":"1d50197b4c8b661eb4b95367bbacbad81caf434ca4102c553fdc2836c7ffa17b","signature_b64":null,"signing_key_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-31T00:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqEzdb6/TGeUp0YqW+MMB+EbN4oPaPKXwew8NDPnk/COwZAJ1aIUdSO8IF1xn0sJpVxXsFat/EiLTKSelwaBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:05:31.080191Z"},"content_sha256":"3d77b9f37b680c40105b45081471976c67da834e8bff2f7004b3b30015022bf3","schema_version":"1.0","event_id":"sha256:3d77b9f37b680c40105b45081471976c67da834e8bff2f7004b3b30015022bf3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:BNVYZXBCVWMEVSX7RCGU6SK73Z","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1002/(sici)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G resolves to 'Fast generation of regular graphs and construction of cages'. A reader following the printed text alone cannot reach it.","snippet":"Markus Meringer. Fast generation of regular graphs and construction of cages.Journal of Graph Theory, 30(2):137–146, 1999. doi: 10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","arxiv_id":"2607.27452","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":"Fast generation of regular graphs and construction of cages","printed_excerpt":"10.1002/(sici)1097-0118(199902)30:2","reconstructed_doi":"10.1002/(sici)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G"},"severity":"advisory","ref_index":13,"audited_at":"2026-07-31T00:31:36.609923Z","event_type":"pith.integrity.v1","detected_doi":"10.1002/(sici)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a4c87d15fbd79d0a9117acdb4019a3c425bc1bd0f6d62e44d11f374f240ff90d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Fast generation of regular graphs and construction of cages","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14141,"payload_sha256":"5372bff22ba1a524f80d72a24ffcfb1d3a5950705c309a915cf015663e899377","signature_b64":null,"signing_key_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-31T00:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBAG2iHB5Wsm5KCllnS5tj4b1myuGcw0ezTQjgdyM1EhgIl20XkSfIz2fXANM/F6E7U6LO6djzEsFpes3mG9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:05:31.080599Z"},"content_sha256":"dce1f2adef069b1253a6560a1a74630b69a8aa82a6045d316f9a1989a984bcda","schema_version":"1.0","event_id":"sha256:dce1f2adef069b1253a6560a1a74630b69a8aa82a6045d316f9a1989a984bcda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNVYZXBCVWMEVSX7RCGU6SK73Z/bundle.json","state_url":"https://pith.science/pith/BNVYZXBCVWMEVSX7RCGU6SK73Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNVYZXBCVWMEVSX7RCGU6SK73Z/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-13T04:05:31Z","links":{"resolver":"https://pith.science/pith/BNVYZXBCVWMEVSX7RCGU6SK73Z","bundle":"https://pith.science/pith/BNVYZXBCVWMEVSX7RCGU6SK73Z/bundle.json","state":"https://pith.science/pith/BNVYZXBCVWMEVSX7RCGU6SK73Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNVYZXBCVWMEVSX7RCGU6SK73Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BNVYZXBCVWMEVSX7RCGU6SK73Z","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7af15f927f4f3fd207a771e780ea799ba6c1ee4a7c5d6023781d42f1e44f7b6e","cross_cats_sorted":["math.SP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T20:34:55Z","title_canon_sha256":"646e2c2b150e1009562b5549728e54685582b69aa9f87bf08dc8de3ca4400fe0"},"schema_version":"1.0","source":{"id":"2607.27452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27452","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27452v1","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27452","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"BNVYZXBCVWME","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"pith_short_16","alias_value":"BNVYZXBCVWMEVSX7","created_at":"2026-07-31T00:12:12Z"},{"alias_kind":"pith_short_8","alias_value":"BNVYZXBC","created_at":"2026-07-31T00:12:12Z"}],"graph_snapshots":[{"event_id":"sha256:905278ec8463bc20f9b32d4d1e1e4a530bd4c5a2c06b43ffd5aad9c05dc18671","target":"graph","created_at":"2026-07-31T00:12: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/2607.27452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"WOW-284 asserts that the minimum dual degree of every connected graph of order at least three and girth at least five does not exceed the negative of its least distance eigenvalue. We refute it with exact counterexamples of orders $38,39,40,42$, and $50$, and develop a structural theory of the failure. For a connected $k$-regular graph of girth at least five and diameter three, we prove $\\delta^*(G)+\\lambda_{\\min}(D(G))=2k-2-\\max_{\\theta\\ne k}(\\theta+1)^2$. Here $\\theta$ ranges over the nonprincipal adjacency eigenvalues. We further prove that every regular strict counterexample has degree at ","authors_text":"Samuil Petkov","cross_cats":["math.SP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T20:34:55Z","title":"Counterexamples, Spectral Obstructions, and Deletion Stability for WOW-284"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27452","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:f779e1602ccd4978f2757d41511b0f14cd330d150c95464e2e6bf824a608c02d","target":"record","created_at":"2026-07-31T00:12: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":"7af15f927f4f3fd207a771e780ea799ba6c1ee4a7c5d6023781d42f1e44f7b6e","cross_cats_sorted":["math.SP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T20:34:55Z","title_canon_sha256":"646e2c2b150e1009562b5549728e54685582b69aa9f87bf08dc8de3ca4400fe0"},"schema_version":"1.0","source":{"id":"2607.27452","kind":"arxiv","version":1}},"canonical_sha256":"0b6b8cdc22ad984acaff888d4f495fde76947f16cc89b4d2b5aa13994890c6f8","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b6b8cdc22ad984acaff888d4f495fde76947f16cc89b4d2b5aa13994890c6f8","first_computed_at":"2026-07-31T00:12:12.561895Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T00:12:12.561895Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27452","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:3d77b9f37b680c40105b45081471976c67da834e8bff2f7004b3b30015022bf3","sha256:dce1f2adef069b1253a6560a1a74630b69a8aa82a6045d316f9a1989a984bcda"]}],"invalid_events":[],"applied_event_ids":["sha256:f779e1602ccd4978f2757d41511b0f14cd330d150c95464e2e6bf824a608c02d","sha256:905278ec8463bc20f9b32d4d1e1e4a530bd4c5a2c06b43ffd5aad9c05dc18671"],"state_sha256":"d82a2608ee382ef0bf7802200a6dae55a3243c9187be5b63a7bf6cedd4e5969c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0b0cUOeWEBz5neXwY74L7dI50kke1sBU6L9x1vsPK8HttnnFIrZlSGpDjXeZ5TJuJQNIt7QGv6jjF6OlwihBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T04:05:31.083124Z","bundle_sha256":"c7b011f7d2d452cff60cc586420a84bff0103074b3329b0a0f2b30276abeb84a"}}