{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LKUME4CM5CEBCOGUJNRRMEYOPH","short_pith_number":"pith:LKUME4CM","schema_version":"1.0","canonical_sha256":"5aa8c2704ce8881138d44b6316130e79edcc961868b8ad368759a33a937e4f56","source":{"kind":"arxiv","id":"1806.00870","version":1},"attestation_state":"computed","paper":{"title":"On Construction of Upper and Lower Bounds for the HOMO-LUMO Spectral Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Sevcovic, Sona Pavlikova","submitted_at":"2018-06-03T20:28:25Z","abstract_excerpt":"In this paper we study spectral properties of graphs which are constructed from two given invertible graphs by bridging them over a bipartite graph. We analyze the so-called HOMO-LUMO spectral gap which is the difference between the smallest positive and largest negative eigenvalue of the adjacency matrix of a graph. We investigate its dependence on the bridging bipartite graph and we construct a mixed integer semidefinite program for maximization of the HOMO-LUMO gap with respect to the bridging bipartite graph. We also derive upper and lower bounds for the optimal HOMO-LUMO spectral graph by"},"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":"1806.00870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-03T20:28:25Z","cross_cats_sorted":[],"title_canon_sha256":"309a65cd67bf31157fb6e691c52a88cbc6dbe9c03ae60e2e4560cce1dbb64bc8","abstract_canon_sha256":"d6c58f24442893df8670b2fba94cd6bcf94e04635fa23d04c9069c0487c76d73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:09.828196Z","signature_b64":"ONORMa/Amg2J49EPlx6D2lZf+v/hq5/gSbpqgVWCNoU9pRfMNgiKbzmWfATiJalDS8LnGcapfQvFwJ4qd19yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa8c2704ce8881138d44b6316130e79edcc961868b8ad368759a33a937e4f56","last_reissued_at":"2026-05-18T00:02:09.827444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:09.827444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Construction of Upper and Lower Bounds for the HOMO-LUMO Spectral Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Sevcovic, Sona Pavlikova","submitted_at":"2018-06-03T20:28:25Z","abstract_excerpt":"In this paper we study spectral properties of graphs which are constructed from two given invertible graphs by bridging them over a bipartite graph. We analyze the so-called HOMO-LUMO spectral gap which is the difference between the smallest positive and largest negative eigenvalue of the adjacency matrix of a graph. We investigate its dependence on the bridging bipartite graph and we construct a mixed integer semidefinite program for maximization of the HOMO-LUMO gap with respect to the bridging bipartite graph. We also derive upper and lower bounds for the optimal HOMO-LUMO spectral graph by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00870","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":"1806.00870","created_at":"2026-05-18T00:02:09.827578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00870v1","created_at":"2026-05-18T00:02:09.827578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00870","created_at":"2026-05-18T00:02:09.827578+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKUME4CM5CEB","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKUME4CM5CEBCOGU","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKUME4CM","created_at":"2026-05-18T12:32:37.024351+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/LKUME4CM5CEBCOGUJNRRMEYOPH","json":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH.json","graph_json":"https://pith.science/api/pith-number/LKUME4CM5CEBCOGUJNRRMEYOPH/graph.json","events_json":"https://pith.science/api/pith-number/LKUME4CM5CEBCOGUJNRRMEYOPH/events.json","paper":"https://pith.science/paper/LKUME4CM"},"agent_actions":{"view_html":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH","download_json":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH.json","view_paper":"https://pith.science/paper/LKUME4CM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00870&json=true","fetch_graph":"https://pith.science/api/pith-number/LKUME4CM5CEBCOGUJNRRMEYOPH/graph.json","fetch_events":"https://pith.science/api/pith-number/LKUME4CM5CEBCOGUJNRRMEYOPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH/action/storage_attestation","attest_author":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH/action/author_attestation","sign_citation":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH/action/citation_signature","submit_replication":"https://pith.science/pith/LKUME4CM5CEBCOGUJNRRMEYOPH/action/replication_record"}},"created_at":"2026-05-18T00:02:09.827578+00:00","updated_at":"2026-05-18T00:02:09.827578+00:00"}