{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:V2YDY6U3OXGMFEEAVYZ6VNRLG2","short_pith_number":"pith:V2YDY6U3","schema_version":"1.0","canonical_sha256":"aeb03c7a9b75ccc29080ae33eab62b36b84f2f7674f5ac086897e5929fc86936","source":{"kind":"arxiv","id":"2608.04367","version":1},"attestation_state":"computed","paper":{"title":"Extremal Graphs for the Energy-Independence Number Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Seyed Ahmad Mojallal","submitted_at":"2026-08-05T02:14:05Z","abstract_excerpt":"For a graph $G$ of order $n$, let $\\mathcal E(G)$ denote its adjacency energy and let $\\alpha(G)$ denote its independence number. A recent theorem of Kumar and Pragada states that $$\\mathcal E(G)\\ge 2\\bigl(n-\\alpha(G)\\bigr).$$ We determine all graphs attaining equality. More precisely, equality holds if and only if every connected component of $G$ is an isolated vertex, a balanced complete multipartite graph, or a graph obtained by taking the disjoint union of $K_{a,\\ldots,a}$ and $K_{b,\\ldots,b}$, with the same number $r\\ge3$ of parts, and then completely joining corresponding parts."},"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":"2608.04367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T02:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"c05ae0883cec6efef20f5d46bd3c419521d97446eaf35d241f6d38c82dc394aa","abstract_canon_sha256":"13abbe969c1d20163e4b1985a967353c4ed9c8bf46b2134223a18501125b416e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:33:57.821219Z","signature_b64":"ps9HR3FFre4kwXS+Jf1Usx31BJjHsBXtEzAd1hQ8ODKqzzjQYpILQByL0z6R9jaeRSfj5BOFbJcujOJPfoVwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeb03c7a9b75ccc29080ae33eab62b36b84f2f7674f5ac086897e5929fc86936","last_reissued_at":"2026-08-06T01:33:57.819764Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:33:57.819764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal Graphs for the Energy-Independence Number Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Seyed Ahmad Mojallal","submitted_at":"2026-08-05T02:14:05Z","abstract_excerpt":"For a graph $G$ of order $n$, let $\\mathcal E(G)$ denote its adjacency energy and let $\\alpha(G)$ denote its independence number. A recent theorem of Kumar and Pragada states that $$\\mathcal E(G)\\ge 2\\bigl(n-\\alpha(G)\\bigr).$$ We determine all graphs attaining equality. More precisely, equality holds if and only if every connected component of $G$ is an isolated vertex, a balanced complete multipartite graph, or a graph obtained by taking the disjoint union of $K_{a,\\ldots,a}$ and $K_{b,\\ldots,b}$, with the same number $r\\ge3$ of parts, and then completely joining corresponding parts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04367","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/2608.04367/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.04367","created_at":"2026-08-06T01:33:57.821600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04367v1","created_at":"2026-08-06T01:33:57.821600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04367","created_at":"2026-08-06T01:33:57.821600+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2YDY6U3OXGM","created_at":"2026-08-06T01:33:57.821600+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2YDY6U3OXGMFEEA","created_at":"2026-08-06T01:33:57.821600+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2YDY6U3","created_at":"2026-08-06T01:33:57.821600+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/V2YDY6U3OXGMFEEAVYZ6VNRLG2","json":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2.json","graph_json":"https://pith.science/api/pith-number/V2YDY6U3OXGMFEEAVYZ6VNRLG2/graph.json","events_json":"https://pith.science/api/pith-number/V2YDY6U3OXGMFEEAVYZ6VNRLG2/events.json","paper":"https://pith.science/paper/V2YDY6U3"},"agent_actions":{"view_html":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2","download_json":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2.json","view_paper":"https://pith.science/paper/V2YDY6U3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04367&json=true","fetch_graph":"https://pith.science/api/pith-number/V2YDY6U3OXGMFEEAVYZ6VNRLG2/graph.json","fetch_events":"https://pith.science/api/pith-number/V2YDY6U3OXGMFEEAVYZ6VNRLG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2/action/storage_attestation","attest_author":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2/action/author_attestation","sign_citation":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2/action/citation_signature","submit_replication":"https://pith.science/pith/V2YDY6U3OXGMFEEAVYZ6VNRLG2/action/replication_record"}},"created_at":"2026-08-06T01:33:57.821600+00:00","updated_at":"2026-08-06T01:33:57.821600+00:00"}