{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NBXDLMXM22T2TYOJK3WJZYR3RY","short_pith_number":"pith:NBXDLMXM","canonical_record":{"source":{"id":"2605.30982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-29T08:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"13c67df27f63a2527c5e20167b7a53e03a4978f1331105330ac8a261de58654b","abstract_canon_sha256":"c7112e0714c1f46ccb37a1c5d683196fc80a68f3a9cc9eeeb77e367f1173a4e1"},"schema_version":"1.0"},"canonical_sha256":"686e35b2ecd6a7a9e1c956ec9ce23b8e392bdb2b863c0442fef887dbc7d2a9aa","source":{"kind":"arxiv","id":"2605.30982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30982","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30982v1","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30982","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"NBXDLMXM22T2","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"NBXDLMXM22T2TYOJ","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"NBXDLMXM","created_at":"2026-06-01T01:03:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NBXDLMXM22T2TYOJK3WJZYR3RY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.30982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-29T08:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"13c67df27f63a2527c5e20167b7a53e03a4978f1331105330ac8a261de58654b","abstract_canon_sha256":"c7112e0714c1f46ccb37a1c5d683196fc80a68f3a9cc9eeeb77e367f1173a4e1"},"schema_version":"1.0"},"canonical_sha256":"686e35b2ecd6a7a9e1c956ec9ce23b8e392bdb2b863c0442fef887dbc7d2a9aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:28.531649Z","signature_b64":"tnCqPGhYgevJ3pSLLuvGPrmLHVqjRSA4fsSSzTeHkByavjdvry+09hWLL8r05sLbTCDVp6S3i3L/8xtS8XsmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"686e35b2ecd6a7a9e1c956ec9ce23b8e392bdb2b863c0442fef887dbc7d2a9aa","last_reissued_at":"2026-06-01T01:03:28.530562Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:28.530562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.30982","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-06-01T01:03:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9qMTnO/jORjt5TUyfqMpy3sgdTAl3yUgVqCimOM95L9cp+HDpSLjSPizwg5mHlmBX1uxn7GDIIPsNIDLS3aoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:06:04.841285Z"},"content_sha256":"c3f8c487ee297c34340388a475e7e89f905d94d688c6e007539a7fc5a02e504e","schema_version":"1.0","event_id":"sha256:c3f8c487ee297c34340388a475e7e89f905d94d688c6e007539a7fc5a02e504e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NBXDLMXM22T2TYOJK3WJZYR3RY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The multiplicity of the laplacian eigenvalue 1 of a tree","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Dein Wong, Songnian Xu, Wenhao Zhen","submitted_at":"2026-05-29T08:18:32Z","abstract_excerpt":"Let $G$ be a connected, undirected simple graph. Denote by $L(G)$ the Laplacian matrix of $G$, and let $m_{G}(\\lambda)$ be the multiplicity of an eigenvalue $\\lambda$ of $L(G)$. When $G$ is a tree $T$ with $n \\ge 6$ vertices, Tian et al. [Discrete Mathematics, 2026] proved that if $T$ is reduced and contains no pendant $P_3$, then \\[ m_{T}(1) \\le \\frac{n-6}{4}, \\] and they gave a complete characterization of the graphs for which equality holds.\n  In this paper, we further investigate the above problem. Still assuming that $T$ is a tree with $n \\ge 7$ vertices which is reduced and has no pendan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30982","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/2605.30982/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-06-01T01:03:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRiXARGlNbsrDNPfawaZ+Y306wJuG1pMPKFJjY+bIT+TzKIUJkonFGF0C6lD6R+5H+O/q14fwSH1s9iWfFP4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:06:04.841803Z"},"content_sha256":"c4883fa1c05861e50560313f40eaebfb073f1e1dc2f5e1cb7a1afb235e5cb0cc","schema_version":"1.0","event_id":"sha256:c4883fa1c05861e50560313f40eaebfb073f1e1dc2f5e1cb7a1afb235e5cb0cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBXDLMXM22T2TYOJK3WJZYR3RY/bundle.json","state_url":"https://pith.science/pith/NBXDLMXM22T2TYOJK3WJZYR3RY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBXDLMXM22T2TYOJK3WJZYR3RY/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-06-10T19:06:04Z","links":{"resolver":"https://pith.science/pith/NBXDLMXM22T2TYOJK3WJZYR3RY","bundle":"https://pith.science/pith/NBXDLMXM22T2TYOJK3WJZYR3RY/bundle.json","state":"https://pith.science/pith/NBXDLMXM22T2TYOJK3WJZYR3RY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBXDLMXM22T2TYOJK3WJZYR3RY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NBXDLMXM22T2TYOJK3WJZYR3RY","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":"c7112e0714c1f46ccb37a1c5d683196fc80a68f3a9cc9eeeb77e367f1173a4e1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-29T08:18:32Z","title_canon_sha256":"13c67df27f63a2527c5e20167b7a53e03a4978f1331105330ac8a261de58654b"},"schema_version":"1.0","source":{"id":"2605.30982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30982","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30982v1","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30982","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"NBXDLMXM22T2","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"NBXDLMXM22T2TYOJ","created_at":"2026-06-01T01:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"NBXDLMXM","created_at":"2026-06-01T01:03:28Z"}],"graph_snapshots":[{"event_id":"sha256:c4883fa1c05861e50560313f40eaebfb073f1e1dc2f5e1cb7a1afb235e5cb0cc","target":"graph","created_at":"2026-06-01T01:03:28Z","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/2605.30982/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a connected, undirected simple graph. Denote by $L(G)$ the Laplacian matrix of $G$, and let $m_{G}(\\lambda)$ be the multiplicity of an eigenvalue $\\lambda$ of $L(G)$. When $G$ is a tree $T$ with $n \\ge 6$ vertices, Tian et al. [Discrete Mathematics, 2026] proved that if $T$ is reduced and contains no pendant $P_3$, then \\[ m_{T}(1) \\le \\frac{n-6}{4}, \\] and they gave a complete characterization of the graphs for which equality holds.\n  In this paper, we further investigate the above problem. Still assuming that $T$ is a tree with $n \\ge 7$ vertices which is reduced and has no pendan","authors_text":"Dein Wong, Songnian Xu, Wenhao Zhen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-29T08:18:32Z","title":"The multiplicity of the laplacian eigenvalue 1 of a tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30982","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:c3f8c487ee297c34340388a475e7e89f905d94d688c6e007539a7fc5a02e504e","target":"record","created_at":"2026-06-01T01:03:28Z","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":"c7112e0714c1f46ccb37a1c5d683196fc80a68f3a9cc9eeeb77e367f1173a4e1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.SP","submitted_at":"2026-05-29T08:18:32Z","title_canon_sha256":"13c67df27f63a2527c5e20167b7a53e03a4978f1331105330ac8a261de58654b"},"schema_version":"1.0","source":{"id":"2605.30982","kind":"arxiv","version":1}},"canonical_sha256":"686e35b2ecd6a7a9e1c956ec9ce23b8e392bdb2b863c0442fef887dbc7d2a9aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"686e35b2ecd6a7a9e1c956ec9ce23b8e392bdb2b863c0442fef887dbc7d2a9aa","first_computed_at":"2026-06-01T01:03:28.530562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:28.530562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tnCqPGhYgevJ3pSLLuvGPrmLHVqjRSA4fsSSzTeHkByavjdvry+09hWLL8r05sLbTCDVp6S3i3L/8xtS8XsmAQ==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:28.531649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f8c487ee297c34340388a475e7e89f905d94d688c6e007539a7fc5a02e504e","sha256:c4883fa1c05861e50560313f40eaebfb073f1e1dc2f5e1cb7a1afb235e5cb0cc"],"state_sha256":"c2528eb4dff7d06bd0399e006b3b07556976a428d95021652113afc01a9721d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWYoXtAAePQ21Pvbrw7NkVGzHLzXbAu5momN2KyWqomTqpn9gRmeWUAR/uA6HuqpuVpuSXX0kth1WHdjUBt2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:06:04.844963Z","bundle_sha256":"96d01af61586e6eec185e1c007ed66df0b0cdfbb7fa61986831ae2166acee436"}}