{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3FZHYKDNRAIJWU4YDCK5ZH7XVZ","short_pith_number":"pith:3FZHYKDN","canonical_record":{"source":{"id":"2007.11844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-23T08:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"0fee4397d11436a7132161a09f7dac630a9f901a5d974777d1aa823563cbcc97","abstract_canon_sha256":"ce2e8a84161381449a85edb4e522d2d47cd2d173683cca80f5ad22cd85e1f586"},"schema_version":"1.0"},"canonical_sha256":"d9727c286d88109b53981895dc9ff7ae68e440dd26385114af9fbf28ad91dd6f","source":{"kind":"arxiv","id":"2007.11844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11844","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11844v1","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11844","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"3FZHYKDNRAIJ","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"pith_short_16","alias_value":"3FZHYKDNRAIJWU4Y","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"pith_short_8","alias_value":"3FZHYKDN","created_at":"2026-07-05T01:21:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3FZHYKDNRAIJWU4YDCK5ZH7XVZ","target":"record","payload":{"canonical_record":{"source":{"id":"2007.11844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-23T08:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"0fee4397d11436a7132161a09f7dac630a9f901a5d974777d1aa823563cbcc97","abstract_canon_sha256":"ce2e8a84161381449a85edb4e522d2d47cd2d173683cca80f5ad22cd85e1f586"},"schema_version":"1.0"},"canonical_sha256":"d9727c286d88109b53981895dc9ff7ae68e440dd26385114af9fbf28ad91dd6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:40.989869Z","signature_b64":"FrH56LdclqJejSXygSd0ZVPFZ+fPgax7UfXx5Eik06t+fEevWfNbK6ZjZIDauTz2ftN8yL/3gVfEYPizWPLgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9727c286d88109b53981895dc9ff7ae68e440dd26385114af9fbf28ad91dd6f","last_reissued_at":"2026-07-05T01:21:40.989472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:40.989472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.11844","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1TiuUGGUq6mPQD+3k7gHy8THyBet3a6WmcG7BiHJc764qATtaYX/yHTABG5Iwx9ePpS5PVe7wSl/ghFVUoIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:00:51.863670Z"},"content_sha256":"aa3832624002c84e483340b7d9bfb5b8675ca0f72db7ee673abfbf2971aca4b0","schema_version":"1.0","event_id":"sha256:aa3832624002c84e483340b7d9bfb5b8675ca0f72db7ee673abfbf2971aca4b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3FZHYKDNRAIJWU4YDCK5ZH7XVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On graphs with some normalized Laplacian eigenvalue of extremal multiplicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fenglei Tian, Junqing Cai, Xuntuan Su, Zuosong Liang","submitted_at":"2020-07-23T08:16:16Z","abstract_excerpt":"Let $G$ be a connected simple graph on $n$ vertices. Let $\\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$ and $\\rho_{n-1}(G)$ be the second least eigenvalue of $\\mathcal{L}(G)$. Denote by $\\nu(G)$ the independence number of $G$. Recently, the paper [Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$, arXiv:1912.13227] discussed the graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$. However, there is one remaining case (graphs with $\\rho_{n-1}(G)\\neq 1$ and $\\nu(G)= 2$) not considered. In this paper, we focus on cographs and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11844","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/2007.11844/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7GUiFGKdqcYR8rL1nQw7X6GHEZR4XZGB4G4dthAXxcLHaT6Gu3JvOwkaendykq8AdPmsgEPnkR//W45N0QGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:00:51.864169Z"},"content_sha256":"e7e99bf6575b2e1c509709e7e8841ca0acf137e5c4da854b66a534b4302f1268","schema_version":"1.0","event_id":"sha256:e7e99bf6575b2e1c509709e7e8841ca0acf137e5c4da854b66a534b4302f1268"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FZHYKDNRAIJWU4YDCK5ZH7XVZ/bundle.json","state_url":"https://pith.science/pith/3FZHYKDNRAIJWU4YDCK5ZH7XVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FZHYKDNRAIJWU4YDCK5ZH7XVZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T15:00:51Z","links":{"resolver":"https://pith.science/pith/3FZHYKDNRAIJWU4YDCK5ZH7XVZ","bundle":"https://pith.science/pith/3FZHYKDNRAIJWU4YDCK5ZH7XVZ/bundle.json","state":"https://pith.science/pith/3FZHYKDNRAIJWU4YDCK5ZH7XVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FZHYKDNRAIJWU4YDCK5ZH7XVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3FZHYKDNRAIJWU4YDCK5ZH7XVZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ce2e8a84161381449a85edb4e522d2d47cd2d173683cca80f5ad22cd85e1f586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-23T08:16:16Z","title_canon_sha256":"0fee4397d11436a7132161a09f7dac630a9f901a5d974777d1aa823563cbcc97"},"schema_version":"1.0","source":{"id":"2007.11844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11844","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11844v1","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11844","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"3FZHYKDNRAIJ","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"pith_short_16","alias_value":"3FZHYKDNRAIJWU4Y","created_at":"2026-07-05T01:21:40Z"},{"alias_kind":"pith_short_8","alias_value":"3FZHYKDN","created_at":"2026-07-05T01:21:40Z"}],"graph_snapshots":[{"event_id":"sha256:e7e99bf6575b2e1c509709e7e8841ca0acf137e5c4da854b66a534b4302f1268","target":"graph","created_at":"2026-07-05T01:21:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.11844/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a connected simple graph on $n$ vertices. Let $\\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$ and $\\rho_{n-1}(G)$ be the second least eigenvalue of $\\mathcal{L}(G)$. Denote by $\\nu(G)$ the independence number of $G$. Recently, the paper [Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$, arXiv:1912.13227] discussed the graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$. However, there is one remaining case (graphs with $\\rho_{n-1}(G)\\neq 1$ and $\\nu(G)= 2$) not considered. In this paper, we focus on cographs and","authors_text":"Fenglei Tian, Junqing Cai, Xuntuan Su, Zuosong Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-23T08:16:16Z","title":"On graphs with some normalized Laplacian eigenvalue of extremal multiplicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11844","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa3832624002c84e483340b7d9bfb5b8675ca0f72db7ee673abfbf2971aca4b0","target":"record","created_at":"2026-07-05T01:21:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ce2e8a84161381449a85edb4e522d2d47cd2d173683cca80f5ad22cd85e1f586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-23T08:16:16Z","title_canon_sha256":"0fee4397d11436a7132161a09f7dac630a9f901a5d974777d1aa823563cbcc97"},"schema_version":"1.0","source":{"id":"2007.11844","kind":"arxiv","version":1}},"canonical_sha256":"d9727c286d88109b53981895dc9ff7ae68e440dd26385114af9fbf28ad91dd6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9727c286d88109b53981895dc9ff7ae68e440dd26385114af9fbf28ad91dd6f","first_computed_at":"2026-07-05T01:21:40.989472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:21:40.989472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FrH56LdclqJejSXygSd0ZVPFZ+fPgax7UfXx5Eik06t+fEevWfNbK6ZjZIDauTz2ftN8yL/3gVfEYPizWPLgAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:21:40.989869Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.11844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa3832624002c84e483340b7d9bfb5b8675ca0f72db7ee673abfbf2971aca4b0","sha256:e7e99bf6575b2e1c509709e7e8841ca0acf137e5c4da854b66a534b4302f1268"],"state_sha256":"061f663e81f88486a59351a0fd28d8bb5a1cd10647838b41bc437744b22b93c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHCwqO5FlTF9+gGpUZ0AERplv98aj/ktAzXS9Ve4M6kKTqLgrqqT9vGahb/avDz4pt0MRkrUk0w0DZ9Tju3DDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T15:00:51.871195Z","bundle_sha256":"7b5f3bf26ca31a5b93b62c95cdd75264c28300454f20d8cdffa9157197408a53"}}