{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:X6SA3TDORRJ23TW456VXN3LDVJ","short_pith_number":"pith:X6SA3TDO","schema_version":"1.0","canonical_sha256":"bfa40dcc6e8c53adcedcefab76ed63aa65e4a71af527b9795acb80e05cbe18b1","source":{"kind":"arxiv","id":"2509.05814","version":1},"attestation_state":"computed","paper":{"title":"A graph energy conjecture through the lenses of semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aida Abiad, Emanuel Juliano, Gabriel Coutinho, Luuk Reijnders","submitted_at":"2025-09-06T19:16:49Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices with independence number $\\alpha(G)$. Let $\\mathcal{E}(G)$ be the energy of a graph, defined as the sum of the absolute values of the adjacency eigenvalues of $G$. Using Graffiti, Fajtlowicz conjectured in the 1980s that $$\\frac{1}{2}\\mathcal{E}(G) \\geq n - \\alpha(G).$$ In this paper we derive a semidefinite program formulation of the graph energy, and we use it to obtain several results that constitute a first step towards proving this conjecture. In particular, we show that $$\\frac{1}{2}\\mathcal{E}(G) \\geq n - \\chi_f(\\overline{G}) \\quad \\text{ and } \\quad \\"},"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":"2509.05814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-06T19:16:49Z","cross_cats_sorted":[],"title_canon_sha256":"66db0db224aeac0aab5bb2a382e31bfe7915d92f5f43daa759f3fd1ef3890da2","abstract_canon_sha256":"25d1e568d28dcd7dacbbad322e6ce5645ee7c13a0ab7457e4f87923a5b8084c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:24.664366Z","signature_b64":"8IGxR/0xWL2G7vThxr1dIOS26AI/MfbPUgzuIIYU3paLUmGYLUN8DGxYzB9n+5NzFkBbNCU69dk6K6s7cea2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa40dcc6e8c53adcedcefab76ed63aa65e4a71af527b9795acb80e05cbe18b1","last_reissued_at":"2026-07-05T12:06:24.663915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:24.663915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A graph energy conjecture through the lenses of semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aida Abiad, Emanuel Juliano, Gabriel Coutinho, Luuk Reijnders","submitted_at":"2025-09-06T19:16:49Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices with independence number $\\alpha(G)$. Let $\\mathcal{E}(G)$ be the energy of a graph, defined as the sum of the absolute values of the adjacency eigenvalues of $G$. Using Graffiti, Fajtlowicz conjectured in the 1980s that $$\\frac{1}{2}\\mathcal{E}(G) \\geq n - \\alpha(G).$$ In this paper we derive a semidefinite program formulation of the graph energy, and we use it to obtain several results that constitute a first step towards proving this conjecture. In particular, we show that $$\\frac{1}{2}\\mathcal{E}(G) \\geq n - \\chi_f(\\overline{G}) \\quad \\text{ and } \\quad \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.05814","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/2509.05814/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":"2509.05814","created_at":"2026-07-05T12:06:24.663976+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.05814v1","created_at":"2026-07-05T12:06:24.663976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05814","created_at":"2026-07-05T12:06:24.663976+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6SA3TDORRJ2","created_at":"2026-07-05T12:06:24.663976+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6SA3TDORRJ23TW4","created_at":"2026-07-05T12:06:24.663976+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6SA3TDO","created_at":"2026-07-05T12:06:24.663976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04367","citing_title":"Extremal Graphs for the Energy-Independence Number Inequality","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ","json":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ.json","graph_json":"https://pith.science/api/pith-number/X6SA3TDORRJ23TW456VXN3LDVJ/graph.json","events_json":"https://pith.science/api/pith-number/X6SA3TDORRJ23TW456VXN3LDVJ/events.json","paper":"https://pith.science/paper/X6SA3TDO"},"agent_actions":{"view_html":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ","download_json":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ.json","view_paper":"https://pith.science/paper/X6SA3TDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.05814&json=true","fetch_graph":"https://pith.science/api/pith-number/X6SA3TDORRJ23TW456VXN3LDVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/X6SA3TDORRJ23TW456VXN3LDVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ/action/storage_attestation","attest_author":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ/action/author_attestation","sign_citation":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ/action/citation_signature","submit_replication":"https://pith.science/pith/X6SA3TDORRJ23TW456VXN3LDVJ/action/replication_record"}},"created_at":"2026-07-05T12:06:24.663976+00:00","updated_at":"2026-07-05T12:06:24.663976+00:00"}