{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WBQK4TXXBEOWWHAF7JDGJS7Y7W","short_pith_number":"pith:WBQK4TXX","schema_version":"1.0","canonical_sha256":"b060ae4ef7091d6b1c05fa4664cbf8fd8acf2661d26739ce58f48e003a523fb2","source":{"kind":"arxiv","id":"1804.00910","version":1},"attestation_state":"computed","paper":{"title":"Approximate lumpability for Markovian agent-based models using local symmetries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Arnab Auddy, Heinz Koeppl, Wasiur R. KhudaBukhsh, Yann Disser","submitted_at":"2018-04-03T11:16:17Z","abstract_excerpt":"We study a Markovian agent-based model (MABM) in this paper. Each agent is endowed with a local state that changes over time as the agent interacts with its neighbours. The neighbourhood structure is given by a graph. In a recent paper [Simon et al. 2011], the authors used the automorphisms of the underlying graph to generate a lumpable partition of the joint state space ensuring Markovianness of the lumped process for binary dynamics. However, many large random graphs tend to become asymmetric rendering the automorphism-based lumping approach ineffective as a tool of model reduction. In order"},"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":"1804.00910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-03T11:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"bdaecb2ea3d3a59d7f02fef273b9af9d2dc43858e31bacd4a365162d2aee3769","abstract_canon_sha256":"088429e670e090b3980b7bde5a338f22c80eb16f566b50774ec4db96309a33bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:31.809585Z","signature_b64":"V6mIE/NReOG/mjyqDTzUcGAIM/Zrv7sYXUENHsfYrfCRX+0qiH458POwgai/fcM0d0+kGoGoW+v/LE3bS+9cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b060ae4ef7091d6b1c05fa4664cbf8fd8acf2661d26739ce58f48e003a523fb2","last_reissued_at":"2026-05-18T00:19:31.809091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:31.809091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate lumpability for Markovian agent-based models using local symmetries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Arnab Auddy, Heinz Koeppl, Wasiur R. KhudaBukhsh, Yann Disser","submitted_at":"2018-04-03T11:16:17Z","abstract_excerpt":"We study a Markovian agent-based model (MABM) in this paper. Each agent is endowed with a local state that changes over time as the agent interacts with its neighbours. The neighbourhood structure is given by a graph. In a recent paper [Simon et al. 2011], the authors used the automorphisms of the underlying graph to generate a lumpable partition of the joint state space ensuring Markovianness of the lumped process for binary dynamics. However, many large random graphs tend to become asymmetric rendering the automorphism-based lumping approach ineffective as a tool of model reduction. In order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00910","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":"1804.00910","created_at":"2026-05-18T00:19:31.809161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00910v1","created_at":"2026-05-18T00:19:31.809161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00910","created_at":"2026-05-18T00:19:31.809161+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBQK4TXXBEOW","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBQK4TXXBEOWWHAF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBQK4TXX","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11508","citing_title":"Reducing Spreading Processes on Networks to Markov Population Models","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W","json":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W.json","graph_json":"https://pith.science/api/pith-number/WBQK4TXXBEOWWHAF7JDGJS7Y7W/graph.json","events_json":"https://pith.science/api/pith-number/WBQK4TXXBEOWWHAF7JDGJS7Y7W/events.json","paper":"https://pith.science/paper/WBQK4TXX"},"agent_actions":{"view_html":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W","download_json":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W.json","view_paper":"https://pith.science/paper/WBQK4TXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00910&json=true","fetch_graph":"https://pith.science/api/pith-number/WBQK4TXXBEOWWHAF7JDGJS7Y7W/graph.json","fetch_events":"https://pith.science/api/pith-number/WBQK4TXXBEOWWHAF7JDGJS7Y7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W/action/storage_attestation","attest_author":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W/action/author_attestation","sign_citation":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W/action/citation_signature","submit_replication":"https://pith.science/pith/WBQK4TXXBEOWWHAF7JDGJS7Y7W/action/replication_record"}},"created_at":"2026-05-18T00:19:31.809161+00:00","updated_at":"2026-05-18T00:19:31.809161+00:00"}