{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GJCULHTALJP6OTK65WYDIJOS3H","short_pith_number":"pith:GJCULHTA","schema_version":"1.0","canonical_sha256":"3245459e605a5fe74d5eedb03425d2d9c4aa4ad399514603cdf14c43d9e464dd","source":{"kind":"arxiv","id":"1508.01784","version":1},"attestation_state":"computed","paper":{"title":"The clique number and the smallest Q-eigenvalue of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carla Oliveira, Leonardo de Lima, Vladimir Nikiforov","submitted_at":"2015-08-07T19:26:51Z","abstract_excerpt":"Let $q_{\\min}(G)$ stand for the smallest eigenvalue of the signless Laplacian of a graph $G$ of order $n.$ This paper gives some results on the following extremal problem:\n  How large can $q_\\min\\left( G\\right) $ be if $G$ is a graph of order $n,$ with no complete subgraph of order $r+1?$\n  It is shown that this problem is related to the well-known topic of making graphs bipartite. Using known classical results, several bounds on $q_{\\min}$ are obtained, thus extending previous work of Brandt for regular graphs.\n  In addition, using graph blowups, a general asymptotic result about the maximum "},"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":"1508.01784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-07T19:26:51Z","cross_cats_sorted":[],"title_canon_sha256":"52d38fe4a5eb8396fcbce5df3f254efcfb854b9c00b830d928c788c98242132e","abstract_canon_sha256":"7cccd0f03acc786161e4cec4ccf4b9c32b4503045e7baec3778a35e22a554e01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:38.705972Z","signature_b64":"l+Y8RP9vs813W5A/HyQ3i6WEDHqXCpSw8fJoOjpNKnaTGWB5dBSzv3LHenw4dAoo+dGkZft+D74WhSRUdBdsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3245459e605a5fe74d5eedb03425d2d9c4aa4ad399514603cdf14c43d9e464dd","last_reissued_at":"2026-05-18T01:35:38.705404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:38.705404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The clique number and the smallest Q-eigenvalue of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carla Oliveira, Leonardo de Lima, Vladimir Nikiforov","submitted_at":"2015-08-07T19:26:51Z","abstract_excerpt":"Let $q_{\\min}(G)$ stand for the smallest eigenvalue of the signless Laplacian of a graph $G$ of order $n.$ This paper gives some results on the following extremal problem:\n  How large can $q_\\min\\left( G\\right) $ be if $G$ is a graph of order $n,$ with no complete subgraph of order $r+1?$\n  It is shown that this problem is related to the well-known topic of making graphs bipartite. Using known classical results, several bounds on $q_{\\min}$ are obtained, thus extending previous work of Brandt for regular graphs.\n  In addition, using graph blowups, a general asymptotic result about the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01784","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":"1508.01784","created_at":"2026-05-18T01:35:38.705495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01784v1","created_at":"2026-05-18T01:35:38.705495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01784","created_at":"2026-05-18T01:35:38.705495+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJCULHTALJP6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJCULHTALJP6OTK6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJCULHTA","created_at":"2026-05-18T12:29:22.688609+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/GJCULHTALJP6OTK65WYDIJOS3H","json":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H.json","graph_json":"https://pith.science/api/pith-number/GJCULHTALJP6OTK65WYDIJOS3H/graph.json","events_json":"https://pith.science/api/pith-number/GJCULHTALJP6OTK65WYDIJOS3H/events.json","paper":"https://pith.science/paper/GJCULHTA"},"agent_actions":{"view_html":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H","download_json":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H.json","view_paper":"https://pith.science/paper/GJCULHTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01784&json=true","fetch_graph":"https://pith.science/api/pith-number/GJCULHTALJP6OTK65WYDIJOS3H/graph.json","fetch_events":"https://pith.science/api/pith-number/GJCULHTALJP6OTK65WYDIJOS3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/action/storage_attestation","attest_author":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/action/author_attestation","sign_citation":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/action/citation_signature","submit_replication":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/action/replication_record"}},"created_at":"2026-05-18T01:35:38.705495+00:00","updated_at":"2026-05-18T01:35:38.705495+00:00"}