{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:74KDSVMHIIV7DJ7TYYBTICBEIL","short_pith_number":"pith:74KDSVMH","schema_version":"1.0","canonical_sha256":"ff14395587422bf1a7f3c60334082442c0ecf09cc76439df6dc196a58fe01182","source":{"kind":"arxiv","id":"2507.19644","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical clustering and dimensional reduction for optimal control of large-scale agent-based models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Angela Monti, Dante Kalise, Fasma Diele","submitted_at":"2025-07-25T19:34:35Z","abstract_excerpt":"Agent-based models (ABMs) provide a powerful framework to describe complex systems composed of interacting entities, capable of producing emergent collective behaviours such as consensus formation or clustering. However, the increasing dimensionality of these models -- in terms of both the number of agents and the size of their state space -- poses significant computational challenges, particularly in the context of optimal control. In this work, we propose a scalable control frame work for large-scale ABMs based on a twofold model order reduction strategy: agent clustering and projection-base"},"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":"2507.19644","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-25T19:34:35Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"ec7386e7e4ec7a2d2ef3d7cc2afeb0b9df0e5d98db8d23dc42c603cafaf9d784","abstract_canon_sha256":"ffcba7922498b2af4ffa0e43f4b68a899803eefd0e1d27a68b92dd829a725eaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:11.753269Z","signature_b64":"qLvoEZ52fqN9MHqaMZOqFwtHinrDqNmkWhA89fFCZ9pCcnxzkClE4pkoD3Xkak7Hu+cmUSTtEcLHUfHunNGVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff14395587422bf1a7f3c60334082442c0ecf09cc76439df6dc196a58fe01182","last_reissued_at":"2026-07-05T11:44:11.752664Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:11.752664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical clustering and dimensional reduction for optimal control of large-scale agent-based models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Angela Monti, Dante Kalise, Fasma Diele","submitted_at":"2025-07-25T19:34:35Z","abstract_excerpt":"Agent-based models (ABMs) provide a powerful framework to describe complex systems composed of interacting entities, capable of producing emergent collective behaviours such as consensus formation or clustering. However, the increasing dimensionality of these models -- in terms of both the number of agents and the size of their state space -- poses significant computational challenges, particularly in the context of optimal control. In this work, we propose a scalable control frame work for large-scale ABMs based on a twofold model order reduction strategy: agent clustering and projection-base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19644","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.19644/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":"2507.19644","created_at":"2026-07-05T11:44:11.752745+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.19644v1","created_at":"2026-07-05T11:44:11.752745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19644","created_at":"2026-07-05T11:44:11.752745+00:00"},{"alias_kind":"pith_short_12","alias_value":"74KDSVMHIIV7","created_at":"2026-07-05T11:44:11.752745+00:00"},{"alias_kind":"pith_short_16","alias_value":"74KDSVMHIIV7DJ7T","created_at":"2026-07-05T11:44:11.752745+00:00"},{"alias_kind":"pith_short_8","alias_value":"74KDSVMH","created_at":"2026-07-05T11:44:11.752745+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07907","citing_title":"A statistical physics framework for optimal learning","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL","json":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL.json","graph_json":"https://pith.science/api/pith-number/74KDSVMHIIV7DJ7TYYBTICBEIL/graph.json","events_json":"https://pith.science/api/pith-number/74KDSVMHIIV7DJ7TYYBTICBEIL/events.json","paper":"https://pith.science/paper/74KDSVMH"},"agent_actions":{"view_html":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL","download_json":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL.json","view_paper":"https://pith.science/paper/74KDSVMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.19644&json=true","fetch_graph":"https://pith.science/api/pith-number/74KDSVMHIIV7DJ7TYYBTICBEIL/graph.json","fetch_events":"https://pith.science/api/pith-number/74KDSVMHIIV7DJ7TYYBTICBEIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL/action/storage_attestation","attest_author":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL/action/author_attestation","sign_citation":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL/action/citation_signature","submit_replication":"https://pith.science/pith/74KDSVMHIIV7DJ7TYYBTICBEIL/action/replication_record"}},"created_at":"2026-07-05T11:44:11.752745+00:00","updated_at":"2026-07-05T11:44:11.752745+00:00"}