{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OKW5RA52SDPADJY5SIXL3K7QFQ","short_pith_number":"pith:OKW5RA52","schema_version":"1.0","canonical_sha256":"72add883ba90de01a71d922ebdabf02c2aae4b990a11a32df08096601b2a2120","source":{"kind":"arxiv","id":"1902.00747","version":1},"attestation_state":"computed","paper":{"title":"On the eigenvalues of some signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. Heydari, M. Maghasedi, M. Souri","submitted_at":"2019-02-02T16:23:57Z","abstract_excerpt":"Let $G$ be a simple graph and $A(G)$ be the adjacency matrix of $G$. The matrix $S(G) = J -I -2A(G)$ is called the Seidel matrix of $G$, where $I$ is an identity matrix and $J$ is a square matrix all of whose entries are equal to 1. Clearly, if $G$ is a graph of order $n$ with no isolated vertex, then the Seidel matrix of $G$ is also the adjacency matrix of a signed complete graph $K_n$ whose negative edges induce $G$. In this paper, we study the Seidel eigenvalues of the complete multipartite graph $K_{n_1,\\ldots,n_k}$ and investigate its Seidel characteristic polynomial. We show that if ther"},"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":"1902.00747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-02T16:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"bb542c7d0d035c8a3997aac0d4fc33a1411fbabca2812c0d807e251c4b8fbd74","abstract_canon_sha256":"f8227c8d33ff7574daed06a4da389b14de365c12ad03644e64c23165d2ef591d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.284338Z","signature_b64":"gRjrbSvW5+VB9b8H4+jE377fKM2kMgnJkcyfEqIelM6aicD2tE61cFkHQnorB1wj+kMXFhFpdp+80qL5Z6cTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72add883ba90de01a71d922ebdabf02c2aae4b990a11a32df08096601b2a2120","last_reissued_at":"2026-05-17T23:54:52.283928Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.283928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the eigenvalues of some signed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F. Heydari, M. Maghasedi, M. Souri","submitted_at":"2019-02-02T16:23:57Z","abstract_excerpt":"Let $G$ be a simple graph and $A(G)$ be the adjacency matrix of $G$. The matrix $S(G) = J -I -2A(G)$ is called the Seidel matrix of $G$, where $I$ is an identity matrix and $J$ is a square matrix all of whose entries are equal to 1. Clearly, if $G$ is a graph of order $n$ with no isolated vertex, then the Seidel matrix of $G$ is also the adjacency matrix of a signed complete graph $K_n$ whose negative edges induce $G$. In this paper, we study the Seidel eigenvalues of the complete multipartite graph $K_{n_1,\\ldots,n_k}$ and investigate its Seidel characteristic polynomial. We show that if ther"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00747","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":"1902.00747","created_at":"2026-05-17T23:54:52.283995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00747v1","created_at":"2026-05-17T23:54:52.283995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00747","created_at":"2026-05-17T23:54:52.283995+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKW5RA52SDPA","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKW5RA52SDPADJY5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKW5RA52","created_at":"2026-05-18T12:33:24.271573+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/OKW5RA52SDPADJY5SIXL3K7QFQ","json":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ.json","graph_json":"https://pith.science/api/pith-number/OKW5RA52SDPADJY5SIXL3K7QFQ/graph.json","events_json":"https://pith.science/api/pith-number/OKW5RA52SDPADJY5SIXL3K7QFQ/events.json","paper":"https://pith.science/paper/OKW5RA52"},"agent_actions":{"view_html":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ","download_json":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ.json","view_paper":"https://pith.science/paper/OKW5RA52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00747&json=true","fetch_graph":"https://pith.science/api/pith-number/OKW5RA52SDPADJY5SIXL3K7QFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OKW5RA52SDPADJY5SIXL3K7QFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ/action/storage_attestation","attest_author":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ/action/author_attestation","sign_citation":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ/action/citation_signature","submit_replication":"https://pith.science/pith/OKW5RA52SDPADJY5SIXL3K7QFQ/action/replication_record"}},"created_at":"2026-05-17T23:54:52.283995+00:00","updated_at":"2026-05-17T23:54:52.283995+00:00"}