{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GJCULHTALJP6OTK65WYDIJOS3H","short_pith_number":"pith:GJCULHTA","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"},"canonical_sha256":"3245459e605a5fe74d5eedb03425d2d9c4aa4ad399514603cdf14c43d9e464dd","source":{"kind":"arxiv","id":"1508.01784","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01784","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01784v1","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01784","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"GJCULHTALJP6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GJCULHTALJP6OTK6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GJCULHTA","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GJCULHTALJP6OTK65WYDIJOS3H","target":"record","payload":{"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"},"canonical_sha256":"3245459e605a5fe74d5eedb03425d2d9c4aa4ad399514603cdf14c43d9e464dd","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"},"source_kind":"arxiv","source_id":"1508.01784","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgrpiqFg96eTIcT/TWoXuV77h7HIoZ6b6cPn0GiHKASiZniwo6KtaQB9k2SZ8JDRvFpeoLBnynPZ6+tVsFw6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:08:36.687102Z"},"content_sha256":"e775a4e17f8910c2ce2902b07ae7e128c0419e37f6d235ec427017fec787b1b5","schema_version":"1.0","event_id":"sha256:e775a4e17f8910c2ce2902b07ae7e128c0419e37f6d235ec427017fec787b1b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GJCULHTALJP6OTK65WYDIJOS3H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNZdETh33XfTYHI70PDRZXBJkfxNNbSiN1PbDFCQu6IIxbJEIcJRU0T6InuouQNc8l8PE4e5XmHD6o9bCsnPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:08:36.687485Z"},"content_sha256":"83d1c3f865bb87c1362447a634abd1c5aa9107ab84aedadcfec8a307641ef605","schema_version":"1.0","event_id":"sha256:83d1c3f865bb87c1362447a634abd1c5aa9107ab84aedadcfec8a307641ef605"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/bundle.json","state_url":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJCULHTALJP6OTK65WYDIJOS3H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T10:08:36Z","links":{"resolver":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H","bundle":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/bundle.json","state":"https://pith.science/pith/GJCULHTALJP6OTK65WYDIJOS3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJCULHTALJP6OTK65WYDIJOS3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GJCULHTALJP6OTK65WYDIJOS3H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7cccd0f03acc786161e4cec4ccf4b9c32b4503045e7baec3778a35e22a554e01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-07T19:26:51Z","title_canon_sha256":"52d38fe4a5eb8396fcbce5df3f254efcfb854b9c00b830d928c788c98242132e"},"schema_version":"1.0","source":{"id":"1508.01784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01784","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01784v1","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01784","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"GJCULHTALJP6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GJCULHTALJP6OTK6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GJCULHTA","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:83d1c3f865bb87c1362447a634abd1c5aa9107ab84aedadcfec8a307641ef605","target":"graph","created_at":"2026-05-18T01:35:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Carla Oliveira, Leonardo de Lima, Vladimir Nikiforov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-07T19:26:51Z","title":"The clique number and the smallest Q-eigenvalue of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01784","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e775a4e17f8910c2ce2902b07ae7e128c0419e37f6d235ec427017fec787b1b5","target":"record","created_at":"2026-05-18T01:35:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7cccd0f03acc786161e4cec4ccf4b9c32b4503045e7baec3778a35e22a554e01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-07T19:26:51Z","title_canon_sha256":"52d38fe4a5eb8396fcbce5df3f254efcfb854b9c00b830d928c788c98242132e"},"schema_version":"1.0","source":{"id":"1508.01784","kind":"arxiv","version":1}},"canonical_sha256":"3245459e605a5fe74d5eedb03425d2d9c4aa4ad399514603cdf14c43d9e464dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3245459e605a5fe74d5eedb03425d2d9c4aa4ad399514603cdf14c43d9e464dd","first_computed_at":"2026-05-18T01:35:38.705404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:38.705404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l+Y8RP9vs813W5A/HyQ3i6WEDHqXCpSw8fJoOjpNKnaTGWB5dBSzv3LHenw4dAoo+dGkZft+D74WhSRUdBdsAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:38.705972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e775a4e17f8910c2ce2902b07ae7e128c0419e37f6d235ec427017fec787b1b5","sha256:83d1c3f865bb87c1362447a634abd1c5aa9107ab84aedadcfec8a307641ef605"],"state_sha256":"0d41dca165eb46428268683f7a3a56bba9bead8c2b87769f49179c89de5386b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhL41nS/ajzLipcuGI0DMg4KLuz3UOFpPuJdFujpeZd1J42o2PCbDlN8SbBStugUGNLiKd2oC7Ytjo7NtnGWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:08:36.689776Z","bundle_sha256":"cb184c5373fd6762425f1d8c0c121dfefc9ac7cd95b0bf5ac85b79c181a76553"}}