{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TB53WWDIMHXDOFWAA75QP3P2VN","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":"9454751615741bca1b91bd39c18c85b155e0f145fa3f2c61a7fd160a8a83976c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-05-14T07:25:52Z","title_canon_sha256":"631ee5f63a49af39655ae58509f3c3e93e1181475ca94e91413b4718f827cc2c"},"schema_version":"1.0","source":{"id":"2605.14485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14485","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14485v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14485","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"TB53WWDIMHXD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TB53WWDIMHXDOFWA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TB53WWDI","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:8810c83510a823c381b71e742ad3e0ab19f48dc59a706cb48d12897ba416ea2e","target":"graph","created_at":"2026-05-17T23:39:06Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our main axiomatic result characterizes a family of rules, which set each agent's liability to be proportional to the system's total realized losses with agent weights depending only on the network structure."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The sequential-move game induced by the liability rule leads agents to select efficient paths; this relies on the assumption that the cascade mechanism and loss structure are exactly as modeled and that agents act to minimize their own expected liability under the proportional rule."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A family of liability rules sets payments proportional to total realized losses with network-structure weights that implement efficient path selection in sequential shock games, coinciding with the Shapley value of a path-counting cooperative game and computable in polynomial time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Proportional liability rules with network-only weights induce agents to select paths minimizing total cascade losses."}],"snapshot_sha256":"7947653e48a10fcfeafa17c2a505c02c9440d3dd3da8719bb2ba71dad6763d19"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"2262450f68e4f900c195aede9ef17d0d19060031621255df35495a88f7f5a52a"},"paper":{"abstract_excerpt":"We study a model in which shocks propagate along a path chosen by agents embedded in a network. When a shock hits an agent, the affected agent cancels one of her outgoing edges. This cancellation cascades sequentially along a chosen path until reaching a terminal agent, resulting in a systemic cost equal to the sum of individual cancellation losses. A liability rule determines agent payments for realized losses, and we seek to implement efficient path selection in the induced sequential-move game. Our main axiomatic result characterizes a family of rules, which set each agent's liability to be","authors_text":"Alexandros Rigos, Jens Gudmundsson, Jens Leth Hougaard, Kohmei Makihara","cross_cats":[],"headline":"Proportional liability rules with network-only weights induce agents to select paths minimizing total cascade losses.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-05-14T07:25:52Z","title":"Efficient liability assignment under shock propagation"},"references":{"count":46,"internal_anchors":0,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Anshelevich, E. and Dasgupta, A. and Kleinberg, J. and Tardos, E. and Wexler, T. and Roughgarden, T. , title =. SIAM Journal on Computing , year =","work_id":"4f5d0e3b-2474-4644-8f20-cf64c52b4044","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bakshi, N and Kleindorfer, P. , title =. Production and Operations Management , year =","work_id":"8a3414d7-8242-43f7-9bde-cd1affa8a46e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Bakshi, N. and Mohan, S. , title =. Manufactoring & Service Operations Management , year =","work_id":"6ee68db7-b4eb-4b8f-be54-f9960e1b5a0d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Salvador Barberà and Dolors Berga and Bernardo Moreno , journal =","work_id":"c42d3709-872d-4dcf-8ec2-d1350809ee0d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Jackson , title =","work_id":"a11f0370-ca4c-49cb-8958-92b74d300b93","year":1995}],"snapshot_sha256":"18ea6faa95997a5bf472373184f867989c455a06d882f57dff34a0d55d3c4e31"},"source":{"id":"2605.14485","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:38:37.345766Z","id":"7b57077a-412d-46d0-bdf7-a1bf3bf33d4f","model_set":{"reader":"grok-4.3"},"one_line_summary":"A family of liability rules sets payments proportional to total realized losses with network-structure weights that implement efficient path selection in sequential shock games, coinciding with the Shapley value of a path-counting cooperative game and computable in polynomial time.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Proportional liability rules with network-only weights induce agents to select paths minimizing total cascade losses.","strongest_claim":"Our main axiomatic result characterizes a family of rules, which set each agent's liability to be proportional to the system's total realized losses with agent weights depending only on the network structure.","weakest_assumption":"The sequential-move game induced by the liability rule leads agents to select efficient paths; this relies on the assumption that the cascade mechanism and loss structure are exactly as modeled and that agents act to minimize their own expected liability under the proportional rule."}},"verdict_id":"7b57077a-412d-46d0-bdf7-a1bf3bf33d4f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:12947bc93cd7f971fba4f369e1ede41a0e7862c7da4694ae890511d9e4b40a3e","target":"record","created_at":"2026-05-17T23:39:06Z","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":"9454751615741bca1b91bd39c18c85b155e0f145fa3f2c61a7fd160a8a83976c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.TH","submitted_at":"2026-05-14T07:25:52Z","title_canon_sha256":"631ee5f63a49af39655ae58509f3c3e93e1181475ca94e91413b4718f827cc2c"},"schema_version":"1.0","source":{"id":"2605.14485","kind":"arxiv","version":1}},"canonical_sha256":"987bbb586861ee3716c007fb07edfaab5653147975de40c8050fb7b63f0bac07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"987bbb586861ee3716c007fb07edfaab5653147975de40c8050fb7b63f0bac07","first_computed_at":"2026-05-17T23:39:06.502718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.502718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0/diw+VIO+YhJYuDSGz/h0WooQDfnCmdmXa7IQRewNygo2yKj6TMCqKVkY3S4GbxT23NQNFimRP45NQc9hdhCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.503500Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12947bc93cd7f971fba4f369e1ede41a0e7862c7da4694ae890511d9e4b40a3e","sha256:8810c83510a823c381b71e742ad3e0ab19f48dc59a706cb48d12897ba416ea2e"],"state_sha256":"1d5f8ebc05ccc9e72ceb19a39b2ea82d633c6545389b2ecdafe623b19581f3c5"}