{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3XNIIOP3NTQ4WQCNEW5JQBWP7G","short_pith_number":"pith:3XNIIOP3","schema_version":"1.0","canonical_sha256":"ddda8439fb6ce1cb404d25ba9806cff9b2d6135f1b5a5615f746afe175eb80d2","source":{"kind":"arxiv","id":"1809.07533","version":1},"attestation_state":"computed","paper":{"title":"On the Von Neumann Entropy of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrea Torsello, Giorgia Minello, Luca Rossi","submitted_at":"2018-09-20T08:55:00Z","abstract_excerpt":"The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and normalized graph Laplacian, respectively. Due to its computational complexity, previous works have proposed to approximate the von Neumann entropy, effectively reducing it to the computation of simple node degree statistics. Unfortunately, a number of issues surrounding the von Neumann entropy remain unsolved to date, including the interpretation of this spect"},"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":"1809.07533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-20T08:55:00Z","cross_cats_sorted":[],"title_canon_sha256":"68fde121e8c92b9cfdee8ae975c5eb78e4423c5659631c6729ebe3aa3887eabc","abstract_canon_sha256":"3364051d377442fb910bbc99286a4eba39ec046fb5711ce5505a45e8276896c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:19.704783Z","signature_b64":"0g4Sk/xX18y1SQ8rTM3tT7+vgBrI+nMs74rUSBrbkt2A1aG2LIsuqh3DpTTWjEK7/nSdw1L271doFBtjtxhRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddda8439fb6ce1cb404d25ba9806cff9b2d6135f1b5a5615f746afe175eb80d2","last_reissued_at":"2026-05-17T23:55:19.704264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:19.704264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Von Neumann Entropy of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrea Torsello, Giorgia Minello, Luca Rossi","submitted_at":"2018-09-20T08:55:00Z","abstract_excerpt":"The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and normalized graph Laplacian, respectively. Due to its computational complexity, previous works have proposed to approximate the von Neumann entropy, effectively reducing it to the computation of simple node degree statistics. Unfortunately, a number of issues surrounding the von Neumann entropy remain unsolved to date, including the interpretation of this spect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07533","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":"1809.07533","created_at":"2026-05-17T23:55:19.704357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07533v1","created_at":"2026-05-17T23:55:19.704357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07533","created_at":"2026-05-17T23:55:19.704357+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XNIIOP3NTQ4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XNIIOP3NTQ4WQCN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XNIIOP3","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.13334","citing_title":"SEER: Spectral Entropy Encoding of Roles for Context-Aware Attention-Based Design Pattern Detection","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G","json":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G.json","graph_json":"https://pith.science/api/pith-number/3XNIIOP3NTQ4WQCNEW5JQBWP7G/graph.json","events_json":"https://pith.science/api/pith-number/3XNIIOP3NTQ4WQCNEW5JQBWP7G/events.json","paper":"https://pith.science/paper/3XNIIOP3"},"agent_actions":{"view_html":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G","download_json":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G.json","view_paper":"https://pith.science/paper/3XNIIOP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07533&json=true","fetch_graph":"https://pith.science/api/pith-number/3XNIIOP3NTQ4WQCNEW5JQBWP7G/graph.json","fetch_events":"https://pith.science/api/pith-number/3XNIIOP3NTQ4WQCNEW5JQBWP7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G/action/storage_attestation","attest_author":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G/action/author_attestation","sign_citation":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G/action/citation_signature","submit_replication":"https://pith.science/pith/3XNIIOP3NTQ4WQCNEW5JQBWP7G/action/replication_record"}},"created_at":"2026-05-17T23:55:19.704357+00:00","updated_at":"2026-05-17T23:55:19.704357+00:00"}