{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:W3WY4FJ4EK4PCMFI6UHQQTS36H","short_pith_number":"pith:W3WY4FJ4","canonical_record":{"source":{"id":"2411.14835","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.SP","submitted_at":"2024-11-22T10:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"e8b3bd5b3c74c274a2f2264b91d64748a51c34355b9d59180d200c039ecaca53","abstract_canon_sha256":"a1cfdc81eef87ae5118247bcc32e499b834f069bdf3913bdedbb9dd343070eed"},"schema_version":"1.0"},"canonical_sha256":"b6ed8e153c22b8f130a8f50f084e5bf1e7358c16f6b81394fbc4d29be09fc4e8","source":{"kind":"arxiv","id":"2411.14835","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14835","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14835v2","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14835","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"W3WY4FJ4EK4P","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"W3WY4FJ4EK4PCMFI","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"W3WY4FJ4","created_at":"2026-07-05T09:52:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:W3WY4FJ4EK4PCMFI6UHQQTS36H","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14835","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.SP","submitted_at":"2024-11-22T10:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"e8b3bd5b3c74c274a2f2264b91d64748a51c34355b9d59180d200c039ecaca53","abstract_canon_sha256":"a1cfdc81eef87ae5118247bcc32e499b834f069bdf3913bdedbb9dd343070eed"},"schema_version":"1.0"},"canonical_sha256":"b6ed8e153c22b8f130a8f50f084e5bf1e7358c16f6b81394fbc4d29be09fc4e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:40.517154Z","signature_b64":"DtxjEbqBzNPZuu2loVj9PzuN28JHz/Wu/lgF86xqcoo4vI1hkZBzfDZbhSSS5WPo3C3OBtieNErjf61k2SeVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ed8e153c22b8f130a8f50f084e5bf1e7358c16f6b81394fbc4d29be09fc4e8","last_reissued_at":"2026-07-05T09:52:40.516749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:40.516749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14835","source_version":2,"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-05T09:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpM/fOUMN1JZnCztfDHsRUpQNiq6s+hRXMpjwK25wWPbiWgGfGFLjUOewN2pqen3XeO1EBMJslVR5x6BnLjRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:03:06.904537Z"},"content_sha256":"57466e5a89164878e3b762857b690c161a48086ea6e685ff17fa64897d71ddf8","schema_version":"1.0","event_id":"sha256:57466e5a89164878e3b762857b690c161a48086ea6e685ff17fa64897d71ddf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:W3WY4FJ4EK4PCMFI6UHQQTS36H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Line graphs with the largest eigenvalue multiplicity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Dein Wong, Songnian Xu, Wenhao Zhen","submitted_at":"2024-11-22T10:17:33Z","abstract_excerpt":"For a connected graph $G$, we denote by $L(G)$, $m_{G}(\\lambda)$, $c(G)$ and $p(G)$ the line graph of $G$, the eigenvalue multiplicity of $\\lambda$ in $G$, the cyclomatic number and the number of pendant vertices in $G$, respectively. In 2023, Yang et al. \\cite{WL LT} proved that $m_{L(T)}(\\lambda)\\leq p(T)-1$ for any tree $T$ with $p(T)\\geq 3$, and characterized all trees $T$ with $m_{L(T)}(\\lambda) = p(T)-1$. In 2024, Chang et al. \\cite{-1 LG} proved that, if $G$ is not a cycle, then $m_{L(G)}(\\lambda)\\leq 2c(G)+p(G)-1$, and characterized all graphs $G$ with $m_{L(G)}(-1) = 2c(G)+p(G)-1$. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14835","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14835/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-05T09:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZ0q2hiuKXJjQraren3xlJXCjM6SS8OHQXnnRI95RBA1LVdIzJmgEj29mI0tZV7sJThhmEEHc0J4RhwWspx0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:03:06.905110Z"},"content_sha256":"dd44cfb02ef3da6bdef7141319b202dfc2e13fa7dd97b2c7452929f5cd4ae3d8","schema_version":"1.0","event_id":"sha256:dd44cfb02ef3da6bdef7141319b202dfc2e13fa7dd97b2c7452929f5cd4ae3d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3WY4FJ4EK4PCMFI6UHQQTS36H/bundle.json","state_url":"https://pith.science/pith/W3WY4FJ4EK4PCMFI6UHQQTS36H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3WY4FJ4EK4PCMFI6UHQQTS36H/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-14T16:03:06Z","links":{"resolver":"https://pith.science/pith/W3WY4FJ4EK4PCMFI6UHQQTS36H","bundle":"https://pith.science/pith/W3WY4FJ4EK4PCMFI6UHQQTS36H/bundle.json","state":"https://pith.science/pith/W3WY4FJ4EK4PCMFI6UHQQTS36H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3WY4FJ4EK4PCMFI6UHQQTS36H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:W3WY4FJ4EK4PCMFI6UHQQTS36H","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":"a1cfdc81eef87ae5118247bcc32e499b834f069bdf3913bdedbb9dd343070eed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.SP","submitted_at":"2024-11-22T10:17:33Z","title_canon_sha256":"e8b3bd5b3c74c274a2f2264b91d64748a51c34355b9d59180d200c039ecaca53"},"schema_version":"1.0","source":{"id":"2411.14835","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14835","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14835v2","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14835","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"W3WY4FJ4EK4P","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"W3WY4FJ4EK4PCMFI","created_at":"2026-07-05T09:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"W3WY4FJ4","created_at":"2026-07-05T09:52:40Z"}],"graph_snapshots":[{"event_id":"sha256:dd44cfb02ef3da6bdef7141319b202dfc2e13fa7dd97b2c7452929f5cd4ae3d8","target":"graph","created_at":"2026-07-05T09:52: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/2411.14835/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a connected graph $G$, we denote by $L(G)$, $m_{G}(\\lambda)$, $c(G)$ and $p(G)$ the line graph of $G$, the eigenvalue multiplicity of $\\lambda$ in $G$, the cyclomatic number and the number of pendant vertices in $G$, respectively. In 2023, Yang et al. \\cite{WL LT} proved that $m_{L(T)}(\\lambda)\\leq p(T)-1$ for any tree $T$ with $p(T)\\geq 3$, and characterized all trees $T$ with $m_{L(T)}(\\lambda) = p(T)-1$. In 2024, Chang et al. \\cite{-1 LG} proved that, if $G$ is not a cycle, then $m_{L(G)}(\\lambda)\\leq 2c(G)+p(G)-1$, and characterized all graphs $G$ with $m_{L(G)}(-1) = 2c(G)+p(G)-1$. Th","authors_text":"Dein Wong, Songnian Xu, Wenhao Zhen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.SP","submitted_at":"2024-11-22T10:17:33Z","title":"Line graphs with the largest eigenvalue multiplicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14835","kind":"arxiv","version":2},"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:57466e5a89164878e3b762857b690c161a48086ea6e685ff17fa64897d71ddf8","target":"record","created_at":"2026-07-05T09:52: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":"a1cfdc81eef87ae5118247bcc32e499b834f069bdf3913bdedbb9dd343070eed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.SP","submitted_at":"2024-11-22T10:17:33Z","title_canon_sha256":"e8b3bd5b3c74c274a2f2264b91d64748a51c34355b9d59180d200c039ecaca53"},"schema_version":"1.0","source":{"id":"2411.14835","kind":"arxiv","version":2}},"canonical_sha256":"b6ed8e153c22b8f130a8f50f084e5bf1e7358c16f6b81394fbc4d29be09fc4e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6ed8e153c22b8f130a8f50f084e5bf1e7358c16f6b81394fbc4d29be09fc4e8","first_computed_at":"2026-07-05T09:52:40.516749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:52:40.516749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DtxjEbqBzNPZuu2loVj9PzuN28JHz/Wu/lgF86xqcoo4vI1hkZBzfDZbhSSS5WPo3C3OBtieNErjf61k2SeVBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:52:40.517154Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14835","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57466e5a89164878e3b762857b690c161a48086ea6e685ff17fa64897d71ddf8","sha256:dd44cfb02ef3da6bdef7141319b202dfc2e13fa7dd97b2c7452929f5cd4ae3d8"],"state_sha256":"f904e04df5387b37c9fc86253f747f844396c542c527d59b7c08101a0460a03b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WeEGT3tRswdFO1zQWLdPpr8UBZwUoWTHM5sN6vlYDg0D5HnqbQ1DbDNqVoJlxp+IYbwEPRUE9HM7Wl1qfOQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T16:03:06.911085Z","bundle_sha256":"e0e4bf81eddc41ddd779948b64b80be7ccd22ffdc0aba410b1ac49ef79d902a6"}}