{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KIHR2A5Z5KWPVI3QVPGACM5JCJ","short_pith_number":"pith:KIHR2A5Z","canonical_record":{"source":{"id":"1104.4423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-22T12:00:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"50b8831cf4fcb8dc240b684f23ed50c0bb685449e740ab2351d0793885ab197e","abstract_canon_sha256":"22fbd2badf15013bff4e3a4890f786ef8c3aa96d95318116796419441549700a"},"schema_version":"1.0"},"canonical_sha256":"520f1d03b9eaacfaa370abcc0133a9125604b31236900fa131b05eb570bd0e55","source":{"kind":"arxiv","id":"1104.4423","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4423","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4423v2","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4423","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"KIHR2A5Z5KWP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIHR2A5Z5KWPVI3Q","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIHR2A5Z","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KIHR2A5Z5KWPVI3QVPGACM5JCJ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-22T12:00:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"50b8831cf4fcb8dc240b684f23ed50c0bb685449e740ab2351d0793885ab197e","abstract_canon_sha256":"22fbd2badf15013bff4e3a4890f786ef8c3aa96d95318116796419441549700a"},"schema_version":"1.0"},"canonical_sha256":"520f1d03b9eaacfaa370abcc0133a9125604b31236900fa131b05eb570bd0e55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:34.389790Z","signature_b64":"/I7FtnmyHwsb7ieegmg6Uu/q+XMizorpv4uuaXNXXfxiTpLGUBllYB/L9RBhgz37cBfMr9VqlOHb7ckGMxjaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"520f1d03b9eaacfaa370abcc0133a9125604b31236900fa131b05eb570bd0e55","last_reissued_at":"2026-05-18T04:18:34.389281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:34.389281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4423","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:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcAw2s1e3h9hW4A5X2vzQsBs148gWK3HemNrAzgVpnoN+/S2HONuzQOjRRIzsEsEUlU1+MUCpsl2nZGUqi5ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:59:32.068597Z"},"content_sha256":"080c2c68069810d003f747c48e564bc7fdb2a390420c6153c5855b966fed19b5","schema_version":"1.0","event_id":"sha256:080c2c68069810d003f747c48e564bc7fdb2a390420c6153c5855b966fed19b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KIHR2A5Z5KWPVI3QVPGACM5JCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enforcing efficient equilibria in network design games via subsidies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Angelo Fanelli, Christos Kalaitzis, Ioannis Caragiannis, John Augustine","submitted_at":"2011-04-22T12:00:10Z","abstract_excerpt":"The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.\n  In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4423","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:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BtxJ13Gf4A2mYCdKR3l0VAIXt/W8PllYiqcJUTUqE/YhGTNEzrig/2BcmOS8xu4TfU54XYUdG98Nc1tzJz8kCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:59:32.068954Z"},"content_sha256":"ae937b5d64efbff33453fd9c621b52da3cce35e0d956084c404146da82320bf8","schema_version":"1.0","event_id":"sha256:ae937b5d64efbff33453fd9c621b52da3cce35e0d956084c404146da82320bf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/bundle.json","state_url":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/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-22T14:59:32Z","links":{"resolver":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ","bundle":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/bundle.json","state":"https://pith.science/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIHR2A5Z5KWPVI3QVPGACM5JCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KIHR2A5Z5KWPVI3QVPGACM5JCJ","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":"22fbd2badf15013bff4e3a4890f786ef8c3aa96d95318116796419441549700a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-22T12:00:10Z","title_canon_sha256":"50b8831cf4fcb8dc240b684f23ed50c0bb685449e740ab2351d0793885ab197e"},"schema_version":"1.0","source":{"id":"1104.4423","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4423","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4423v2","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4423","created_at":"2026-05-18T04:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"KIHR2A5Z5KWP","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KIHR2A5Z5KWPVI3Q","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KIHR2A5Z","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:ae937b5d64efbff33453fd9c621b52da3cce35e0d956084c404146da82320bf8","target":"graph","created_at":"2026-05-18T04:18:34Z","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":"The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.\n  In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to sha","authors_text":"Angelo Fanelli, Christos Kalaitzis, Ioannis Caragiannis, John Augustine","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-22T12:00:10Z","title":"Enforcing efficient equilibria in network design games via subsidies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4423","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:080c2c68069810d003f747c48e564bc7fdb2a390420c6153c5855b966fed19b5","target":"record","created_at":"2026-05-18T04:18:34Z","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":"22fbd2badf15013bff4e3a4890f786ef8c3aa96d95318116796419441549700a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-22T12:00:10Z","title_canon_sha256":"50b8831cf4fcb8dc240b684f23ed50c0bb685449e740ab2351d0793885ab197e"},"schema_version":"1.0","source":{"id":"1104.4423","kind":"arxiv","version":2}},"canonical_sha256":"520f1d03b9eaacfaa370abcc0133a9125604b31236900fa131b05eb570bd0e55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"520f1d03b9eaacfaa370abcc0133a9125604b31236900fa131b05eb570bd0e55","first_computed_at":"2026-05-18T04:18:34.389281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:34.389281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/I7FtnmyHwsb7ieegmg6Uu/q+XMizorpv4uuaXNXXfxiTpLGUBllYB/L9RBhgz37cBfMr9VqlOHb7ckGMxjaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:34.389790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4423","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:080c2c68069810d003f747c48e564bc7fdb2a390420c6153c5855b966fed19b5","sha256:ae937b5d64efbff33453fd9c621b52da3cce35e0d956084c404146da82320bf8"],"state_sha256":"346a029d0727c2ca7f8d157270ef113fb6fb08ecf4d3b719b4e069b05dcdec81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPCr0Vz/EW67fLffnwWwVS8Y8k/cNcMB++gaID+GhsPHsWi8v8Uu8I3BXwXGOBHTs5ZvLCbv4doyf2c926WBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T14:59:32.071519Z","bundle_sha256":"6702a3bcbda733fad01b2b357418bafdc3a93af0d92ae4b959c934cdb1906888"}}