{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZL2DKVGXSVVS4WAHTOZ66J7HI4","short_pith_number":"pith:ZL2DKVGX","canonical_record":{"source":{"id":"1908.01714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-05T16:38:54Z","cross_cats_sorted":["q-fin.GN","q-fin.RM"],"title_canon_sha256":"41903473f5387deffc667011145114f3bc66e17488eea12ebe0dfffaad94fe34","abstract_canon_sha256":"d665cae18cb102f7b268506a615bbb64229520e38467a688f337e44566486b26"},"schema_version":"1.0"},"canonical_sha256":"caf43554d7956b2e58079bb3ef27e7472e53a4c7cbb5519b0ddda43741b83de5","source":{"kind":"arxiv","id":"1908.01714","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01714","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01714v3","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01714","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZL2DKVGXSVVS","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"pith_short_16","alias_value":"ZL2DKVGXSVVS4WAH","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"pith_short_8","alias_value":"ZL2DKVGX","created_at":"2026-07-05T07:26:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZL2DKVGXSVVS4WAHTOZ66J7HI4","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-05T16:38:54Z","cross_cats_sorted":["q-fin.GN","q-fin.RM"],"title_canon_sha256":"41903473f5387deffc667011145114f3bc66e17488eea12ebe0dfffaad94fe34","abstract_canon_sha256":"d665cae18cb102f7b268506a615bbb64229520e38467a688f337e44566486b26"},"schema_version":"1.0"},"canonical_sha256":"caf43554d7956b2e58079bb3ef27e7472e53a4c7cbb5519b0ddda43741b83de5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:54.296034Z","signature_b64":"d8v1bJZ7KGJksRxdnhi8aYAsylr5rJAGR6ZZA2fHtX433AEKhPu001Q3Z7fUC9RSLmG4IbEBNCU3AmhzHMWTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caf43554d7956b2e58079bb3ef27e7472e53a4c7cbb5519b0ddda43741b83de5","last_reissued_at":"2026-07-05T07:26:54.295679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:54.295679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01714","source_version":3,"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-05T07:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5ka8rwNWGg9Z25+2eHQ50IlWIetHik+jwRRtkt3sZUSHPWEiz9RdtTIEvc0GZQnEnQSEDrtcr8vTf+JZx8qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:02:18.864173Z"},"content_sha256":"890b1db9600c8c1af675625be16f8075c8cee6bd40bd00279e605aacbc6edc7d","schema_version":"1.0","event_id":"sha256:890b1db9600c8c1af675625be16f8075c8cee6bd40bd00279e605aacbc6edc7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZL2DKVGXSVVS4WAHTOZ66J7HI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flow Allocation Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.GN","q-fin.RM"],"primary_cat":"cs.GT","authors_text":"Daniel Schmand, Martin Hoefer, Nils Bertschinger","submitted_at":"2019-08-05T16:38:54Z","abstract_excerpt":"We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges. Given the strategy choices of all agents, a maximal circulation that adheres to the chosen allocation strategies evolves in the network. Each agent wants to maximize the amount of flow through her node. Flow allocation games can be used to express strategic incentives of clearing in financial networks. We provide a cumulative set of results on the existence and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01714","kind":"arxiv","version":3},"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/1908.01714/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-05T07:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2asvratFEjdqolYa9gP4Fkgv3ogJvlFV5CgIL4iXKmp+zqV6eJO7etMhG7BlWR4kbT2ilsaVlr3Ebs0IbijAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:02:18.864706Z"},"content_sha256":"dbc376b4b7c0daaab034301fda157b60944788456ddd90a098fc0021564e2c45","schema_version":"1.0","event_id":"sha256:dbc376b4b7c0daaab034301fda157b60944788456ddd90a098fc0021564e2c45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZL2DKVGXSVVS4WAHTOZ66J7HI4/bundle.json","state_url":"https://pith.science/pith/ZL2DKVGXSVVS4WAHTOZ66J7HI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZL2DKVGXSVVS4WAHTOZ66J7HI4/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-16T10:02:18Z","links":{"resolver":"https://pith.science/pith/ZL2DKVGXSVVS4WAHTOZ66J7HI4","bundle":"https://pith.science/pith/ZL2DKVGXSVVS4WAHTOZ66J7HI4/bundle.json","state":"https://pith.science/pith/ZL2DKVGXSVVS4WAHTOZ66J7HI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZL2DKVGXSVVS4WAHTOZ66J7HI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZL2DKVGXSVVS4WAHTOZ66J7HI4","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":"d665cae18cb102f7b268506a615bbb64229520e38467a688f337e44566486b26","cross_cats_sorted":["q-fin.GN","q-fin.RM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-05T16:38:54Z","title_canon_sha256":"41903473f5387deffc667011145114f3bc66e17488eea12ebe0dfffaad94fe34"},"schema_version":"1.0","source":{"id":"1908.01714","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01714","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01714v3","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01714","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZL2DKVGXSVVS","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"pith_short_16","alias_value":"ZL2DKVGXSVVS4WAH","created_at":"2026-07-05T07:26:54Z"},{"alias_kind":"pith_short_8","alias_value":"ZL2DKVGX","created_at":"2026-07-05T07:26:54Z"}],"graph_snapshots":[{"event_id":"sha256:dbc376b4b7c0daaab034301fda157b60944788456ddd90a098fc0021564e2c45","target":"graph","created_at":"2026-07-05T07:26:54Z","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/1908.01714/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges. Given the strategy choices of all agents, a maximal circulation that adheres to the chosen allocation strategies evolves in the network. Each agent wants to maximize the amount of flow through her node. Flow allocation games can be used to express strategic incentives of clearing in financial networks. We provide a cumulative set of results on the existence and","authors_text":"Daniel Schmand, Martin Hoefer, Nils Bertschinger","cross_cats":["q-fin.GN","q-fin.RM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-05T16:38:54Z","title":"Flow Allocation Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01714","kind":"arxiv","version":3},"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:890b1db9600c8c1af675625be16f8075c8cee6bd40bd00279e605aacbc6edc7d","target":"record","created_at":"2026-07-05T07:26:54Z","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":"d665cae18cb102f7b268506a615bbb64229520e38467a688f337e44566486b26","cross_cats_sorted":["q-fin.GN","q-fin.RM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-05T16:38:54Z","title_canon_sha256":"41903473f5387deffc667011145114f3bc66e17488eea12ebe0dfffaad94fe34"},"schema_version":"1.0","source":{"id":"1908.01714","kind":"arxiv","version":3}},"canonical_sha256":"caf43554d7956b2e58079bb3ef27e7472e53a4c7cbb5519b0ddda43741b83de5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"caf43554d7956b2e58079bb3ef27e7472e53a4c7cbb5519b0ddda43741b83de5","first_computed_at":"2026-07-05T07:26:54.295679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:26:54.295679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d8v1bJZ7KGJksRxdnhi8aYAsylr5rJAGR6ZZA2fHtX433AEKhPu001Q3Z7fUC9RSLmG4IbEBNCU3AmhzHMWTAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:26:54.296034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01714","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890b1db9600c8c1af675625be16f8075c8cee6bd40bd00279e605aacbc6edc7d","sha256:dbc376b4b7c0daaab034301fda157b60944788456ddd90a098fc0021564e2c45"],"state_sha256":"acd8917006de5069be6c4697a4d8bb6eafa00d471fd2285bc84b43ae31d828fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12jNllf8HXNldgous0tqrDt+C1VLu6Mzuxy943DuFRsSw4Yup1amwZZl6qQYYU2DnRlPNNIU7XTDXn1KbkP8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:02:18.869808Z","bundle_sha256":"da357906523b49174d564fb3e1fb3ebadf1a7d2bd11c69962d0eb943b3380855"}}