{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RCH5FIGQHX7QJANBXM7YTKNBH4","short_pith_number":"pith:RCH5FIGQ","schema_version":"1.0","canonical_sha256":"888fd2a0d03dff0481a1bb3f89a9a13f14de147fa83e58fb224e6856eea1d055","source":{"kind":"arxiv","id":"1106.4925","version":2},"attestation_state":"computed","paper":{"title":"Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cond-mat.dis-nn","authors_text":"A. V. Goltsev, J. F. F. Mendes, S. N. Dorogovtsev, S. Yoon","submitted_at":"2011-06-24T09:37:11Z","abstract_excerpt":"We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration model). These networks can be treated as sparse uncorrelated hypergraphs in which hyperedges represent motifs. Here a hypergraph is a generalization of a graph, where a hyperedge can connect any number of vertices. These uncorrelated hypergraphs are tree-like (hypertrees), which crucially simplify the problem and allow us to apply the belief-propagation algori"},"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":"1106.4925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-06-24T09:37:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e8dabf6e8d3cc3a136b59696ecd3e11048bb60116306fa73b17cb0ed7cd24caf","abstract_canon_sha256":"c1c6471946aa76b122335bb5296fcf992b28100959c662d70f5f650af27d2c19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:01:31.173045Z","signature_b64":"HqsQz/DNgJnqh8bsz/y5vh4rr9w77ggIPoIOpzGU9EyKEiLecrWDZSZzE+s2dPSidWvwJPyWKGVlESGXaezUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888fd2a0d03dff0481a1bb3f89a9a13f14de147fa83e58fb224e6856eea1d055","last_reissued_at":"2026-05-18T02:01:31.172467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:01:31.172467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cond-mat.dis-nn","authors_text":"A. V. Goltsev, J. F. F. Mendes, S. N. Dorogovtsev, S. Yoon","submitted_at":"2011-06-24T09:37:11Z","abstract_excerpt":"We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration model). These networks can be treated as sparse uncorrelated hypergraphs in which hyperedges represent motifs. Here a hypergraph is a generalization of a graph, where a hyperedge can connect any number of vertices. These uncorrelated hypergraphs are tree-like (hypertrees), which crucially simplify the problem and allow us to apply the belief-propagation algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4925","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":"1106.4925","created_at":"2026-05-18T02:01:31.172548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.4925v2","created_at":"2026-05-18T02:01:31.172548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4925","created_at":"2026-05-18T02:01:31.172548+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCH5FIGQHX7Q","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCH5FIGQHX7QJANB","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCH5FIGQ","created_at":"2026-05-18T12:26:41.206345+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/RCH5FIGQHX7QJANBXM7YTKNBH4","json":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4.json","graph_json":"https://pith.science/api/pith-number/RCH5FIGQHX7QJANBXM7YTKNBH4/graph.json","events_json":"https://pith.science/api/pith-number/RCH5FIGQHX7QJANBXM7YTKNBH4/events.json","paper":"https://pith.science/paper/RCH5FIGQ"},"agent_actions":{"view_html":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4","download_json":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4.json","view_paper":"https://pith.science/paper/RCH5FIGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.4925&json=true","fetch_graph":"https://pith.science/api/pith-number/RCH5FIGQHX7QJANBXM7YTKNBH4/graph.json","fetch_events":"https://pith.science/api/pith-number/RCH5FIGQHX7QJANBXM7YTKNBH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4/action/storage_attestation","attest_author":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4/action/author_attestation","sign_citation":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4/action/citation_signature","submit_replication":"https://pith.science/pith/RCH5FIGQHX7QJANBXM7YTKNBH4/action/replication_record"}},"created_at":"2026-05-18T02:01:31.172548+00:00","updated_at":"2026-05-18T02:01:31.172548+00:00"}