{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DE76QVH4G5COBGFRQBDVEKSFFB","short_pith_number":"pith:DE76QVH4","canonical_record":{"source":{"id":"1810.07178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.GN","submitted_at":"2018-10-16T10:03:35Z","cross_cats_sorted":["cond-mat.stat-mech","q-fin.EC","q-fin.GN"],"title_canon_sha256":"c7ca620f2a77080f89b5739b58363f77d84011ee7e611304516a503769350fe4","abstract_canon_sha256":"b3b18e27634c5cf4c5d42fd4d9fdec837fcae041736bb3abdb867d685dd20319"},"schema_version":"1.0"},"canonical_sha256":"193fe854fc3744e098b18047522a45284a79d6a0bf3e1dd59c107f9a1b4b04a1","source":{"kind":"arxiv","id":"1810.07178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07178","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07178v1","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07178","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"DE76QVH4G5CO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DE76QVH4G5COBGFR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DE76QVH4","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DE76QVH4G5COBGFRQBDVEKSFFB","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.GN","submitted_at":"2018-10-16T10:03:35Z","cross_cats_sorted":["cond-mat.stat-mech","q-fin.EC","q-fin.GN"],"title_canon_sha256":"c7ca620f2a77080f89b5739b58363f77d84011ee7e611304516a503769350fe4","abstract_canon_sha256":"b3b18e27634c5cf4c5d42fd4d9fdec837fcae041736bb3abdb867d685dd20319"},"schema_version":"1.0"},"canonical_sha256":"193fe854fc3744e098b18047522a45284a79d6a0bf3e1dd59c107f9a1b4b04a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:59.205609Z","signature_b64":"RkDuAC7hZDNhLUbDPLISwNJf+BDe2AyKzB8Agyv4I/TMehp2wAPy8IbCKGtIZGWjUpMiVNkm/yi48mdL+HPfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"193fe854fc3744e098b18047522a45284a79d6a0bf3e1dd59c107f9a1b4b04a1","last_reissued_at":"2026-05-18T00:02:59.204974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:59.204974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07178","source_version":1,"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-05-18T00:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7nkPBJxf/TCN5AGnQfc6N6n1KiyJQjcI6RqCexwSmcI62FNP3xdOglzSIalW67e9z4fyrcgoiKnAgmhMoqaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:08:30.727435Z"},"content_sha256":"c85318322e58501008cc416c8d52a3ec90fab28c2b87c716c45b258993032327","schema_version":"1.0","event_id":"sha256:c85318322e58501008cc416c8d52a3ec90fab28c2b87c716c45b258993032327"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DE76QVH4G5COBGFRQBDVEKSFFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Path Integral Approach to Business Cycle Models with Large Number of Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","q-fin.EC","q-fin.GN"],"primary_cat":"econ.GN","authors_text":"A\\\"ileen Lotz, Marc Wambst (IRMA), Pierre Gosselin (IF)","submitted_at":"2018-10-16T10:03:35Z","abstract_excerpt":"This paper presents an analytical treatment of economic systems with an arbitrary number of agents that keeps track of the systems' interactions and agents' complexity. This formalism does not seek to aggregate agents. It rather replaces the standard optimization approach by a probabilistic description of both the entire system and agents'behaviors. This is done in two distinct steps. A first step considers an interacting system involving an arbitrary number of agents, where each agent's utility function is subject to unpredictable shocks. In such a setting, individual optimization problems ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07178","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"},"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-05-18T00:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYyd2emT8iO5o5Gur/Xv6WNRrZOesUU0pZkKra54ZngHuMNqxRTQE7n6A1dUF8RQph3Pe4BMx/CPOiGg5ioWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:08:30.727799Z"},"content_sha256":"688d59488b21a8f70d8e85d4e69820e2dacd3ced80f047f7743af7140885c6a4","schema_version":"1.0","event_id":"sha256:688d59488b21a8f70d8e85d4e69820e2dacd3ced80f047f7743af7140885c6a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DE76QVH4G5COBGFRQBDVEKSFFB/bundle.json","state_url":"https://pith.science/pith/DE76QVH4G5COBGFRQBDVEKSFFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DE76QVH4G5COBGFRQBDVEKSFFB/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-06-22T18:08:30Z","links":{"resolver":"https://pith.science/pith/DE76QVH4G5COBGFRQBDVEKSFFB","bundle":"https://pith.science/pith/DE76QVH4G5COBGFRQBDVEKSFFB/bundle.json","state":"https://pith.science/pith/DE76QVH4G5COBGFRQBDVEKSFFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DE76QVH4G5COBGFRQBDVEKSFFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DE76QVH4G5COBGFRQBDVEKSFFB","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":"b3b18e27634c5cf4c5d42fd4d9fdec837fcae041736bb3abdb867d685dd20319","cross_cats_sorted":["cond-mat.stat-mech","q-fin.EC","q-fin.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.GN","submitted_at":"2018-10-16T10:03:35Z","title_canon_sha256":"c7ca620f2a77080f89b5739b58363f77d84011ee7e611304516a503769350fe4"},"schema_version":"1.0","source":{"id":"1810.07178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07178","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07178v1","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07178","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"DE76QVH4G5CO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DE76QVH4G5COBGFR","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DE76QVH4","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:688d59488b21a8f70d8e85d4e69820e2dacd3ced80f047f7743af7140885c6a4","target":"graph","created_at":"2026-05-18T00:02:59Z","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"},"paper":{"abstract_excerpt":"This paper presents an analytical treatment of economic systems with an arbitrary number of agents that keeps track of the systems' interactions and agents' complexity. This formalism does not seek to aggregate agents. It rather replaces the standard optimization approach by a probabilistic description of both the entire system and agents'behaviors. This is done in two distinct steps. A first step considers an interacting system involving an arbitrary number of agents, where each agent's utility function is subject to unpredictable shocks. In such a setting, individual optimization problems ne","authors_text":"A\\\"ileen Lotz, Marc Wambst (IRMA), Pierre Gosselin (IF)","cross_cats":["cond-mat.stat-mech","q-fin.EC","q-fin.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.GN","submitted_at":"2018-10-16T10:03:35Z","title":"A Path Integral Approach to Business Cycle Models with Large Number of Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07178","kind":"arxiv","version":1},"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:c85318322e58501008cc416c8d52a3ec90fab28c2b87c716c45b258993032327","target":"record","created_at":"2026-05-18T00:02:59Z","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":"b3b18e27634c5cf4c5d42fd4d9fdec837fcae041736bb3abdb867d685dd20319","cross_cats_sorted":["cond-mat.stat-mech","q-fin.EC","q-fin.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.GN","submitted_at":"2018-10-16T10:03:35Z","title_canon_sha256":"c7ca620f2a77080f89b5739b58363f77d84011ee7e611304516a503769350fe4"},"schema_version":"1.0","source":{"id":"1810.07178","kind":"arxiv","version":1}},"canonical_sha256":"193fe854fc3744e098b18047522a45284a79d6a0bf3e1dd59c107f9a1b4b04a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"193fe854fc3744e098b18047522a45284a79d6a0bf3e1dd59c107f9a1b4b04a1","first_computed_at":"2026-05-18T00:02:59.204974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:59.204974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RkDuAC7hZDNhLUbDPLISwNJf+BDe2AyKzB8Agyv4I/TMehp2wAPy8IbCKGtIZGWjUpMiVNkm/yi48mdL+HPfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:59.205609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c85318322e58501008cc416c8d52a3ec90fab28c2b87c716c45b258993032327","sha256:688d59488b21a8f70d8e85d4e69820e2dacd3ced80f047f7743af7140885c6a4"],"state_sha256":"c31a2494ced1241bcfc6d82be3fdc209784cf02bc87bbda2dc8077185794c707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"289aeN0f9ESc8Bs8k25tfkJM8P8kfm5RF+Bnw78nS8c5aWoXzUZXjGonWtBEUNB5HonYovw9FyaMxVVYp/AfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:08:30.729731Z","bundle_sha256":"412ee8ec13e2efc67ae9ed7f70f850420ba6034fee8ddb189d873e8e9c4ae309"}}