{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5EXTZGKZVBMWWGGST62LP5WNSK","short_pith_number":"pith:5EXTZGKZ","schema_version":"1.0","canonical_sha256":"e92f3c9959a8596b18d29fb4b7f6cd92b7bae4d668cd3b76df4f2e0e0adc9879","source":{"kind":"arxiv","id":"1508.03295","version":2},"attestation_state":"computed","paper":{"title":"A matrix product algorithm for stochastic dynamics on networks, applied to non-equilibrium Glauber dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Caterina De Bacco, Silvio Franz, Thomas Barthel","submitted_at":"2015-08-13T18:28:57Z","abstract_excerpt":"We introduce and apply a novel efficient method for the precise simulation of stochastic dynamical processes on locally tree-like graphs. Networks with cycles are treated in the framework of the cavity method. Such models correspond, for example, to spin-glass systems, Boolean networks, neural networks, or other technological, biological, and social networks. Building upon ideas from quantum many-body theory, the new approach is based on a matrix product approximation of the so-called edge messages -- conditional probabilities of vertex variable trajectories. Computation costs and accuracy can"},"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":"1508.03295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2015-08-13T18:28:57Z","cross_cats_sorted":["cond-mat.dis-nn","physics.soc-ph"],"title_canon_sha256":"53ca592c9545b24013cba7d6cb4dc30f095d65cf4c508577ad413a3ff60acb49","abstract_canon_sha256":"17bedf3463d93d273e042a3a063447262771d6b32e09e888a955c785bf5cdd01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.167705Z","signature_b64":"8+IZgVd8GyqiHUiS0XBVPFMaPCfUcxxe0aRrX8ZI+n8a/EKG6sVAMvhehnQaqnWhnnpy8R9SX1Rwd1MT7m0gBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92f3c9959a8596b18d29fb4b7f6cd92b7bae4d668cd3b76df4f2e0e0adc9879","last_reissued_at":"2026-05-17T23:49:18.166986Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.166986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A matrix product algorithm for stochastic dynamics on networks, applied to non-equilibrium Glauber dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Caterina De Bacco, Silvio Franz, Thomas Barthel","submitted_at":"2015-08-13T18:28:57Z","abstract_excerpt":"We introduce and apply a novel efficient method for the precise simulation of stochastic dynamical processes on locally tree-like graphs. Networks with cycles are treated in the framework of the cavity method. Such models correspond, for example, to spin-glass systems, Boolean networks, neural networks, or other technological, biological, and social networks. Building upon ideas from quantum many-body theory, the new approach is based on a matrix product approximation of the so-called edge messages -- conditional probabilities of vertex variable trajectories. Computation costs and accuracy can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03295","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":"1508.03295","created_at":"2026-05-17T23:49:18.167099+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03295v2","created_at":"2026-05-17T23:49:18.167099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03295","created_at":"2026-05-17T23:49:18.167099+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EXTZGKZVBMW","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EXTZGKZVBMWWGGS","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EXTZGKZ","created_at":"2026-05-18T12:29:05.191682+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/5EXTZGKZVBMWWGGST62LP5WNSK","json":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK.json","graph_json":"https://pith.science/api/pith-number/5EXTZGKZVBMWWGGST62LP5WNSK/graph.json","events_json":"https://pith.science/api/pith-number/5EXTZGKZVBMWWGGST62LP5WNSK/events.json","paper":"https://pith.science/paper/5EXTZGKZ"},"agent_actions":{"view_html":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK","download_json":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK.json","view_paper":"https://pith.science/paper/5EXTZGKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03295&json=true","fetch_graph":"https://pith.science/api/pith-number/5EXTZGKZVBMWWGGST62LP5WNSK/graph.json","fetch_events":"https://pith.science/api/pith-number/5EXTZGKZVBMWWGGST62LP5WNSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK/action/storage_attestation","attest_author":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK/action/author_attestation","sign_citation":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK/action/citation_signature","submit_replication":"https://pith.science/pith/5EXTZGKZVBMWWGGST62LP5WNSK/action/replication_record"}},"created_at":"2026-05-17T23:49:18.167099+00:00","updated_at":"2026-05-17T23:49:18.167099+00:00"}