{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7C6I3AWS5Z3LFNVEVY6SX5JR5Y","short_pith_number":"pith:7C6I3AWS","canonical_record":{"source":{"id":"1103.3310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-16T22:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"4c8dc12c7e6bce121c0d628167e1d5bd26c2cf90c06e46d47e12c49dc2e13ccf","abstract_canon_sha256":"9ad0e626fe5729fa20cfe6c027cc5dbf87b7054f72e0985fe4f444f9f9424473"},"schema_version":"1.0"},"canonical_sha256":"f8bc8d82d2ee76b2b6a4ae3d2bf531ee1f65d6ca4b6f460c081c5b9a1c7b7d0d","source":{"kind":"arxiv","id":"1103.3310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3310","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3310v2","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3310","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"7C6I3AWS5Z3L","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7C6I3AWS5Z3LFNVE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7C6I3AWS","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7C6I3AWS5Z3LFNVEVY6SX5JR5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-16T22:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"4c8dc12c7e6bce121c0d628167e1d5bd26c2cf90c06e46d47e12c49dc2e13ccf","abstract_canon_sha256":"9ad0e626fe5729fa20cfe6c027cc5dbf87b7054f72e0985fe4f444f9f9424473"},"schema_version":"1.0"},"canonical_sha256":"f8bc8d82d2ee76b2b6a4ae3d2bf531ee1f65d6ca4b6f460c081c5b9a1c7b7d0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:22.760896Z","signature_b64":"P1oNOfDWqPcNxkP/6RCtJE8NBP1zfkc0Rexscbo8UcJP8Uti36/zsOLd60KdHKMy8ElPfe26O3yX18lgxYr4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8bc8d82d2ee76b2b6a4ae3d2bf531ee1f65d6ca4b6f460c081c5b9a1c7b7d0d","last_reissued_at":"2026-05-18T04:23:22.760238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:22.760238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3310","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-05-18T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOZ3BHd+6W/L/2Qg1MfJA4nKnjzEdHEe3/6kHsE83vUb4kIaS46bSc1n/0IMI4BFBT5T7CYo617iP4ojDtFRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:21:22.427581Z"},"content_sha256":"6c1cf4aeaba9e85b5c810b1f05f3d1254c548b8cee01cab3b3cba88e0995c2ab","schema_version":"1.0","event_id":"sha256:6c1cf4aeaba9e85b5c810b1f05f3d1254c548b8cee01cab3b3cba88e0995c2ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7C6I3AWS5Z3LFNVEVY6SX5JR5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path coalitional games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Troels Bjerre S{\\o}rensen","submitted_at":"2011-03-16T22:26:15Z","abstract_excerpt":"We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional games and their duals, thereby settling a number of open problems. The least core payoffs of path coalitional games are completely characterized and a polynomial-time algorithm for computing the nucleolus of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3310","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":""},"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-18T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgiR/wwgHt7efaYIYd13/aHRLJW9qv/eXK4Yu8y10DnNHfjGpXOASxhNWRUAtwFmuUjmyUQosZpujaCZUHu4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:21:22.428169Z"},"content_sha256":"956669cbc7af3efd7e281f057b6a56c42344e6b18c5d7b31a1b7a7d0ec5477a9","schema_version":"1.0","event_id":"sha256:956669cbc7af3efd7e281f057b6a56c42344e6b18c5d7b31a1b7a7d0ec5477a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/bundle.json","state_url":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/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-05-27T16:21:22Z","links":{"resolver":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y","bundle":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/bundle.json","state":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7C6I3AWS5Z3LFNVEVY6SX5JR5Y","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":"9ad0e626fe5729fa20cfe6c027cc5dbf87b7054f72e0985fe4f444f9f9424473","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-16T22:26:15Z","title_canon_sha256":"4c8dc12c7e6bce121c0d628167e1d5bd26c2cf90c06e46d47e12c49dc2e13ccf"},"schema_version":"1.0","source":{"id":"1103.3310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3310","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3310v2","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3310","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"7C6I3AWS5Z3L","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7C6I3AWS5Z3LFNVE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7C6I3AWS","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:956669cbc7af3efd7e281f057b6a56c42344e6b18c5d7b31a1b7a7d0ec5477a9","target":"graph","created_at":"2026-05-18T04:23:22Z","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":"We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional games and their duals, thereby settling a number of open problems. The least core payoffs of path coalitional games are completely characterized and a polynomial-time algorithm for computing the nucleolus of","authors_text":"Haris Aziz, Troels Bjerre S{\\o}rensen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-16T22:26:15Z","title":"Path coalitional games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3310","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:6c1cf4aeaba9e85b5c810b1f05f3d1254c548b8cee01cab3b3cba88e0995c2ab","target":"record","created_at":"2026-05-18T04:23:22Z","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":"9ad0e626fe5729fa20cfe6c027cc5dbf87b7054f72e0985fe4f444f9f9424473","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-16T22:26:15Z","title_canon_sha256":"4c8dc12c7e6bce121c0d628167e1d5bd26c2cf90c06e46d47e12c49dc2e13ccf"},"schema_version":"1.0","source":{"id":"1103.3310","kind":"arxiv","version":2}},"canonical_sha256":"f8bc8d82d2ee76b2b6a4ae3d2bf531ee1f65d6ca4b6f460c081c5b9a1c7b7d0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8bc8d82d2ee76b2b6a4ae3d2bf531ee1f65d6ca4b6f460c081c5b9a1c7b7d0d","first_computed_at":"2026-05-18T04:23:22.760238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:22.760238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P1oNOfDWqPcNxkP/6RCtJE8NBP1zfkc0Rexscbo8UcJP8Uti36/zsOLd60KdHKMy8ElPfe26O3yX18lgxYr4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:22.760896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c1cf4aeaba9e85b5c810b1f05f3d1254c548b8cee01cab3b3cba88e0995c2ab","sha256:956669cbc7af3efd7e281f057b6a56c42344e6b18c5d7b31a1b7a7d0ec5477a9"],"state_sha256":"3e319ac833237df9709e00f115fc599130fe2d32ab20aa5ef35cc8ea38e5defc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXjK98K5pf0EL8dCbYPc7ISLos28PIO/gnKRVd6ReNP4ZHFSMXdhas4/cp+IUVCqlKZwD6hjxdGo3LCrZUxHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:21:22.431729Z","bundle_sha256":"1833db42c6a1cff75718f50a8bb71b53924972a2cd62d32416b0da1f9c865b3a"}}