{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DTZ6ORK4SVJE75FR4XYLR4V6UF","short_pith_number":"pith:DTZ6ORK4","canonical_record":{"source":{"id":"2006.03964","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-06-06T20:27:59Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c02e4bdd50b57155f2fc9b16f3f37bfaaa3e16115b52b47370da9ffb4655efce","abstract_canon_sha256":"92b1ac0b8b06be6ce08711004b97720fe2c0fb06a1979a04128c3bd72c32bf33"},"schema_version":"1.0"},"canonical_sha256":"1cf3e7455c95524ff4b1e5f0b8f2bea140bb178776ca38ff374f83092078d594","source":{"kind":"arxiv","id":"2006.03964","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.03964","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"2006.03964v2","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03964","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"DTZ6ORK4SVJE","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"pith_short_16","alias_value":"DTZ6ORK4SVJE75FR","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"pith_short_8","alias_value":"DTZ6ORK4","created_at":"2026-07-05T02:51:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DTZ6ORK4SVJE75FR4XYLR4V6UF","target":"record","payload":{"canonical_record":{"source":{"id":"2006.03964","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-06-06T20:27:59Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"c02e4bdd50b57155f2fc9b16f3f37bfaaa3e16115b52b47370da9ffb4655efce","abstract_canon_sha256":"92b1ac0b8b06be6ce08711004b97720fe2c0fb06a1979a04128c3bd72c32bf33"},"schema_version":"1.0"},"canonical_sha256":"1cf3e7455c95524ff4b1e5f0b8f2bea140bb178776ca38ff374f83092078d594","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:53.517433Z","signature_b64":"4nLpgMawIiVpcGrkpuZvR2Wqc72PMRfqlvpQPY5RZpV/4WIM2yiVJm+8NFQH7m+/72YH/al4puLo/cT9MVMSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf3e7455c95524ff4b1e5f0b8f2bea140bb178776ca38ff374f83092078d594","last_reissued_at":"2026-07-05T02:51:53.516945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:53.516945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.03964","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-05T02:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fI3421svJ5nEeDiWaz6hFBkhDQTENzJPhA68/IZvW3HAh7bF257YLFvjno2dXCiV4sKH+aB7N9NwhOHmRzXOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:40:57.534285Z"},"content_sha256":"e16cf1c736729a9969e710a8968fdfd4114f786a8075522496128982c77ddf52","schema_version":"1.0","event_id":"sha256:e16cf1c736729a9969e710a8968fdfd4114f786a8075522496128982c77ddf52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DTZ6ORK4SVJE75FR4XYLR4V6UF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Quadratic Graphon Field Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Peter E. Caines, Rinel Foguen Tchuendom, Shuang Gao","submitted_at":"2020-06-06T20:27:59Z","abstract_excerpt":"Linear quadratic graphon field games (LQ-GFGs) are defined to be LQ games which involve a large number of agents that are weakly coupled via a weighted undirected graph on which each node represents an agent. The links of the graph correspond to couplings between the agents' dynamics, as well as between the individual cost functions, which each agent attempts to minimize. We formulate limit LQ-GFG problems based on the assumption that these graphs lie in a sequence which converges to a limit graphon. First, under a finite-rank assumption on the limit graphon, the existence and uniqueness of so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03964","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/2006.03964/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-05T02:51:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7KFgHujoyR1uUS6FU5egXd3f//09h/QWCp3D1c1ANNBNeph6iECLicSJrK184HofOxt/zt4nkvxEqNcMRuRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:40:57.534980Z"},"content_sha256":"1443c443e32d9ce728f4d044a446321bfd8eb1d4da704d0cf7ed42f515ba5809","schema_version":"1.0","event_id":"sha256:1443c443e32d9ce728f4d044a446321bfd8eb1d4da704d0cf7ed42f515ba5809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTZ6ORK4SVJE75FR4XYLR4V6UF/bundle.json","state_url":"https://pith.science/pith/DTZ6ORK4SVJE75FR4XYLR4V6UF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTZ6ORK4SVJE75FR4XYLR4V6UF/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-09T02:40:57Z","links":{"resolver":"https://pith.science/pith/DTZ6ORK4SVJE75FR4XYLR4V6UF","bundle":"https://pith.science/pith/DTZ6ORK4SVJE75FR4XYLR4V6UF/bundle.json","state":"https://pith.science/pith/DTZ6ORK4SVJE75FR4XYLR4V6UF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTZ6ORK4SVJE75FR4XYLR4V6UF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DTZ6ORK4SVJE75FR4XYLR4V6UF","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":"92b1ac0b8b06be6ce08711004b97720fe2c0fb06a1979a04128c3bd72c32bf33","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-06-06T20:27:59Z","title_canon_sha256":"c02e4bdd50b57155f2fc9b16f3f37bfaaa3e16115b52b47370da9ffb4655efce"},"schema_version":"1.0","source":{"id":"2006.03964","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.03964","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"arxiv_version","alias_value":"2006.03964v2","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03964","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"pith_short_12","alias_value":"DTZ6ORK4SVJE","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"pith_short_16","alias_value":"DTZ6ORK4SVJE75FR","created_at":"2026-07-05T02:51:53Z"},{"alias_kind":"pith_short_8","alias_value":"DTZ6ORK4","created_at":"2026-07-05T02:51:53Z"}],"graph_snapshots":[{"event_id":"sha256:1443c443e32d9ce728f4d044a446321bfd8eb1d4da704d0cf7ed42f515ba5809","target":"graph","created_at":"2026-07-05T02:51:53Z","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/2006.03964/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Linear quadratic graphon field games (LQ-GFGs) are defined to be LQ games which involve a large number of agents that are weakly coupled via a weighted undirected graph on which each node represents an agent. The links of the graph correspond to couplings between the agents' dynamics, as well as between the individual cost functions, which each agent attempts to minimize. We formulate limit LQ-GFG problems based on the assumption that these graphs lie in a sequence which converges to a limit graphon. First, under a finite-rank assumption on the limit graphon, the existence and uniqueness of so","authors_text":"Peter E. Caines, Rinel Foguen Tchuendom, Shuang Gao","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-06-06T20:27:59Z","title":"Linear Quadratic Graphon Field Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03964","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:e16cf1c736729a9969e710a8968fdfd4114f786a8075522496128982c77ddf52","target":"record","created_at":"2026-07-05T02:51:53Z","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":"92b1ac0b8b06be6ce08711004b97720fe2c0fb06a1979a04128c3bd72c32bf33","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-06-06T20:27:59Z","title_canon_sha256":"c02e4bdd50b57155f2fc9b16f3f37bfaaa3e16115b52b47370da9ffb4655efce"},"schema_version":"1.0","source":{"id":"2006.03964","kind":"arxiv","version":2}},"canonical_sha256":"1cf3e7455c95524ff4b1e5f0b8f2bea140bb178776ca38ff374f83092078d594","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cf3e7455c95524ff4b1e5f0b8f2bea140bb178776ca38ff374f83092078d594","first_computed_at":"2026-07-05T02:51:53.516945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:51:53.516945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4nLpgMawIiVpcGrkpuZvR2Wqc72PMRfqlvpQPY5RZpV/4WIM2yiVJm+8NFQH7m+/72YH/al4puLo/cT9MVMSAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:51:53.517433Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.03964","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16cf1c736729a9969e710a8968fdfd4114f786a8075522496128982c77ddf52","sha256:1443c443e32d9ce728f4d044a446321bfd8eb1d4da704d0cf7ed42f515ba5809"],"state_sha256":"5398dbdca1e041cc8d1d25e4014bffd5d3358be8299ece90355c941e12950161"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xBDiIIrOU6HvUwLiezoA79UfvxSsza4FbpJD7adBWW4Ndk/1xlwgu4/FoWG+T9Z3e6XJWUBpax6kPkm1mwVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:40:57.540487Z","bundle_sha256":"a5e18f40d16bc0128cfe17c5dca6369ebfb43e1e1ac03ce4aec15fb591397031"}}