{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F3KTXQTO62P47XXFSAKW2VX34E","short_pith_number":"pith:F3KTXQTO","schema_version":"1.0","canonical_sha256":"2ed53bc26ef69fcfdee590156d56fbe11302384a8f28ed5c6eb1800188e32fb8","source":{"kind":"arxiv","id":"1502.05032","version":2},"attestation_state":"computed","paper":{"title":"Exponential Random Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.PR","physics.soc-ph","stat.TH"],"primary_cat":"math.ST","authors_text":"Dmitri Krioukov, Konstantin Zuev, Or Eisenberg","submitted_at":"2015-02-17T20:48:26Z","abstract_excerpt":"Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles under the constraints that the expected values of a set of graph observables are equal to given values. Here we extend these maximum-entropy ensembles to random simplicial complexes, which are more adequate and versatile constructions to model complex systems in many applications. We show that many random simplicial complex models considered in the literature can be casted as maximum-entropy ensembles under certain constraints. We introduce and analyze"},"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":"1502.05032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-17T20:48:26Z","cross_cats_sorted":["cond-mat.stat-mech","math.PR","physics.soc-ph","stat.TH"],"title_canon_sha256":"f74a5b5e98203a363557b6bbea85976ffee43cc3107b189249808b66a3b216e6","abstract_canon_sha256":"01a776f8dcc88a8ef76fc637427d1194deee281d4d78b53422eec3f53afeb0bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:34.606147Z","signature_b64":"9BWaqYe9zN46cbblfgT595FDf6S5rvFE2J4Jv3gXFnZtSwodL9FR42bd9hbAltQmb0Gz9P6OXowZD5wWzB7ACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed53bc26ef69fcfdee590156d56fbe11302384a8f28ed5c6eb1800188e32fb8","last_reissued_at":"2026-05-18T01:28:34.605451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:34.605451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Random Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.PR","physics.soc-ph","stat.TH"],"primary_cat":"math.ST","authors_text":"Dmitri Krioukov, Konstantin Zuev, Or Eisenberg","submitted_at":"2015-02-17T20:48:26Z","abstract_excerpt":"Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles under the constraints that the expected values of a set of graph observables are equal to given values. Here we extend these maximum-entropy ensembles to random simplicial complexes, which are more adequate and versatile constructions to model complex systems in many applications. We show that many random simplicial complex models considered in the literature can be casted as maximum-entropy ensembles under certain constraints. We introduce and analyze"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05032","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.05032","created_at":"2026-05-18T01:28:34.605558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05032v2","created_at":"2026-05-18T01:28:34.605558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05032","created_at":"2026-05-18T01:28:34.605558+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3KTXQTO62P4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3KTXQTO62P47XXF","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3KTXQTO","created_at":"2026-05-18T12:29:19.899920+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/F3KTXQTO62P47XXFSAKW2VX34E","json":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E.json","graph_json":"https://pith.science/api/pith-number/F3KTXQTO62P47XXFSAKW2VX34E/graph.json","events_json":"https://pith.science/api/pith-number/F3KTXQTO62P47XXFSAKW2VX34E/events.json","paper":"https://pith.science/paper/F3KTXQTO"},"agent_actions":{"view_html":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E","download_json":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E.json","view_paper":"https://pith.science/paper/F3KTXQTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05032&json=true","fetch_graph":"https://pith.science/api/pith-number/F3KTXQTO62P47XXFSAKW2VX34E/graph.json","fetch_events":"https://pith.science/api/pith-number/F3KTXQTO62P47XXFSAKW2VX34E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E/action/storage_attestation","attest_author":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E/action/author_attestation","sign_citation":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E/action/citation_signature","submit_replication":"https://pith.science/pith/F3KTXQTO62P47XXFSAKW2VX34E/action/replication_record"}},"created_at":"2026-05-18T01:28:34.605558+00:00","updated_at":"2026-05-18T01:28:34.605558+00:00"}