{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SV62SFOZBQBGX6XV4H35W3JKRM","short_pith_number":"pith:SV62SFOZ","schema_version":"1.0","canonical_sha256":"957da915d90c026bfaf5e1f7db6d2a8b015c11b50dcc4cfcb391a0699e95ecc4","source":{"kind":"arxiv","id":"1611.05311","version":2},"attestation_state":"computed","paper":{"title":"On graphs with three or four distinct normalized Laplacian eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qiongxiang Huang, Xueyi Huang","submitted_at":"2016-11-16T15:20:10Z","abstract_excerpt":"In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly four distinct normalized Laplacian eigenvalues, and find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues."},"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":"1611.05311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-16T15:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"05472f6aa8a075108c4e460fea6770dce553a811294745037281a57058ec178a","abstract_canon_sha256":"de23a7850276362de792608416a536179c6be776acf945b8ae7226bafd5fa2a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:56.656306Z","signature_b64":"R2UIrED0f3XLDjGqqkCuNJlLM5LLFIfCGmNkGsDy9u68zhDucY5gFiYzr1HngZBM/UymWbo4Bv0LPXGO0Vp9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"957da915d90c026bfaf5e1f7db6d2a8b015c11b50dcc4cfcb391a0699e95ecc4","last_reissued_at":"2026-05-18T00:47:56.655875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:56.655875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs with three or four distinct normalized Laplacian eigenvalues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qiongxiang Huang, Xueyi Huang","submitted_at":"2016-11-16T15:20:10Z","abstract_excerpt":"In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly four distinct normalized Laplacian eigenvalues, and find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05311","kind":"arxiv","version":2},"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":"1611.05311","created_at":"2026-05-18T00:47:56.655932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05311v2","created_at":"2026-05-18T00:47:56.655932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05311","created_at":"2026-05-18T00:47:56.655932+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV62SFOZBQBG","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV62SFOZBQBGX6XV","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV62SFOZ","created_at":"2026-05-18T12:30:44.179134+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/SV62SFOZBQBGX6XV4H35W3JKRM","json":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM.json","graph_json":"https://pith.science/api/pith-number/SV62SFOZBQBGX6XV4H35W3JKRM/graph.json","events_json":"https://pith.science/api/pith-number/SV62SFOZBQBGX6XV4H35W3JKRM/events.json","paper":"https://pith.science/paper/SV62SFOZ"},"agent_actions":{"view_html":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM","download_json":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM.json","view_paper":"https://pith.science/paper/SV62SFOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05311&json=true","fetch_graph":"https://pith.science/api/pith-number/SV62SFOZBQBGX6XV4H35W3JKRM/graph.json","fetch_events":"https://pith.science/api/pith-number/SV62SFOZBQBGX6XV4H35W3JKRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM/action/storage_attestation","attest_author":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM/action/author_attestation","sign_citation":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM/action/citation_signature","submit_replication":"https://pith.science/pith/SV62SFOZBQBGX6XV4H35W3JKRM/action/replication_record"}},"created_at":"2026-05-18T00:47:56.655932+00:00","updated_at":"2026-05-18T00:47:56.655932+00:00"}