{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AIKH4MBSZLNBAVFOS7RJKHCFNY","short_pith_number":"pith:AIKH4MBS","canonical_record":{"source":{"id":"1306.0093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T10:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"3224c9d5dc5f8c1c6be3c006f1e56b281c85feb4df0ad72de68cfd0d517d3de5","abstract_canon_sha256":"f2afc3dbc4ecc4b8f6c5c7de2bd864d6163801d31d44a19ed5de8d65e651ae98"},"schema_version":"1.0"},"canonical_sha256":"02147e3032cada1054ae97e2951c456e368e5b7a61dc315df52dd86b11a9c8c7","source":{"kind":"arxiv","id":"1306.0093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0093","created_at":"2026-05-18T03:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0093v1","created_at":"2026-05-18T03:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0093","created_at":"2026-05-18T03:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"AIKH4MBSZLNB","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AIKH4MBSZLNBAVFO","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AIKH4MBS","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AIKH4MBSZLNBAVFOS7RJKHCFNY","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T10:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"3224c9d5dc5f8c1c6be3c006f1e56b281c85feb4df0ad72de68cfd0d517d3de5","abstract_canon_sha256":"f2afc3dbc4ecc4b8f6c5c7de2bd864d6163801d31d44a19ed5de8d65e651ae98"},"schema_version":"1.0"},"canonical_sha256":"02147e3032cada1054ae97e2951c456e368e5b7a61dc315df52dd86b11a9c8c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:56.157510Z","signature_b64":"vgRlX9+mvfOCYJveLRZ3cjTFPy7gjAn6+V5Pzn+GCS6jB+PyXzku7VBkDQsZtUajOOisy/HAUOuelVy4rExSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02147e3032cada1054ae97e2951c456e368e5b7a61dc315df52dd86b11a9c8c7","last_reissued_at":"2026-05-18T03:21:56.157094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:56.157094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0093","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-18T03:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PsUpF8xfqLinNfEzfnbgAwWF5eQysOfZyjuyJRWXUFkpA8brKCpNaKyOYjq90kCvUbtM7puPzfuI8aqJL+I4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:05:36.330491Z"},"content_sha256":"4fdc570675fcf2d3467e14769ff60194bafc3ef79753607d65f114d978329526","schema_version":"1.0","event_id":"sha256:4fdc570675fcf2d3467e14769ff60194bafc3ef79753607d65f114d978329526"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AIKH4MBSZLNBAVFOS7RJKHCFNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a conjecture for the signless Laplacian eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jieshan Yang, Lihua You","submitted_at":"2013-06-01T10:37:03Z","abstract_excerpt":"Let $G$ be a simple graph with $n$ vertices and $e(G)$ edges, and $q_1(G)\\geq q_2(G)\\geq\\cdots\\geq q_n(G)\\geq0$ be the signless Laplacian eigenvalues of $G.$ Let $S_k^+(G)=\\sum_{i=1}^{k}q_i(G),$ where $k=1, 2, \\ldots, n.$ F. Ashraf et al. conjectured that $S_k^+(G)\\leq e(G)+\\binom{k+1}{2}$ for $k=1, 2, \\ldots, n.$ In this paper, we give various upper bounds for $S_k^+(G),$ and prove that this conjecture is true for the following cases: connected graph with sufficiently large $k,$ unicyclic graphs and bicyclic graphs for all $k,$ and tricyclic graphs when $k\\neq 3.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0093","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-18T03:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"793rDyHG8sKQ3fuf0zfKJZvwB6MU3hJLn5JuYvL3ddJDsRRYtLw5pcQSFRx5AEjdkqo9RIbG6k9m1waXv1y2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:05:36.331222Z"},"content_sha256":"f2a68cc17b8adee64b307076ddb5d108fa805155c384ef03a2dc0bbe023c20d8","schema_version":"1.0","event_id":"sha256:f2a68cc17b8adee64b307076ddb5d108fa805155c384ef03a2dc0bbe023c20d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIKH4MBSZLNBAVFOS7RJKHCFNY/bundle.json","state_url":"https://pith.science/pith/AIKH4MBSZLNBAVFOS7RJKHCFNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIKH4MBSZLNBAVFOS7RJKHCFNY/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-06-12T03:05:36Z","links":{"resolver":"https://pith.science/pith/AIKH4MBSZLNBAVFOS7RJKHCFNY","bundle":"https://pith.science/pith/AIKH4MBSZLNBAVFOS7RJKHCFNY/bundle.json","state":"https://pith.science/pith/AIKH4MBSZLNBAVFOS7RJKHCFNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIKH4MBSZLNBAVFOS7RJKHCFNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AIKH4MBSZLNBAVFOS7RJKHCFNY","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":"f2afc3dbc4ecc4b8f6c5c7de2bd864d6163801d31d44a19ed5de8d65e651ae98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T10:37:03Z","title_canon_sha256":"3224c9d5dc5f8c1c6be3c006f1e56b281c85feb4df0ad72de68cfd0d517d3de5"},"schema_version":"1.0","source":{"id":"1306.0093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0093","created_at":"2026-05-18T03:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0093v1","created_at":"2026-05-18T03:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0093","created_at":"2026-05-18T03:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"AIKH4MBSZLNB","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AIKH4MBSZLNBAVFO","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AIKH4MBS","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:f2a68cc17b8adee64b307076ddb5d108fa805155c384ef03a2dc0bbe023c20d8","target":"graph","created_at":"2026-05-18T03:21:56Z","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 $G$ be a simple graph with $n$ vertices and $e(G)$ edges, and $q_1(G)\\geq q_2(G)\\geq\\cdots\\geq q_n(G)\\geq0$ be the signless Laplacian eigenvalues of $G.$ Let $S_k^+(G)=\\sum_{i=1}^{k}q_i(G),$ where $k=1, 2, \\ldots, n.$ F. Ashraf et al. conjectured that $S_k^+(G)\\leq e(G)+\\binom{k+1}{2}$ for $k=1, 2, \\ldots, n.$ In this paper, we give various upper bounds for $S_k^+(G),$ and prove that this conjecture is true for the following cases: connected graph with sufficiently large $k,$ unicyclic graphs and bicyclic graphs for all $k,$ and tricyclic graphs when $k\\neq 3.$","authors_text":"Jieshan Yang, Lihua You","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T10:37:03Z","title":"On a conjecture for the signless Laplacian eigenvalues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0093","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:4fdc570675fcf2d3467e14769ff60194bafc3ef79753607d65f114d978329526","target":"record","created_at":"2026-05-18T03:21:56Z","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":"f2afc3dbc4ecc4b8f6c5c7de2bd864d6163801d31d44a19ed5de8d65e651ae98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-01T10:37:03Z","title_canon_sha256":"3224c9d5dc5f8c1c6be3c006f1e56b281c85feb4df0ad72de68cfd0d517d3de5"},"schema_version":"1.0","source":{"id":"1306.0093","kind":"arxiv","version":1}},"canonical_sha256":"02147e3032cada1054ae97e2951c456e368e5b7a61dc315df52dd86b11a9c8c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02147e3032cada1054ae97e2951c456e368e5b7a61dc315df52dd86b11a9c8c7","first_computed_at":"2026-05-18T03:21:56.157094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:56.157094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vgRlX9+mvfOCYJveLRZ3cjTFPy7gjAn6+V5Pzn+GCS6jB+PyXzku7VBkDQsZtUajOOisy/HAUOuelVy4rExSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:56.157510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fdc570675fcf2d3467e14769ff60194bafc3ef79753607d65f114d978329526","sha256:f2a68cc17b8adee64b307076ddb5d108fa805155c384ef03a2dc0bbe023c20d8"],"state_sha256":"c7c09c990fd1f6676abd87fe33728037c2e4c2dd64a21f9de2063e48f51ca47f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHHeXZzW9PXRNMCqFPvUn9I2XtjSWCRVmuSyhvCjVFnn/sJqFaImnvKlc4SmqBXb/VGhl8/scVN4ozYHkL54Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:05:36.335863Z","bundle_sha256":"e7d9eace61098f2f21174ebcac3bff4e70fdf9c89da014ccfb8021c6d5d52bbc"}}