{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W2VYWGLGWLLNZFJIRHBVEAWIMA","short_pith_number":"pith:W2VYWGLG","schema_version":"1.0","canonical_sha256":"b6ab8b1966b2d6dc952889c35202c8601c59dca680a0a429ff70749a5beab086","source":{"kind":"arxiv","id":"1308.1652","version":1},"attestation_state":"computed","paper":{"title":"Maxima of the Q-index: forbidden 4-cycle and 5-cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Laura Patuzzi, Maria Aguieiras A. de Freitas, Vladimir Nikiforov","submitted_at":"2013-08-07T18:33:06Z","abstract_excerpt":"This paper gives tight upper bounds on the largest eigenvalue q(G) of the signless Laplacian of graphs with no 4-cycle and no 5-cycle. If n is odd, let F_{n} be the friendship graph of order n; if n is even, let F_{n} be F_{n-1} with an edge hanged to its center. It is shown that if G is a graph of order n, with no 4-cycle, then q(G)<q(F_{n}), unless G=F_{n}. Let S_{n,k} be the join of a complete graph of order k and an independent set of order n-k. It is shown that if G is a graph of order n, with no 5-cycle, then q(G)<q(S_{n,2}), unless G=S_{n,k}. It is shown that these results are significa"},"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":"1308.1652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-07T18:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"60a96e89d8fa8de106b67a0f3b2ebc4d2b8bf32865e61a9a2445710e84c60f4f","abstract_canon_sha256":"c4a86c69c700ff9eefd2301bb1c5ba0da7a0e23c099943546dffc9ac9968b4e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:30.594407Z","signature_b64":"thY4wsP6aAcP05zcEz4xmJX31tT6D77c45hIGlgWXiGWwyCll1iZYNLbMbuuHSeBOt38XKjC6SxpfqLRBKnbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ab8b1966b2d6dc952889c35202c8601c59dca680a0a429ff70749a5beab086","last_reissued_at":"2026-05-18T03:16:30.593849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:30.593849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maxima of the Q-index: forbidden 4-cycle and 5-cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Laura Patuzzi, Maria Aguieiras A. de Freitas, Vladimir Nikiforov","submitted_at":"2013-08-07T18:33:06Z","abstract_excerpt":"This paper gives tight upper bounds on the largest eigenvalue q(G) of the signless Laplacian of graphs with no 4-cycle and no 5-cycle. If n is odd, let F_{n} be the friendship graph of order n; if n is even, let F_{n} be F_{n-1} with an edge hanged to its center. It is shown that if G is a graph of order n, with no 4-cycle, then q(G)<q(F_{n}), unless G=F_{n}. Let S_{n,k} be the join of a complete graph of order k and an independent set of order n-k. It is shown that if G is a graph of order n, with no 5-cycle, then q(G)<q(S_{n,2}), unless G=S_{n,k}. It is shown that these results are significa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1652","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":"1308.1652","created_at":"2026-05-18T03:16:30.593935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1652v1","created_at":"2026-05-18T03:16:30.593935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1652","created_at":"2026-05-18T03:16:30.593935+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2VYWGLGWLLN","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2VYWGLGWLLNZFJI","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2VYWGLG","created_at":"2026-05-18T12:28:04.890932+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/W2VYWGLGWLLNZFJIRHBVEAWIMA","json":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA.json","graph_json":"https://pith.science/api/pith-number/W2VYWGLGWLLNZFJIRHBVEAWIMA/graph.json","events_json":"https://pith.science/api/pith-number/W2VYWGLGWLLNZFJIRHBVEAWIMA/events.json","paper":"https://pith.science/paper/W2VYWGLG"},"agent_actions":{"view_html":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA","download_json":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA.json","view_paper":"https://pith.science/paper/W2VYWGLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1652&json=true","fetch_graph":"https://pith.science/api/pith-number/W2VYWGLGWLLNZFJIRHBVEAWIMA/graph.json","fetch_events":"https://pith.science/api/pith-number/W2VYWGLGWLLNZFJIRHBVEAWIMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA/action/storage_attestation","attest_author":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA/action/author_attestation","sign_citation":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA/action/citation_signature","submit_replication":"https://pith.science/pith/W2VYWGLGWLLNZFJIRHBVEAWIMA/action/replication_record"}},"created_at":"2026-05-18T03:16:30.593935+00:00","updated_at":"2026-05-18T03:16:30.593935+00:00"}