{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T6WBRGTYTQXG7MYRKWZROTI5DE","short_pith_number":"pith:T6WBRGTY","schema_version":"1.0","canonical_sha256":"9fac189a789c2e6fb31155b3174d1d1923ee18f08b59e6c92a48260f5f1d7d67","source":{"kind":"arxiv","id":"1601.04314","version":1},"attestation_state":"computed","paper":{"title":"How Good is Bargained Routing?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Ariel Orda, Gideon Blocq","submitted_at":"2016-01-17T17:15:03Z","abstract_excerpt":"In the context of networking, research has focused on non-cooperative games, where the selfish agents cannot reach a binding agreement on the way they would share the infrastructure. Many approaches have been proposed for mitigating the typically inefficient operating points. However, in a growing number of networking scenarios selfish agents are able to communicate and reach an agreement. Hence, the degradation of performance should be considered at an operating point of a cooperative game. Accordingly, our goal is to lay foundations for the application of cooperative game theory to fundament"},"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":"1601.04314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-17T17:15:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f2a7f9b815c1f4fdff7a3886b6bd58972f720339687f0eb723adf18442df8d5e","abstract_canon_sha256":"2c8528b858976e71c8c69f9966b3d95124f6bcbf7192cff23254c5a29a5c958a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.363147Z","signature_b64":"1vsV6GfSW4PRO50We7OWKNSF3uX9GJDe/a723l13KWMNchjggaHc+62ah+wKUcvX4+riPQ9rWaH176tzZuXSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fac189a789c2e6fb31155b3174d1d1923ee18f08b59e6c92a48260f5f1d7d67","last_reissued_at":"2026-05-18T01:22:45.362595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.362595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Good is Bargained Routing?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Ariel Orda, Gideon Blocq","submitted_at":"2016-01-17T17:15:03Z","abstract_excerpt":"In the context of networking, research has focused on non-cooperative games, where the selfish agents cannot reach a binding agreement on the way they would share the infrastructure. Many approaches have been proposed for mitigating the typically inefficient operating points. However, in a growing number of networking scenarios selfish agents are able to communicate and reach an agreement. Hence, the degradation of performance should be considered at an operating point of a cooperative game. Accordingly, our goal is to lay foundations for the application of cooperative game theory to fundament"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04314","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04314","created_at":"2026-05-18T01:22:45.362673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04314v1","created_at":"2026-05-18T01:22:45.362673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04314","created_at":"2026-05-18T01:22:45.362673+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6WBRGTYTQXG","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6WBRGTYTQXG7MYR","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6WBRGTY","created_at":"2026-05-18T12:30:44.179134+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/T6WBRGTYTQXG7MYRKWZROTI5DE","json":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE.json","graph_json":"https://pith.science/api/pith-number/T6WBRGTYTQXG7MYRKWZROTI5DE/graph.json","events_json":"https://pith.science/api/pith-number/T6WBRGTYTQXG7MYRKWZROTI5DE/events.json","paper":"https://pith.science/paper/T6WBRGTY"},"agent_actions":{"view_html":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE","download_json":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE.json","view_paper":"https://pith.science/paper/T6WBRGTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04314&json=true","fetch_graph":"https://pith.science/api/pith-number/T6WBRGTYTQXG7MYRKWZROTI5DE/graph.json","fetch_events":"https://pith.science/api/pith-number/T6WBRGTYTQXG7MYRKWZROTI5DE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE/action/storage_attestation","attest_author":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE/action/author_attestation","sign_citation":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE/action/citation_signature","submit_replication":"https://pith.science/pith/T6WBRGTYTQXG7MYRKWZROTI5DE/action/replication_record"}},"created_at":"2026-05-18T01:22:45.362673+00:00","updated_at":"2026-05-18T01:22:45.362673+00:00"}