{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DI5NEVNBYST6IRF56S47HMHGR4","short_pith_number":"pith:DI5NEVNB","canonical_record":{"source":{"id":"1106.3041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-15T17:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"5903064c06f662403646d454ca6c99a092c022166463ee408f2dfa7a7475db8f","abstract_canon_sha256":"ddf1b1eeb804ed3182fb73dd0970640db0c0fd47a3bfc7b10492b815c0963055"},"schema_version":"1.0"},"canonical_sha256":"1a3ad255a1c4a7e444bdf4b9f3b0e68f24bc692c2a0d6dbc8d8b9a8591b23981","source":{"kind":"arxiv","id":"1106.3041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3041","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3041v1","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3041","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"DI5NEVNBYST6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DI5NEVNBYST6IRF5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DI5NEVNB","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DI5NEVNBYST6IRF56S47HMHGR4","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-15T17:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"5903064c06f662403646d454ca6c99a092c022166463ee408f2dfa7a7475db8f","abstract_canon_sha256":"ddf1b1eeb804ed3182fb73dd0970640db0c0fd47a3bfc7b10492b815c0963055"},"schema_version":"1.0"},"canonical_sha256":"1a3ad255a1c4a7e444bdf4b9f3b0e68f24bc692c2a0d6dbc8d8b9a8591b23981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:55.128462Z","signature_b64":"qeoUbqw6A2Mhb5nRAChg5AbfGUvXpEZAyY3ri75nsaAypFGuTSZilcde943HgU5QYoH62cP3kWRVk/LvJi10Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a3ad255a1c4a7e444bdf4b9f3b0e68f24bc692c2a0d6dbc8d8b9a8591b23981","last_reissued_at":"2026-05-18T04:19:55.127797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:55.127797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3041","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-05-18T04:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kL04yfa3aoBXnpJOTjXl0LAjhDYiZuQOYkCYT+9MUENXn7QPqtXneZnwMDW6bfA1XmLDFnAIkCFyiQMgeK9wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T07:54:35.764253Z"},"content_sha256":"01897f7a2696eaa9fc782464d88fb15e2dffb502d9ab06257e51684382ccad2b","schema_version":"1.0","event_id":"sha256:01897f7a2696eaa9fc782464d88fb15e2dffb502d9ab06257e51684382ccad2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DI5NEVNBYST6IRF56S47HMHGR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Laplacian Estrada index of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksandar Ilic, Bo Zhou","submitted_at":"2011-06-15T17:59:56Z","abstract_excerpt":"Let $G$ be a simple graph with $n$ vertices and let $\\mu_1 \\geqslant \\mu_2 \\geqslant...\\geqslant \\mu_{n - 1} \\geqslant \\mu_n = 0$ be the eigenvalues of its Laplacian matrix. The Laplacian Estrada index of a graph $G$ is defined as $LEE (G) = \\sum\\limits_{i = 1}^n e^{\\mu_i}$. Using the recent connection between Estrada index of a line graph and Laplacian Estrada index, we prove that the path $P_n$ has minimal, while the star $S_n$ has maximal $LEE$ among trees on $n$ vertices. In addition, we find the unique tree with the second maximal Laplacian Estrada index."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3041","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":""},"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-05-18T04:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBNhJ1C9bRGz4kC2pbtmJpgME6+poyOdWsMlBhAbb8BL/6CWmZRl1Q/6lxl67pQpQKtHupZAr0yfgrzaCbqaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T07:54:35.764626Z"},"content_sha256":"589d680581b39fc789591ebb77a1be55f2cde23de12d07e3c45ff9b6d0fa34f9","schema_version":"1.0","event_id":"sha256:589d680581b39fc789591ebb77a1be55f2cde23de12d07e3c45ff9b6d0fa34f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DI5NEVNBYST6IRF56S47HMHGR4/bundle.json","state_url":"https://pith.science/pith/DI5NEVNBYST6IRF56S47HMHGR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DI5NEVNBYST6IRF56S47HMHGR4/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-07-03T07:54:35Z","links":{"resolver":"https://pith.science/pith/DI5NEVNBYST6IRF56S47HMHGR4","bundle":"https://pith.science/pith/DI5NEVNBYST6IRF56S47HMHGR4/bundle.json","state":"https://pith.science/pith/DI5NEVNBYST6IRF56S47HMHGR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DI5NEVNBYST6IRF56S47HMHGR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DI5NEVNBYST6IRF56S47HMHGR4","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":"ddf1b1eeb804ed3182fb73dd0970640db0c0fd47a3bfc7b10492b815c0963055","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-15T17:59:56Z","title_canon_sha256":"5903064c06f662403646d454ca6c99a092c022166463ee408f2dfa7a7475db8f"},"schema_version":"1.0","source":{"id":"1106.3041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3041","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3041v1","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3041","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"DI5NEVNBYST6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DI5NEVNBYST6IRF5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DI5NEVNB","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:589d680581b39fc789591ebb77a1be55f2cde23de12d07e3c45ff9b6d0fa34f9","target":"graph","created_at":"2026-05-18T04:19:55Z","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"},"paper":{"abstract_excerpt":"Let $G$ be a simple graph with $n$ vertices and let $\\mu_1 \\geqslant \\mu_2 \\geqslant...\\geqslant \\mu_{n - 1} \\geqslant \\mu_n = 0$ be the eigenvalues of its Laplacian matrix. The Laplacian Estrada index of a graph $G$ is defined as $LEE (G) = \\sum\\limits_{i = 1}^n e^{\\mu_i}$. Using the recent connection between Estrada index of a line graph and Laplacian Estrada index, we prove that the path $P_n$ has minimal, while the star $S_n$ has maximal $LEE$ among trees on $n$ vertices. In addition, we find the unique tree with the second maximal Laplacian Estrada index.","authors_text":"Aleksandar Ilic, Bo Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-15T17:59:56Z","title":"Laplacian Estrada index of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3041","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:01897f7a2696eaa9fc782464d88fb15e2dffb502d9ab06257e51684382ccad2b","target":"record","created_at":"2026-05-18T04:19:55Z","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":"ddf1b1eeb804ed3182fb73dd0970640db0c0fd47a3bfc7b10492b815c0963055","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-15T17:59:56Z","title_canon_sha256":"5903064c06f662403646d454ca6c99a092c022166463ee408f2dfa7a7475db8f"},"schema_version":"1.0","source":{"id":"1106.3041","kind":"arxiv","version":1}},"canonical_sha256":"1a3ad255a1c4a7e444bdf4b9f3b0e68f24bc692c2a0d6dbc8d8b9a8591b23981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a3ad255a1c4a7e444bdf4b9f3b0e68f24bc692c2a0d6dbc8d8b9a8591b23981","first_computed_at":"2026-05-18T04:19:55.127797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:55.127797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qeoUbqw6A2Mhb5nRAChg5AbfGUvXpEZAyY3ri75nsaAypFGuTSZilcde943HgU5QYoH62cP3kWRVk/LvJi10Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:55.128462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01897f7a2696eaa9fc782464d88fb15e2dffb502d9ab06257e51684382ccad2b","sha256:589d680581b39fc789591ebb77a1be55f2cde23de12d07e3c45ff9b6d0fa34f9"],"state_sha256":"5e570fbd1c8fba56138ac3b5c62891452cbeaa91b91a11e1fa272f318c854caf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfIjw5ja1IAlB+X5uV9ydBMJN7tOsO43UR2vs+6dXkMXeSbLSZAnsMut/Ti9TR6T9xyCT90NGb2tJKLn1QwwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T07:54:35.766774Z","bundle_sha256":"e0a7b41ead5fc3735603d73796dc2833a4339b25a227fa0f217dd2fd606956e0"}}