{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LD6GZZY2RNNMKE7RDPOJYTXDGV","short_pith_number":"pith:LD6GZZY2","schema_version":"1.0","canonical_sha256":"58fc6ce71a8b5ac513f11bdc9c4ee335728f0498fb36258da6a7c529917feca3","source":{"kind":"arxiv","id":"1801.03404","version":1},"attestation_state":"computed","paper":{"title":"Structure Entropy and Resistor Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Angsheng Li, Yicheng Pan","submitted_at":"2018-01-09T06:48:51Z","abstract_excerpt":"We propose the notion of {\\it resistance of a graph} as an accompanying notion of the structure entropy to measure the force of the graph to resist cascading failure of strategic virus attacks. We show that for any connected network $G$, the resistance of $G$ is $\\mathcal{R}(G)=\\mathcal{H}^1(G)-\\mathcal{H}^2(G)$, where $\\mathcal{H}^1(G)$ and $\\mathcal{H}^2(G)$ are the one- and two-dimensional structure entropy of $G$, respectively. According to this, we define the notion of {\\it security index of a graph} to be the normalized resistance, that is, $\\theta (G)=\\frac{\\mathcal{R}(G)}{\\mathcal{H}^1"},"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":"1801.03404","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2018-01-09T06:48:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6290525f31c1d93330e87f5f9c8b2779187fda4feceef49a1821314266db306f","abstract_canon_sha256":"f6bc0a22c3dfd536564c4e45a393ce20ab2b32d15889d064e732a9526533eb36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:17.164221Z","signature_b64":"7HYHEaZRS/MH5dXfXtwSSu1ub5plgH3hg2Tw7hImWC/6TGO/USbuYlZGz8zQLDcTzYudgDFTinaO5kzJhYrgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58fc6ce71a8b5ac513f11bdc9c4ee335728f0498fb36258da6a7c529917feca3","last_reissued_at":"2026-05-18T00:26:17.163739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:17.163739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure Entropy and Resistor Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Angsheng Li, Yicheng Pan","submitted_at":"2018-01-09T06:48:51Z","abstract_excerpt":"We propose the notion of {\\it resistance of a graph} as an accompanying notion of the structure entropy to measure the force of the graph to resist cascading failure of strategic virus attacks. We show that for any connected network $G$, the resistance of $G$ is $\\mathcal{R}(G)=\\mathcal{H}^1(G)-\\mathcal{H}^2(G)$, where $\\mathcal{H}^1(G)$ and $\\mathcal{H}^2(G)$ are the one- and two-dimensional structure entropy of $G$, respectively. According to this, we define the notion of {\\it security index of a graph} to be the normalized resistance, that is, $\\theta (G)=\\frac{\\mathcal{R}(G)}{\\mathcal{H}^1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03404","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":"1801.03404","created_at":"2026-05-18T00:26:17.163812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03404v1","created_at":"2026-05-18T00:26:17.163812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03404","created_at":"2026-05-18T00:26:17.163812+00:00"},{"alias_kind":"pith_short_12","alias_value":"LD6GZZY2RNNM","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LD6GZZY2RNNMKE7R","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LD6GZZY2","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08997","citing_title":"SEM-RAG: Structure-Preserving Multimodal Graph Compilation and Entropy-Guided Retrieval for Telecommunication Standards","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV","json":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV.json","graph_json":"https://pith.science/api/pith-number/LD6GZZY2RNNMKE7RDPOJYTXDGV/graph.json","events_json":"https://pith.science/api/pith-number/LD6GZZY2RNNMKE7RDPOJYTXDGV/events.json","paper":"https://pith.science/paper/LD6GZZY2"},"agent_actions":{"view_html":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV","download_json":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV.json","view_paper":"https://pith.science/paper/LD6GZZY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03404&json=true","fetch_graph":"https://pith.science/api/pith-number/LD6GZZY2RNNMKE7RDPOJYTXDGV/graph.json","fetch_events":"https://pith.science/api/pith-number/LD6GZZY2RNNMKE7RDPOJYTXDGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV/action/storage_attestation","attest_author":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV/action/author_attestation","sign_citation":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV/action/citation_signature","submit_replication":"https://pith.science/pith/LD6GZZY2RNNMKE7RDPOJYTXDGV/action/replication_record"}},"created_at":"2026-05-18T00:26:17.163812+00:00","updated_at":"2026-05-18T00:26:17.163812+00:00"}