{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SSU6ETWNOCM6OEPS3Y7CMFLCZ3","short_pith_number":"pith:SSU6ETWN","canonical_record":{"source":{"id":"1103.5989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-30T16:45:36Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"b074789b197b32ff2a0aba6df50de33cfaea644b80e33e09cc1d1f3e91a07b26","abstract_canon_sha256":"10fcae2354d51b96c3bea82925ef6b818235677f8c7f29995ba9a6063d214bf4"},"schema_version":"1.0"},"canonical_sha256":"94a9e24ecd7099e711f2de3e261562ced7d1efa9f1f246913df83ef4e22efbc9","source":{"kind":"arxiv","id":"1103.5989","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5989","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5989v2","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5989","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"SSU6ETWNOCM6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SSU6ETWNOCM6OEPS","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SSU6ETWN","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SSU6ETWNOCM6OEPS3Y7CMFLCZ3","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-30T16:45:36Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"b074789b197b32ff2a0aba6df50de33cfaea644b80e33e09cc1d1f3e91a07b26","abstract_canon_sha256":"10fcae2354d51b96c3bea82925ef6b818235677f8c7f29995ba9a6063d214bf4"},"schema_version":"1.0"},"canonical_sha256":"94a9e24ecd7099e711f2de3e261562ced7d1efa9f1f246913df83ef4e22efbc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:39.673633Z","signature_b64":"iTGGGfLGSBYsTeYWFpWLFmOzwv4sq79FKReBs3O7Vh+bSPXhzv9rDQar0jpqIwZd1InuarMKy1Fa3rkCkYJ9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94a9e24ecd7099e711f2de3e261562ced7d1efa9f1f246913df83ef4e22efbc9","last_reissued_at":"2026-05-18T04:01:39.673002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:39.673002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5989","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-05-18T04:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OpTBDEo8UAErGol2jVLpc+Vw+ZevrUtEtmqBbyl49lkHNCYATXmOFSrQ/lLJWIEsLnpeKqrxiDJJXLXoebbCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:19.553573Z"},"content_sha256":"9c7227f1e47ef42d77b647705933ed01ab21fb9a219d84c16d8c287a4ecc2bc7","schema_version":"1.0","event_id":"sha256:9c7227f1e47ef42d77b647705933ed01ab21fb9a219d84c16d8c287a4ecc2bc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SSU6ETWNOCM6OEPS3Y7CMFLCZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bipartite quantum states and random complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"Paolo Giorda, Paolo Zanardi, Silvano Garnerone","submitted_at":"2011-03-30T16:45:36Z","abstract_excerpt":"We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs we derive an analytic expression for the averaged entanglement entropy $\\bar S$ while for general complex networks we rely on numerics. For large number of nodes $n$ we find a scaling $\\bar{S} \\sim c \\log n +g_e$ where both the prefactor $c$ and the sub-leading O(1) term $g_e$ are a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5989","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":""},"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:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvxmhPvbTj6GTpvT6MJ8e3Ng7T2gSMwDyARxd2JYjzmk3bQgI+z5LjypMORFpJgbWHTToSOGZORv3qrpVb9oCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:19.554195Z"},"content_sha256":"b97e4842d9f439dcceee118a5967e5fb96fe18ad230794b71f6d01464207422b","schema_version":"1.0","event_id":"sha256:b97e4842d9f439dcceee118a5967e5fb96fe18ad230794b71f6d01464207422b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSU6ETWNOCM6OEPS3Y7CMFLCZ3/bundle.json","state_url":"https://pith.science/pith/SSU6ETWNOCM6OEPS3Y7CMFLCZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSU6ETWNOCM6OEPS3Y7CMFLCZ3/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-05-30T17:41:19Z","links":{"resolver":"https://pith.science/pith/SSU6ETWNOCM6OEPS3Y7CMFLCZ3","bundle":"https://pith.science/pith/SSU6ETWNOCM6OEPS3Y7CMFLCZ3/bundle.json","state":"https://pith.science/pith/SSU6ETWNOCM6OEPS3Y7CMFLCZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSU6ETWNOCM6OEPS3Y7CMFLCZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SSU6ETWNOCM6OEPS3Y7CMFLCZ3","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":"10fcae2354d51b96c3bea82925ef6b818235677f8c7f29995ba9a6063d214bf4","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-30T16:45:36Z","title_canon_sha256":"b074789b197b32ff2a0aba6df50de33cfaea644b80e33e09cc1d1f3e91a07b26"},"schema_version":"1.0","source":{"id":"1103.5989","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5989","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5989v2","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5989","created_at":"2026-05-18T04:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"SSU6ETWNOCM6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SSU6ETWNOCM6OEPS","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SSU6ETWN","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:b97e4842d9f439dcceee118a5967e5fb96fe18ad230794b71f6d01464207422b","target":"graph","created_at":"2026-05-18T04:01:39Z","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":"We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs we derive an analytic expression for the averaged entanglement entropy $\\bar S$ while for general complex networks we rely on numerics. For large number of nodes $n$ we find a scaling $\\bar{S} \\sim c \\log n +g_e$ where both the prefactor $c$ and the sub-leading O(1) term $g_e$ are a","authors_text":"Paolo Giorda, Paolo Zanardi, Silvano Garnerone","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-30T16:45:36Z","title":"Bipartite quantum states and random complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5989","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:9c7227f1e47ef42d77b647705933ed01ab21fb9a219d84c16d8c287a4ecc2bc7","target":"record","created_at":"2026-05-18T04:01:39Z","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":"10fcae2354d51b96c3bea82925ef6b818235677f8c7f29995ba9a6063d214bf4","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-03-30T16:45:36Z","title_canon_sha256":"b074789b197b32ff2a0aba6df50de33cfaea644b80e33e09cc1d1f3e91a07b26"},"schema_version":"1.0","source":{"id":"1103.5989","kind":"arxiv","version":2}},"canonical_sha256":"94a9e24ecd7099e711f2de3e261562ced7d1efa9f1f246913df83ef4e22efbc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94a9e24ecd7099e711f2de3e261562ced7d1efa9f1f246913df83ef4e22efbc9","first_computed_at":"2026-05-18T04:01:39.673002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:39.673002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iTGGGfLGSBYsTeYWFpWLFmOzwv4sq79FKReBs3O7Vh+bSPXhzv9rDQar0jpqIwZd1InuarMKy1Fa3rkCkYJ9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:39.673633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5989","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c7227f1e47ef42d77b647705933ed01ab21fb9a219d84c16d8c287a4ecc2bc7","sha256:b97e4842d9f439dcceee118a5967e5fb96fe18ad230794b71f6d01464207422b"],"state_sha256":"86c9191a3f5c36a1fcfc3e419ac0d701fcde384e0b09f4275c88608d7f4ace8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irlDSAst6QegZUah+t11OYrAyvKfpE7RuCdtMdyafF9vdAFoDT2R1WqfyhR3arE8LGpagpDbaNPDRUFEo21wAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:41:19.558820Z","bundle_sha256":"bf10a79ea4b65bfd1c6a355a71c20de8654b66a6c6cb0d0926d29231d95faa62"}}