{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VIN63GJ2Q25IVMMZBRW3R33YH3","short_pith_number":"pith:VIN63GJ2","schema_version":"1.0","canonical_sha256":"aa1bed993a86ba8ab1990c6db8ef783ec52c4508a13ca75af7c24e5c1cfde966","source":{"kind":"arxiv","id":"2409.01923","version":1},"attestation_state":"computed","paper":{"title":"The maximum index of signed complete graphs whose negative edges induce a bicyclic graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chen, Xiying Yuan, Ziyi Fang","submitted_at":"2024-09-03T14:13:12Z","abstract_excerpt":"Let $\\Gamma=(K_n,H)$ be a signed complete graph whose negative edges induce a subgraph $H$. Let $A(\\Gamma)$ be the adjacency matrix of the signed graph $\\Gamma$. The largest eigenvalue of $A(\\Gamma)$ is called the index of $\\Gamma$. In this paper, the index of all the signed complete graphs whose negative edges induce a bicyclic graph $B$ is investigated. Specifically, the structure of the bicyclic graph $B$ such that $\\Gamma=(K_n,B)$ has the maximum index is determined."},"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":"2409.01923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T14:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"66394c08f57826d48b73d01f2401728e03b4279b385ea64cc1a1c9a966b5fdd5","abstract_canon_sha256":"4f35c4122e4edb9a836d0ce34f61581872c7bd34a38bdb00def601b61f524789"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:36.072722Z","signature_b64":"JNR3RyBrYaeMP3R5VGyjrfMidtGsZezsO5P7BUAm9RfaYKxqdPgBlDN9/QNH5T+9AjSUzueWmHDf3OdY6GUSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa1bed993a86ba8ab1990c6db8ef783ec52c4508a13ca75af7c24e5c1cfde966","last_reissued_at":"2026-07-05T09:02:36.072120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:36.072120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum index of signed complete graphs whose negative edges induce a bicyclic graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chen, Xiying Yuan, Ziyi Fang","submitted_at":"2024-09-03T14:13:12Z","abstract_excerpt":"Let $\\Gamma=(K_n,H)$ be a signed complete graph whose negative edges induce a subgraph $H$. Let $A(\\Gamma)$ be the adjacency matrix of the signed graph $\\Gamma$. The largest eigenvalue of $A(\\Gamma)$ is called the index of $\\Gamma$. In this paper, the index of all the signed complete graphs whose negative edges induce a bicyclic graph $B$ is investigated. Specifically, the structure of the bicyclic graph $B$ such that $\\Gamma=(K_n,B)$ has the maximum index is determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01923","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.01923/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.01923","created_at":"2026-07-05T09:02:36.072189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.01923v1","created_at":"2026-07-05T09:02:36.072189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01923","created_at":"2026-07-05T09:02:36.072189+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIN63GJ2Q25I","created_at":"2026-07-05T09:02:36.072189+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIN63GJ2Q25IVMMZ","created_at":"2026-07-05T09:02:36.072189+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIN63GJ2","created_at":"2026-07-05T09:02:36.072189+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/VIN63GJ2Q25IVMMZBRW3R33YH3","json":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3.json","graph_json":"https://pith.science/api/pith-number/VIN63GJ2Q25IVMMZBRW3R33YH3/graph.json","events_json":"https://pith.science/api/pith-number/VIN63GJ2Q25IVMMZBRW3R33YH3/events.json","paper":"https://pith.science/paper/VIN63GJ2"},"agent_actions":{"view_html":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3","download_json":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3.json","view_paper":"https://pith.science/paper/VIN63GJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.01923&json=true","fetch_graph":"https://pith.science/api/pith-number/VIN63GJ2Q25IVMMZBRW3R33YH3/graph.json","fetch_events":"https://pith.science/api/pith-number/VIN63GJ2Q25IVMMZBRW3R33YH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/action/storage_attestation","attest_author":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/action/author_attestation","sign_citation":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/action/citation_signature","submit_replication":"https://pith.science/pith/VIN63GJ2Q25IVMMZBRW3R33YH3/action/replication_record"}},"created_at":"2026-07-05T09:02:36.072189+00:00","updated_at":"2026-07-05T09:02:36.072189+00:00"}