{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7NI5AWYQBWOW32NVMLY2ETDI3L","short_pith_number":"pith:7NI5AWYQ","schema_version":"1.0","canonical_sha256":"fb51d05b100d9d6de9b562f1a24c68dac753926a910cba2b84d2160b3045bceb","source":{"kind":"arxiv","id":"1412.5727","version":1},"attestation_state":"computed","paper":{"title":"Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huishu Lian, Xiaolin Chen, Xueliang Li","submitted_at":"2014-12-18T05:59:16Z","abstract_excerpt":"Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\\sigma$ is the same for every orientation $\\sigma$ of $G$, and equals the maximum matching root of $G$. They proposed a conjecture that the graphs which attain the maximum skew spectral radius among the odd-cycle graphs $G$ of order $n$ are isomorphic to the odd-cycle graph with one vertex degree $n-1$ and size $m=\\lfloor 3(n-1)/2\\rfloor$. This paper, by using the Kelmans transf"},"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":"1412.5727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-18T05:59:16Z","cross_cats_sorted":[],"title_canon_sha256":"3235bbdd5d19c1e1cabb6d55046937efa3bdf65b9c5291a2f442ca00c50bed02","abstract_canon_sha256":"cf9637006be8f57c7064e5aad1baf39535e537c780357701f404d3b9473135f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:01.506445Z","signature_b64":"UQcpiILlQE+01FvTncDiG2ezN204zwP5QeUROG0grc31DYVWEEuy1ulzxLd+LOIQ9XkXGQmVBvse/UnHLGeAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb51d05b100d9d6de9b562f1a24c68dac753926a910cba2b84d2160b3045bceb","last_reissued_at":"2026-05-18T02:31:01.505840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:01.505840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huishu Lian, Xiaolin Chen, Xueliang Li","submitted_at":"2014-12-18T05:59:16Z","abstract_excerpt":"Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\\sigma$ is the same for every orientation $\\sigma$ of $G$, and equals the maximum matching root of $G$. They proposed a conjecture that the graphs which attain the maximum skew spectral radius among the odd-cycle graphs $G$ of order $n$ are isomorphic to the odd-cycle graph with one vertex degree $n-1$ and size $m=\\lfloor 3(n-1)/2\\rfloor$. This paper, by using the Kelmans transf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5727","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":"1412.5727","created_at":"2026-05-18T02:31:01.505915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5727v1","created_at":"2026-05-18T02:31:01.505915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5727","created_at":"2026-05-18T02:31:01.505915+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NI5AWYQBWOW","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NI5AWYQBWOW32NV","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NI5AWYQ","created_at":"2026-05-18T12:28:19.803747+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/7NI5AWYQBWOW32NVMLY2ETDI3L","json":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L.json","graph_json":"https://pith.science/api/pith-number/7NI5AWYQBWOW32NVMLY2ETDI3L/graph.json","events_json":"https://pith.science/api/pith-number/7NI5AWYQBWOW32NVMLY2ETDI3L/events.json","paper":"https://pith.science/paper/7NI5AWYQ"},"agent_actions":{"view_html":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L","download_json":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L.json","view_paper":"https://pith.science/paper/7NI5AWYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5727&json=true","fetch_graph":"https://pith.science/api/pith-number/7NI5AWYQBWOW32NVMLY2ETDI3L/graph.json","fetch_events":"https://pith.science/api/pith-number/7NI5AWYQBWOW32NVMLY2ETDI3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L/action/storage_attestation","attest_author":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L/action/author_attestation","sign_citation":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L/action/citation_signature","submit_replication":"https://pith.science/pith/7NI5AWYQBWOW32NVMLY2ETDI3L/action/replication_record"}},"created_at":"2026-05-18T02:31:01.505915+00:00","updated_at":"2026-05-18T02:31:01.505915+00:00"}