{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QFCEUGE7ETMYZLVOLWTT34CUFD","short_pith_number":"pith:QFCEUGE7","schema_version":"1.0","canonical_sha256":"81444a189f24d98caeae5da73df05428cfaa3ea76881f39ed3f87aff52398d6a","source":{"kind":"arxiv","id":"1308.3867","version":1},"attestation_state":"computed","paper":{"title":"A spectral bound for graph irregularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Goldberg","submitted_at":"2013-08-18T15:07:13Z","abstract_excerpt":"The imbalance of an edge $e=\\{u,v\\}$ in a graph is defined as $i(e)=|d(u)-d(v)|$, where $d(\\cdot)$ is the vertex degree. The irregularity $I(G)$ of $G$ is then defined as the sum of imbalances over all edges of $G$. This concept was introduced by Albertson who proved that $I(G) \\leq \\frac{n^{3}}{27}$ (where $n=|V(G)|$) and obtained stronger bounds for bipartite and triangle-free graphs. Since then a number of additional bounds were given by various authors. In this paper we prove a new upper bound, which improves a bound found by Zhou and Luo in 2011. Our bound involves the Laplacian spectral "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1308.3867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-18T15:07:13Z","cross_cats_sorted":[],"title_canon_sha256":"d63505825c3b11b9e23bb81d1b5be4d9ca4063a83a28d882bfba252e2d826577","abstract_canon_sha256":"ac31870ebef546df63585c445436e888fc519c2ad6630342f4e338b01876c091"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:42.303688Z","signature_b64":"/uTpTNWbw/QyAlW978B0PGzCKDtNA2bKkqlRhyWZYLhrZ202IAtT4MrQEX1rIKUbgMieZeJJPiBuSV7qHa63CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81444a189f24d98caeae5da73df05428cfaa3ea76881f39ed3f87aff52398d6a","last_reissued_at":"2026-05-18T03:15:42.303011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:42.303011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A spectral bound for graph irregularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Goldberg","submitted_at":"2013-08-18T15:07:13Z","abstract_excerpt":"The imbalance of an edge $e=\\{u,v\\}$ in a graph is defined as $i(e)=|d(u)-d(v)|$, where $d(\\cdot)$ is the vertex degree. The irregularity $I(G)$ of $G$ is then defined as the sum of imbalances over all edges of $G$. This concept was introduced by Albertson who proved that $I(G) \\leq \\frac{n^{3}}{27}$ (where $n=|V(G)|$) and obtained stronger bounds for bipartite and triangle-free graphs. Since then a number of additional bounds were given by various authors. In this paper we prove a new upper bound, which improves a bound found by Zhou and Luo in 2011. Our bound involves the Laplacian spectral "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3867","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.3867","created_at":"2026-05-18T03:15:42.303098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3867v1","created_at":"2026-05-18T03:15:42.303098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3867","created_at":"2026-05-18T03:15:42.303098+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFCEUGE7ETMY","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFCEUGE7ETMYZLVO","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFCEUGE7","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD","json":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD.json","graph_json":"https://pith.science/api/pith-number/QFCEUGE7ETMYZLVOLWTT34CUFD/graph.json","events_json":"https://pith.science/api/pith-number/QFCEUGE7ETMYZLVOLWTT34CUFD/events.json","paper":"https://pith.science/paper/QFCEUGE7"},"agent_actions":{"view_html":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD","download_json":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD.json","view_paper":"https://pith.science/paper/QFCEUGE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3867&json=true","fetch_graph":"https://pith.science/api/pith-number/QFCEUGE7ETMYZLVOLWTT34CUFD/graph.json","fetch_events":"https://pith.science/api/pith-number/QFCEUGE7ETMYZLVOLWTT34CUFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD/action/storage_attestation","attest_author":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD/action/author_attestation","sign_citation":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD/action/citation_signature","submit_replication":"https://pith.science/pith/QFCEUGE7ETMYZLVOLWTT34CUFD/action/replication_record"}},"created_at":"2026-05-18T03:15:42.303098+00:00","updated_at":"2026-05-18T03:15:42.303098+00:00"}