{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7C6I3AWS5Z3LFNVEVY6SX5JR5Y","short_pith_number":"pith:7C6I3AWS","schema_version":"1.0","canonical_sha256":"f8bc8d82d2ee76b2b6a4ae3d2bf531ee1f65d6ca4b6f460c081c5b9a1c7b7d0d","source":{"kind":"arxiv","id":"1103.3310","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.3310","created_at":"2026-05-18T04:23:22.760344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3310v2","created_at":"2026-05-18T04:23:22.760344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3310","created_at":"2026-05-18T04:23:22.760344+00:00"},{"alias_kind":"pith_short_12","alias_value":"7C6I3AWS5Z3L","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7C6I3AWS5Z3LFNVE","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7C6I3AWS","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y","json":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y.json","graph_json":"https://pith.science/api/pith-number/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/graph.json","events_json":"https://pith.science/api/pith-number/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/events.json","paper":"https://pith.science/paper/7C6I3AWS"},"agent_actions":{"view_html":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y","download_json":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y.json","view_paper":"https://pith.science/paper/7C6I3AWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3310&json=true","fetch_graph":"https://pith.science/api/pith-number/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/action/storage_attestation","attest_author":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/action/author_attestation","sign_citation":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/action/citation_signature","submit_replication":"https://pith.science/pith/7C6I3AWS5Z3LFNVEVY6SX5JR5Y/action/replication_record"}},"created_at":"2026-05-18T04:23:22.760344+00:00","updated_at":"2026-05-18T04:23:22.760344+00:00"}