{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:E4XSAHD7B7FLWVZYARDT77DSIP","short_pith_number":"pith:E4XSAHD7","schema_version":"1.0","canonical_sha256":"272f201c7f0fcabb573804473ffc7243e6422d9b40d817922052318089338920","source":{"kind":"arxiv","id":"1309.2453","version":1},"attestation_state":"computed","paper":{"title":"Statistical Mechanics of Multi-Edge Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Albert D\\\"iaz-Guilera, Conrad J. P\\'erez-Vicente, Oleguer Sagarra","submitted_at":"2013-09-10T10:40:46Z","abstract_excerpt":"Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos variables and those where they account for discrete, distinguishable events, which we call multi-edge networks. In this work we face this problem introducing multi-edge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the mos"},"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":"1309.2453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-09-10T10:40:46Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"d3b19ba05857434fbf0caf5a34e6b692da1354817c3fd990c50e076a9cdc3148","abstract_canon_sha256":"4b5828c45f1439202304acc6244dc024a19ddecbf3ef4795888369d4580607ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.941694Z","signature_b64":"Of3O2rsOqc/fv+cvwi1YQthxIvfcCNpadF0gcvvPqrrkXIqZKAlFaPahQmn0IR30kXGT5hETbDg5z/V5AOZCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"272f201c7f0fcabb573804473ffc7243e6422d9b40d817922052318089338920","last_reissued_at":"2026-05-18T03:05:27.940858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.940858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Mechanics of Multi-Edge Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Albert D\\\"iaz-Guilera, Conrad J. P\\'erez-Vicente, Oleguer Sagarra","submitted_at":"2013-09-10T10:40:46Z","abstract_excerpt":"Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos variables and those where they account for discrete, distinguishable events, which we call multi-edge networks. In this work we face this problem introducing multi-edge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2453","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":"1309.2453","created_at":"2026-05-18T03:05:27.940999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2453v1","created_at":"2026-05-18T03:05:27.940999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2453","created_at":"2026-05-18T03:05:27.940999+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4XSAHD7B7FL","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4XSAHD7B7FLWVZY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4XSAHD7","created_at":"2026-05-18T12:27:43.054852+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/E4XSAHD7B7FLWVZYARDT77DSIP","json":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP.json","graph_json":"https://pith.science/api/pith-number/E4XSAHD7B7FLWVZYARDT77DSIP/graph.json","events_json":"https://pith.science/api/pith-number/E4XSAHD7B7FLWVZYARDT77DSIP/events.json","paper":"https://pith.science/paper/E4XSAHD7"},"agent_actions":{"view_html":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP","download_json":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP.json","view_paper":"https://pith.science/paper/E4XSAHD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2453&json=true","fetch_graph":"https://pith.science/api/pith-number/E4XSAHD7B7FLWVZYARDT77DSIP/graph.json","fetch_events":"https://pith.science/api/pith-number/E4XSAHD7B7FLWVZYARDT77DSIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP/action/storage_attestation","attest_author":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP/action/author_attestation","sign_citation":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP/action/citation_signature","submit_replication":"https://pith.science/pith/E4XSAHD7B7FLWVZYARDT77DSIP/action/replication_record"}},"created_at":"2026-05-18T03:05:27.940999+00:00","updated_at":"2026-05-18T03:05:27.940999+00:00"}