{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WTP7SGXUF26YEZMQJJHAJEFLNI","short_pith_number":"pith:WTP7SGXU","schema_version":"1.0","canonical_sha256":"b4dff91af42ebd8265904a4e0490ab6a1b843688428b292ee448fb8faab008e1","source":{"kind":"arxiv","id":"1205.1189","version":1},"attestation_state":"computed","paper":{"title":"Bounds For The Distance Estrada Index Of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"\\c{S}. Burcu Bozkurt, Durmu\\c{s} Bozkurt","submitted_at":"2012-05-06T07:49:24Z","abstract_excerpt":"The D-eigenvalues {\\mu}_1,{\\mu}_2,...,{\\mu}_{n} of a connected graph G are the eigenvalues of its distance matrix. The distance Estrada index of G is defined in [15] as DEE=DEE(G)=\\Sigma_{i=1}^n e^{{\\mu}_{i}}\n  In this paper, we give better lower bounds for the distance Estrada index of any connected graph as well as some relations between DEE(G) and the distance energy."},"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":"1205.1189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-06T07:49:24Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"4d8510882579f8c16d5b73250da1fb558d577ced35bc68781ac1134b08d2417b","abstract_canon_sha256":"75f6a304eaa1361d18c1531ab2efb7dbbef5367a74a6a8344392c5931902973d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:11.876777Z","signature_b64":"BXYZc9YbaL4zC4KIbWaqYffR/MFio1nG+Vr1vvUCrQVTqKhGjl17RThJFWkA4JLbukuTHt79VQ5gr/dpjmtsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4dff91af42ebd8265904a4e0490ab6a1b843688428b292ee448fb8faab008e1","last_reissued_at":"2026-05-18T03:56:11.876083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:11.876083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds For The Distance Estrada Index Of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"\\c{S}. Burcu Bozkurt, Durmu\\c{s} Bozkurt","submitted_at":"2012-05-06T07:49:24Z","abstract_excerpt":"The D-eigenvalues {\\mu}_1,{\\mu}_2,...,{\\mu}_{n} of a connected graph G are the eigenvalues of its distance matrix. The distance Estrada index of G is defined in [15] as DEE=DEE(G)=\\Sigma_{i=1}^n e^{{\\mu}_{i}}\n  In this paper, we give better lower bounds for the distance Estrada index of any connected graph as well as some relations between DEE(G) and the distance energy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1189","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.1189","created_at":"2026-05-18T03:56:11.876189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1189v1","created_at":"2026-05-18T03:56:11.876189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1189","created_at":"2026-05-18T03:56:11.876189+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTP7SGXUF26Y","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTP7SGXUF26YEZMQ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTP7SGXU","created_at":"2026-05-18T12:27:27.928770+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/WTP7SGXUF26YEZMQJJHAJEFLNI","json":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI.json","graph_json":"https://pith.science/api/pith-number/WTP7SGXUF26YEZMQJJHAJEFLNI/graph.json","events_json":"https://pith.science/api/pith-number/WTP7SGXUF26YEZMQJJHAJEFLNI/events.json","paper":"https://pith.science/paper/WTP7SGXU"},"agent_actions":{"view_html":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI","download_json":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI.json","view_paper":"https://pith.science/paper/WTP7SGXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1189&json=true","fetch_graph":"https://pith.science/api/pith-number/WTP7SGXUF26YEZMQJJHAJEFLNI/graph.json","fetch_events":"https://pith.science/api/pith-number/WTP7SGXUF26YEZMQJJHAJEFLNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI/action/storage_attestation","attest_author":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI/action/author_attestation","sign_citation":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI/action/citation_signature","submit_replication":"https://pith.science/pith/WTP7SGXUF26YEZMQJJHAJEFLNI/action/replication_record"}},"created_at":"2026-05-18T03:56:11.876189+00:00","updated_at":"2026-05-18T03:56:11.876189+00:00"}