{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P4LE5FQVUFHGM2J4V3M3CZI2LO","short_pith_number":"pith:P4LE5FQV","schema_version":"1.0","canonical_sha256":"7f164e9615a14e66693caed9b1651a5b992275109375bd82d564d6262f1e97be","source":{"kind":"arxiv","id":"2405.09324","version":2},"attestation_state":"computed","paper":{"title":"Learning Coarse-Grained Dynamics on Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Daning Huang, John Harlim, Yan Li, Yin Yu","submitted_at":"2024-05-15T13:25:34Z","abstract_excerpt":"We consider a Graph Neural Network (GNN) non-Markovian modeling framework to identify coarse-grained dynamical systems on graphs. Our main idea is to systematically determine the GNN architecture by inspecting how the leading term of the Mori-Zwanzig memory term depends on the coarse-grained interaction coefficients that encode the graph topology. Based on this analysis, we found that the appropriate GNN architecture that will account for $K$-hop dynamical interactions has to employ a Message Passing (MP) mechanism with at least $2K$ steps. We also deduce that the memory length required for an"},"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":"2405.09324","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-05-15T13:25:34Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","cs.NA"],"title_canon_sha256":"36049e26511b2b2a92c37fa8308e0f21ba24a4d9c42d2a2e7be0d1af839422a3","abstract_canon_sha256":"d6ac0b3b96d96227b02429e2cd8be9be4955be95f4e56fa0c7ad1077fbef0939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:08.013054Z","signature_b64":"tk8uDsVUYqwLrkyoH5NCs/C7MnSK15JlDwb8ungBzhe3f0w4PM6Kz+Yz+OOW4FRRIL0R8yCnXKc8miOuqx99BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f164e9615a14e66693caed9b1651a5b992275109375bd82d564d6262f1e97be","last_reissued_at":"2026-07-05T10:45:08.012572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:08.012572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Coarse-Grained Dynamics on Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Daning Huang, John Harlim, Yan Li, Yin Yu","submitted_at":"2024-05-15T13:25:34Z","abstract_excerpt":"We consider a Graph Neural Network (GNN) non-Markovian modeling framework to identify coarse-grained dynamical systems on graphs. Our main idea is to systematically determine the GNN architecture by inspecting how the leading term of the Mori-Zwanzig memory term depends on the coarse-grained interaction coefficients that encode the graph topology. Based on this analysis, we found that the appropriate GNN architecture that will account for $K$-hop dynamical interactions has to employ a Message Passing (MP) mechanism with at least $2K$ steps. We also deduce that the memory length required for an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09324","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.09324/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":"2405.09324","created_at":"2026-07-05T10:45:08.012631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.09324v2","created_at":"2026-07-05T10:45:08.012631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09324","created_at":"2026-07-05T10:45:08.012631+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4LE5FQVUFHG","created_at":"2026-07-05T10:45:08.012631+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4LE5FQVUFHGM2J4","created_at":"2026-07-05T10:45:08.012631+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4LE5FQV","created_at":"2026-07-05T10:45:08.012631+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22890","citing_title":"Physics-Infused Reduced-Order Modeling for Analysis of Multi-Layered Hypersonic Thermal Protection Systems","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO","json":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO.json","graph_json":"https://pith.science/api/pith-number/P4LE5FQVUFHGM2J4V3M3CZI2LO/graph.json","events_json":"https://pith.science/api/pith-number/P4LE5FQVUFHGM2J4V3M3CZI2LO/events.json","paper":"https://pith.science/paper/P4LE5FQV"},"agent_actions":{"view_html":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO","download_json":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO.json","view_paper":"https://pith.science/paper/P4LE5FQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.09324&json=true","fetch_graph":"https://pith.science/api/pith-number/P4LE5FQVUFHGM2J4V3M3CZI2LO/graph.json","fetch_events":"https://pith.science/api/pith-number/P4LE5FQVUFHGM2J4V3M3CZI2LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO/action/storage_attestation","attest_author":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO/action/author_attestation","sign_citation":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO/action/citation_signature","submit_replication":"https://pith.science/pith/P4LE5FQVUFHGM2J4V3M3CZI2LO/action/replication_record"}},"created_at":"2026-07-05T10:45:08.012631+00:00","updated_at":"2026-07-05T10:45:08.012631+00:00"}