{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6N4PUOB37LXZHZLI2ZBOEIFFJJ","short_pith_number":"pith:6N4PUOB3","schema_version":"1.0","canonical_sha256":"f378fa383bfaef93e568d642e220a54a6c64194f5a902a4bed63657ff6fbebaa","source":{"kind":"arxiv","id":"1207.5267","version":1},"attestation_state":"computed","paper":{"title":"The total irregularity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Darko Dimitrov, Hosam Abdo","submitted_at":"2012-07-22T23:27:20Z","abstract_excerpt":"In this note a new measure of irregularity of a simple undirected graph $G$ is introduced. It is named the total irregularity of a graph and is defined as $\\irr_t(G) = 1/2\\sum_{u,v \\in V(G)} |d_G(u)-d_G(v)|$, where $d_G(u)$ denotes the degree of a vertex $u \\in V(G)$. The graphs with maximal total irregularity are determined. It is also shown that among all trees of same order the star graph has the maximal total irregularity."},"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":"1207.5267","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-22T23:27:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d59defa3857bb372be064e0eb39eb1dddb07304089b5d165dfec9910acb0044b","abstract_canon_sha256":"7a41ed5a894c9ebe75024a630fa95a496fcf6b5d8f0e0a3ecd22e3396ea7e993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.096830Z","signature_b64":"YTBB1OVaguTra6dO048fXrrIAReopjoEBw6FwwPqDiDeCJc+VNuFhKxbvr60W1f54MxNF8psxVhOgDZQCCn1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f378fa383bfaef93e568d642e220a54a6c64194f5a902a4bed63657ff6fbebaa","last_reissued_at":"2026-05-18T02:21:08.096333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.096333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The total irregularity of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Darko Dimitrov, Hosam Abdo","submitted_at":"2012-07-22T23:27:20Z","abstract_excerpt":"In this note a new measure of irregularity of a simple undirected graph $G$ is introduced. It is named the total irregularity of a graph and is defined as $\\irr_t(G) = 1/2\\sum_{u,v \\in V(G)} |d_G(u)-d_G(v)|$, where $d_G(u)$ denotes the degree of a vertex $u \\in V(G)$. The graphs with maximal total irregularity are determined. It is also shown that among all trees of same order the star graph has the maximal total irregularity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5267","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":"1207.5267","created_at":"2026-05-18T02:21:08.096403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5267v1","created_at":"2026-05-18T02:21:08.096403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5267","created_at":"2026-05-18T02:21:08.096403+00:00"},{"alias_kind":"pith_short_12","alias_value":"6N4PUOB37LXZ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6N4PUOB37LXZHZLI","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6N4PUOB3","created_at":"2026-05-18T12:26:56.085431+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/6N4PUOB37LXZHZLI2ZBOEIFFJJ","json":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ.json","graph_json":"https://pith.science/api/pith-number/6N4PUOB37LXZHZLI2ZBOEIFFJJ/graph.json","events_json":"https://pith.science/api/pith-number/6N4PUOB37LXZHZLI2ZBOEIFFJJ/events.json","paper":"https://pith.science/paper/6N4PUOB3"},"agent_actions":{"view_html":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ","download_json":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ.json","view_paper":"https://pith.science/paper/6N4PUOB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5267&json=true","fetch_graph":"https://pith.science/api/pith-number/6N4PUOB37LXZHZLI2ZBOEIFFJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6N4PUOB37LXZHZLI2ZBOEIFFJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ/action/storage_attestation","attest_author":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ/action/author_attestation","sign_citation":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ/action/citation_signature","submit_replication":"https://pith.science/pith/6N4PUOB37LXZHZLI2ZBOEIFFJJ/action/replication_record"}},"created_at":"2026-05-18T02:21:08.096403+00:00","updated_at":"2026-05-18T02:21:08.096403+00:00"}