{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UURXV4J7CDILGKXBMWT2DDOGY4","short_pith_number":"pith:UURXV4J7","canonical_record":{"source":{"id":"2409.14956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T12:18:39Z","cross_cats_sorted":[],"title_canon_sha256":"a5e0be139a6a1fb4b828c51faceb8ac5267db04748db912da3dddfd7b9fa4af9","abstract_canon_sha256":"87374706520f11070f3a66daa8e1c6a20b62e3511b1cff3d51b6457d5ff72bdd"},"schema_version":"1.0"},"canonical_sha256":"a5237af13f10d0b32ae165a7a18dc6c73320804cb8b4e8b7887d32a34c578143","source":{"kind":"arxiv","id":"2409.14956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.14956","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"2409.14956v1","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14956","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"UURXV4J7CDIL","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"pith_short_16","alias_value":"UURXV4J7CDILGKXB","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"pith_short_8","alias_value":"UURXV4J7","created_at":"2026-07-05T09:10:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UURXV4J7CDILGKXBMWT2DDOGY4","target":"record","payload":{"canonical_record":{"source":{"id":"2409.14956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T12:18:39Z","cross_cats_sorted":[],"title_canon_sha256":"a5e0be139a6a1fb4b828c51faceb8ac5267db04748db912da3dddfd7b9fa4af9","abstract_canon_sha256":"87374706520f11070f3a66daa8e1c6a20b62e3511b1cff3d51b6457d5ff72bdd"},"schema_version":"1.0"},"canonical_sha256":"a5237af13f10d0b32ae165a7a18dc6c73320804cb8b4e8b7887d32a34c578143","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:33.988163Z","signature_b64":"a98icphFTV9n5ysHniuvRlfv8/nE+/8euUYskYSJRRE7aDX1tlPF1VAms/jXV4QztuwNA2zJb8idDd/ShollDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5237af13f10d0b32ae165a7a18dc6c73320804cb8b4e8b7887d32a34c578143","last_reissued_at":"2026-07-05T09:10:33.987692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:33.987692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.14956","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-05T09:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGTNOaJnnvWPowIQvqUnPbQZGw6OB3Wjmd7XbIl8LFOka5vm2U3Fbxk/aBYnHIM5dN/+Ov8e1V65Gc7xaVh0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:27:03.608058Z"},"content_sha256":"fcc590c645e11f7c478eca419767af40230eecc5f85abdcb3baab96bc3e8c488","schema_version":"1.0","event_id":"sha256:fcc590c645e11f7c478eca419767af40230eecc5f85abdcb3baab96bc3e8c488"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UURXV4J7CDILGKXBMWT2DDOGY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree Deviation and Spectral Radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Florian Werner","submitted_at":"2024-09-23T12:18:39Z","abstract_excerpt":"For a finite, simple, and undirected graph $G$ with $n$ vertices, $m$ edges, and largest eigenvalue $\\lambda$, Nikiforov introduced the degree deviation of $G$ as $s=\\sum_{u\\in V(G)}\\left|d_G(u)-\\frac{2m}{n}\\right|$. Contributing to a conjecture of Nikiforov, we show $\\lambda-\\frac{2m}{n}\\leq \\sqrt{\\frac{2s}{3}}$. For our result, we show that the largest eigenvalue of a graph that arises from a bipartite graph with $m_{A,B}$ edges by adding $m_A$ edges within one of the two partite sets is at most $\\sqrt{m_A+m_{A,B}+\\sqrt{m_A^2+2m_Am_{A,B}}}$, which is a common generalization of results due to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14956","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/2409.14956/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-05T09:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvsbAHPSwOwR38wJhkYyhwTMJnu97XlK7Xg4lriD/j/4NlHHe6R5HJtzPMcxmEm8uYDmv717YbUP1IVPayRgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:27:03.608878Z"},"content_sha256":"3ece064b891ca17bdbeae6c60ae11cd48960ca0de648ccb2af12bc59074ea73b","schema_version":"1.0","event_id":"sha256:3ece064b891ca17bdbeae6c60ae11cd48960ca0de648ccb2af12bc59074ea73b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UURXV4J7CDILGKXBMWT2DDOGY4/bundle.json","state_url":"https://pith.science/pith/UURXV4J7CDILGKXBMWT2DDOGY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UURXV4J7CDILGKXBMWT2DDOGY4/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-07T06:27:03Z","links":{"resolver":"https://pith.science/pith/UURXV4J7CDILGKXBMWT2DDOGY4","bundle":"https://pith.science/pith/UURXV4J7CDILGKXBMWT2DDOGY4/bundle.json","state":"https://pith.science/pith/UURXV4J7CDILGKXBMWT2DDOGY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UURXV4J7CDILGKXBMWT2DDOGY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UURXV4J7CDILGKXBMWT2DDOGY4","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":"87374706520f11070f3a66daa8e1c6a20b62e3511b1cff3d51b6457d5ff72bdd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T12:18:39Z","title_canon_sha256":"a5e0be139a6a1fb4b828c51faceb8ac5267db04748db912da3dddfd7b9fa4af9"},"schema_version":"1.0","source":{"id":"2409.14956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.14956","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"2409.14956v1","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14956","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"UURXV4J7CDIL","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"pith_short_16","alias_value":"UURXV4J7CDILGKXB","created_at":"2026-07-05T09:10:33Z"},{"alias_kind":"pith_short_8","alias_value":"UURXV4J7","created_at":"2026-07-05T09:10:33Z"}],"graph_snapshots":[{"event_id":"sha256:3ece064b891ca17bdbeae6c60ae11cd48960ca0de648ccb2af12bc59074ea73b","target":"graph","created_at":"2026-07-05T09:10:33Z","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/2409.14956/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a finite, simple, and undirected graph $G$ with $n$ vertices, $m$ edges, and largest eigenvalue $\\lambda$, Nikiforov introduced the degree deviation of $G$ as $s=\\sum_{u\\in V(G)}\\left|d_G(u)-\\frac{2m}{n}\\right|$. Contributing to a conjecture of Nikiforov, we show $\\lambda-\\frac{2m}{n}\\leq \\sqrt{\\frac{2s}{3}}$. For our result, we show that the largest eigenvalue of a graph that arises from a bipartite graph with $m_{A,B}$ edges by adding $m_A$ edges within one of the two partite sets is at most $\\sqrt{m_A+m_{A,B}+\\sqrt{m_A^2+2m_Am_{A,B}}}$, which is a common generalization of results due to","authors_text":"Dieter Rautenbach, Florian Werner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T12:18:39Z","title":"Degree Deviation and Spectral Radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14956","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:fcc590c645e11f7c478eca419767af40230eecc5f85abdcb3baab96bc3e8c488","target":"record","created_at":"2026-07-05T09:10:33Z","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":"87374706520f11070f3a66daa8e1c6a20b62e3511b1cff3d51b6457d5ff72bdd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-23T12:18:39Z","title_canon_sha256":"a5e0be139a6a1fb4b828c51faceb8ac5267db04748db912da3dddfd7b9fa4af9"},"schema_version":"1.0","source":{"id":"2409.14956","kind":"arxiv","version":1}},"canonical_sha256":"a5237af13f10d0b32ae165a7a18dc6c73320804cb8b4e8b7887d32a34c578143","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5237af13f10d0b32ae165a7a18dc6c73320804cb8b4e8b7887d32a34c578143","first_computed_at":"2026-07-05T09:10:33.987692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:10:33.987692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a98icphFTV9n5ysHniuvRlfv8/nE+/8euUYskYSJRRE7aDX1tlPF1VAms/jXV4QztuwNA2zJb8idDd/ShollDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:10:33.988163Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.14956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcc590c645e11f7c478eca419767af40230eecc5f85abdcb3baab96bc3e8c488","sha256:3ece064b891ca17bdbeae6c60ae11cd48960ca0de648ccb2af12bc59074ea73b"],"state_sha256":"c43ed42a270395bfef61ff57ee71274ae6dcfa4962a15dac6093bed180491b57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdpEnOeMCOS5hRekDTejUJ0OyUqk4zIyNvTPlUwy//KAg2j7Y8SkXXmHjBVljZuH7QtWua5+x/mBtxS2kktMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:27:03.612450Z","bundle_sha256":"292379cca4a8fc51afd64f88eae7782debe5bd7a9ce56fab75fedab0ecca6195"}}