{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:P6KTBPWHKXGG2RPFCGPRSWVJES","short_pith_number":"pith:P6KTBPWH","canonical_record":{"source":{"id":"2112.09161","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T19:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"f5b51fd41cdb7c300b185e1eb275cbc81dfe823011159b0224323e9013986533","abstract_canon_sha256":"b1d379fae17def1f81648565d05ccdc3307da2309f0e2b578479b88edc314c1b"},"schema_version":"1.0"},"canonical_sha256":"7f9530bec755cc6d45e5119f195aa924a11e2e21a13e61cf3a9338cc228a4042","source":{"kind":"arxiv","id":"2112.09161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09161","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09161v2","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09161","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"P6KTBPWHKXGG","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"pith_short_16","alias_value":"P6KTBPWHKXGG2RPF","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"pith_short_8","alias_value":"P6KTBPWH","created_at":"2026-07-05T03:52:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:P6KTBPWHKXGG2RPFCGPRSWVJES","target":"record","payload":{"canonical_record":{"source":{"id":"2112.09161","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T19:15:11Z","cross_cats_sorted":[],"title_canon_sha256":"f5b51fd41cdb7c300b185e1eb275cbc81dfe823011159b0224323e9013986533","abstract_canon_sha256":"b1d379fae17def1f81648565d05ccdc3307da2309f0e2b578479b88edc314c1b"},"schema_version":"1.0"},"canonical_sha256":"7f9530bec755cc6d45e5119f195aa924a11e2e21a13e61cf3a9338cc228a4042","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:15.776241Z","signature_b64":"UJPuB8589kYnzUMiVkBrOZFcMnpn3CxVCe65Caul865IuZ8Qk+933/gonXM/PZTHOORTWDjv3nYEkHltPwlHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f9530bec755cc6d45e5119f195aa924a11e2e21a13e61cf3a9338cc228a4042","last_reissued_at":"2026-07-05T03:52:15.775769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:15.775769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.09161","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKA6NpFD8pUDbhuTB+u4HVx9r2QtYnGF43dpcOsN1O+o9godbDaIY3TuHgMu7wFN0UVbDPR1aUNXwCS5VzzfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:46:22.951931Z"},"content_sha256":"49b3fe2e9eb298727d43c1503c252eab297094ad25338bcc3770bea941eb0267","schema_version":"1.0","event_id":"sha256:49b3fe2e9eb298727d43c1503c252eab297094ad25338bcc3770bea941eb0267"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:P6KTBPWHKXGG2RPFCGPRSWVJES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint-based graph network simulator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alvaro Sanchez-Gonzalez, Peter Battaglia, Tobias Pfaff, Yulia Rubanova","submitted_at":"2021-12-16T19:15:11Z","abstract_excerpt":"In the area of physical simulations, nearly all neural-network-based methods directly predict future states from the input states. However, many traditional simulation engines instead model the constraints of the system and select the state which satisfies them. Here we present a framework for constraint-based learned simulation, where a scalar constraint function is implemented as a graph neural network, and future predictions are computed by solving the optimization problem defined by the learned constraint. Our model achieves comparable or better accuracy to top learned simulators on a vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09161","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/2112.09161/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0bqvUKjxARDWc+IP5W2NR/wMfcLmRkIUkgF9xU76QE+a5Z5yRt9Rkw6shnp4tdawDaZ3wiYM4WNE5CTOfXOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:46:22.952452Z"},"content_sha256":"b554568d38e63e1d2c8c9eac59875de4d7b29c841b833bcf496f98c67b2fd0ae","schema_version":"1.0","event_id":"sha256:b554568d38e63e1d2c8c9eac59875de4d7b29c841b833bcf496f98c67b2fd0ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6KTBPWHKXGG2RPFCGPRSWVJES/bundle.json","state_url":"https://pith.science/pith/P6KTBPWHKXGG2RPFCGPRSWVJES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6KTBPWHKXGG2RPFCGPRSWVJES/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T01:46:22Z","links":{"resolver":"https://pith.science/pith/P6KTBPWHKXGG2RPFCGPRSWVJES","bundle":"https://pith.science/pith/P6KTBPWHKXGG2RPFCGPRSWVJES/bundle.json","state":"https://pith.science/pith/P6KTBPWHKXGG2RPFCGPRSWVJES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6KTBPWHKXGG2RPFCGPRSWVJES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:P6KTBPWHKXGG2RPFCGPRSWVJES","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b1d379fae17def1f81648565d05ccdc3307da2309f0e2b578479b88edc314c1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T19:15:11Z","title_canon_sha256":"f5b51fd41cdb7c300b185e1eb275cbc81dfe823011159b0224323e9013986533"},"schema_version":"1.0","source":{"id":"2112.09161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09161","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09161v2","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09161","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"P6KTBPWHKXGG","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"pith_short_16","alias_value":"P6KTBPWHKXGG2RPF","created_at":"2026-07-05T03:52:15Z"},{"alias_kind":"pith_short_8","alias_value":"P6KTBPWH","created_at":"2026-07-05T03:52:15Z"}],"graph_snapshots":[{"event_id":"sha256:b554568d38e63e1d2c8c9eac59875de4d7b29c841b833bcf496f98c67b2fd0ae","target":"graph","created_at":"2026-07-05T03:52:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.09161/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the area of physical simulations, nearly all neural-network-based methods directly predict future states from the input states. However, many traditional simulation engines instead model the constraints of the system and select the state which satisfies them. Here we present a framework for constraint-based learned simulation, where a scalar constraint function is implemented as a graph neural network, and future predictions are computed by solving the optimization problem defined by the learned constraint. Our model achieves comparable or better accuracy to top learned simulators on a vari","authors_text":"Alvaro Sanchez-Gonzalez, Peter Battaglia, Tobias Pfaff, Yulia Rubanova","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T19:15:11Z","title":"Constraint-based graph network simulator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09161","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:49b3fe2e9eb298727d43c1503c252eab297094ad25338bcc3770bea941eb0267","target":"record","created_at":"2026-07-05T03:52:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b1d379fae17def1f81648565d05ccdc3307da2309f0e2b578479b88edc314c1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-16T19:15:11Z","title_canon_sha256":"f5b51fd41cdb7c300b185e1eb275cbc81dfe823011159b0224323e9013986533"},"schema_version":"1.0","source":{"id":"2112.09161","kind":"arxiv","version":2}},"canonical_sha256":"7f9530bec755cc6d45e5119f195aa924a11e2e21a13e61cf3a9338cc228a4042","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f9530bec755cc6d45e5119f195aa924a11e2e21a13e61cf3a9338cc228a4042","first_computed_at":"2026-07-05T03:52:15.775769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:15.775769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UJPuB8589kYnzUMiVkBrOZFcMnpn3CxVCe65Caul865IuZ8Qk+933/gonXM/PZTHOORTWDjv3nYEkHltPwlHDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:15.776241Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.09161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49b3fe2e9eb298727d43c1503c252eab297094ad25338bcc3770bea941eb0267","sha256:b554568d38e63e1d2c8c9eac59875de4d7b29c841b833bcf496f98c67b2fd0ae"],"state_sha256":"911a2079fec1af8caf8292f9b3e08e578a3c2c3d68821265b929bb03580a5dfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TtSntdHuLYkM0Xz8xlqbQaQbpgQtkSZdIisjEgs/01jhqzAsJT0BQh2XikL83w9AWtI2BxTEYfnqneWn3eyTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:46:22.956790Z","bundle_sha256":"9a8bd2afaa6bc1c18ee65f437252dc393ab9fa47a86937ec9d4a8649806b50f3"}}