{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PDW52EI3T2AUKR4S3LZ25TAALW","short_pith_number":"pith:PDW52EI3","schema_version":"1.0","canonical_sha256":"78eddd111b9e81454792daf3aecc005d898aff708f7b8eacc60f034177dcab28","source":{"kind":"arxiv","id":"1807.07750","version":4},"attestation_state":"computed","paper":{"title":"Breaking of ensemble equivalence for perturbed Erd\\H{o}s-R\\'enyi random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. Roccaverde, F. den Hollander, M. Mandjes, N.J. Starreveld","submitted_at":"2018-07-20T09:09:36Z","abstract_excerpt":"In [18] we analysed a simple undirected random graph subject to constraints on the total number of edges and the total number of triangles. We considered the dense regime in which the number of edges per vertex is proportional to the number of vertices. We showed that, as soon as the constraints are \\emph{frustrated}, i.e., do not lie on the Erd\\H{o}s-R\\'enyi line, there is breaking of ensemble equivalence, in the sense that the specific relative entropy per edge of the \\emph{microcanonical ensemble} with respect to the \\emph{canonical ensemble} is strictly positive in the limit as the number "},"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":"1807.07750","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-20T09:09:36Z","cross_cats_sorted":[],"title_canon_sha256":"15d683af49f16419c7effcda1478900391dde35b543f954b6dac7742ab13da2e","abstract_canon_sha256":"05aad9b82b3a5aeb6a7703c5c754637b16a9d01434374506ff2ec168ac419d59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:31.304631Z","signature_b64":"I4HdiwZbWkgc5j219z/kOu/5fqJ/TDlOXnUEcQ8OOgwAezVnT72J+GmhJ9Q1B9DCgkLaUwYSEV6kkvCtAHnUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78eddd111b9e81454792daf3aecc005d898aff708f7b8eacc60f034177dcab28","last_reissued_at":"2026-07-05T02:48:31.304234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:31.304234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking of ensemble equivalence for perturbed Erd\\H{o}s-R\\'enyi random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. Roccaverde, F. den Hollander, M. Mandjes, N.J. Starreveld","submitted_at":"2018-07-20T09:09:36Z","abstract_excerpt":"In [18] we analysed a simple undirected random graph subject to constraints on the total number of edges and the total number of triangles. We considered the dense regime in which the number of edges per vertex is proportional to the number of vertices. We showed that, as soon as the constraints are \\emph{frustrated}, i.e., do not lie on the Erd\\H{o}s-R\\'enyi line, there is breaking of ensemble equivalence, in the sense that the specific relative entropy per edge of the \\emph{microcanonical ensemble} with respect to the \\emph{canonical ensemble} is strictly positive in the limit as the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07750","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1807.07750/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1807.07750","created_at":"2026-07-05T02:48:31.304290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07750v4","created_at":"2026-07-05T02:48:31.304290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07750","created_at":"2026-07-05T02:48:31.304290+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDW52EI3T2AU","created_at":"2026-07-05T02:48:31.304290+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDW52EI3T2AUKR4S","created_at":"2026-07-05T02:48:31.304290+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDW52EI3","created_at":"2026-07-05T02:48:31.304290+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14556","citing_title":"Emergence in graphs with near-extreme constraints","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW","json":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW.json","graph_json":"https://pith.science/api/pith-number/PDW52EI3T2AUKR4S3LZ25TAALW/graph.json","events_json":"https://pith.science/api/pith-number/PDW52EI3T2AUKR4S3LZ25TAALW/events.json","paper":"https://pith.science/paper/PDW52EI3"},"agent_actions":{"view_html":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW","download_json":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW.json","view_paper":"https://pith.science/paper/PDW52EI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07750&json=true","fetch_graph":"https://pith.science/api/pith-number/PDW52EI3T2AUKR4S3LZ25TAALW/graph.json","fetch_events":"https://pith.science/api/pith-number/PDW52EI3T2AUKR4S3LZ25TAALW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW/action/storage_attestation","attest_author":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW/action/author_attestation","sign_citation":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW/action/citation_signature","submit_replication":"https://pith.science/pith/PDW52EI3T2AUKR4S3LZ25TAALW/action/replication_record"}},"created_at":"2026-07-05T02:48:31.304290+00:00","updated_at":"2026-07-05T02:48:31.304290+00:00"}