{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PVLOV6NNDWXXCKPKZAMSKCUOXF","short_pith_number":"pith:PVLOV6NN","canonical_record":{"source":{"id":"1307.2569","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-09T19:57:59Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"d877f4859416f547ff2861b6144ba2f62ca1c33dd3f713687e875ea065ec7597","abstract_canon_sha256":"be248dfaf3f87e50382ec34e95b1c39c4167aab094c02b3f85978e1b0690fe5e"},"schema_version":"1.0"},"canonical_sha256":"7d56eaf9ad1daf7129eac819250a8eb951dd3e9ee47e58479adea0b8fbdd9475","source":{"kind":"arxiv","id":"1307.2569","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2569","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2569v5","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2569","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"PVLOV6NNDWXX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PVLOV6NNDWXXCKPK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PVLOV6NN","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PVLOV6NNDWXXCKPKZAMSKCUOXF","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2569","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-09T19:57:59Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"d877f4859416f547ff2861b6144ba2f62ca1c33dd3f713687e875ea065ec7597","abstract_canon_sha256":"be248dfaf3f87e50382ec34e95b1c39c4167aab094c02b3f85978e1b0690fe5e"},"schema_version":"1.0"},"canonical_sha256":"7d56eaf9ad1daf7129eac819250a8eb951dd3e9ee47e58479adea0b8fbdd9475","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:35.385940Z","signature_b64":"GL8wLE/XfYnaGHVsToIIJ/AVHj9doCCsOKW7O021pwK5Vvu5dKHIq8b/VIEsuEq1i6BzW+D1NVSl6vyRU1M7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d56eaf9ad1daf7129eac819250a8eb951dd3e9ee47e58479adea0b8fbdd9475","last_reissued_at":"2026-05-18T00:49:35.385361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:35.385361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2569","source_version":5,"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-18T00:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cqUHEysNyHnIThN/4wYCAB0pgNA7206t2dc1FLz97lxktpGuDHv2bti3C4wQ05lr9WhFpAXfqXwODkBhjOxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:09:23.056559Z"},"content_sha256":"e26413124e2393562449199782aeba7c236a8f1e048fd1949d5ba97731075796","schema_version":"1.0","event_id":"sha256:e26413124e2393562449199782aeba7c236a8f1e048fd1949d5ba97731075796"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PVLOV6NNDWXXCKPKZAMSKCUOXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mechanism design for resource allocation in networks with intergroup competition and intragroup sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.GT","authors_text":"Abhinav Sinha, Achilleas Anastasopoulos","submitted_at":"2013-07-09T19:57:59Z","abstract_excerpt":"We consider a network where strategic agents, who are contesting for allocation of resources, are divided into fixed groups. The network control protocol is such that within each group agents get to share the resource and across groups they contest for it. A prototypical example is the allocation of data rate on a network with multicast/multirate architecture. Compared to the unicast architecture (which is a special case), the multicast/multirate architecture can result in substantial bandwidth savings. However, design of a market mechanism in such a scenario requires dealing with both private"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2569","kind":"arxiv","version":5},"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-18T00:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYhTtzgH3kXnPlZFE9cbJhsX45HjHRNVhOrgPf+zJYDdSFvPzCfGyyktS0R3r5G5/Hqc68xWLYg/Lp2A7znAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:09:23.057384Z"},"content_sha256":"2a0f6bc2cf4fde2e4b425b14b9cd2cda4c92bcf518a462dd0c5f4420921b70d7","schema_version":"1.0","event_id":"sha256:2a0f6bc2cf4fde2e4b425b14b9cd2cda4c92bcf518a462dd0c5f4420921b70d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVLOV6NNDWXXCKPKZAMSKCUOXF/bundle.json","state_url":"https://pith.science/pith/PVLOV6NNDWXXCKPKZAMSKCUOXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVLOV6NNDWXXCKPKZAMSKCUOXF/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-06-11T22:09:23Z","links":{"resolver":"https://pith.science/pith/PVLOV6NNDWXXCKPKZAMSKCUOXF","bundle":"https://pith.science/pith/PVLOV6NNDWXXCKPKZAMSKCUOXF/bundle.json","state":"https://pith.science/pith/PVLOV6NNDWXXCKPKZAMSKCUOXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVLOV6NNDWXXCKPKZAMSKCUOXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PVLOV6NNDWXXCKPKZAMSKCUOXF","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":"be248dfaf3f87e50382ec34e95b1c39c4167aab094c02b3f85978e1b0690fe5e","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-09T19:57:59Z","title_canon_sha256":"d877f4859416f547ff2861b6144ba2f62ca1c33dd3f713687e875ea065ec7597"},"schema_version":"1.0","source":{"id":"1307.2569","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2569","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2569v5","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2569","created_at":"2026-05-18T00:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"PVLOV6NNDWXX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PVLOV6NNDWXXCKPK","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PVLOV6NN","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2a0f6bc2cf4fde2e4b425b14b9cd2cda4c92bcf518a462dd0c5f4420921b70d7","target":"graph","created_at":"2026-05-18T00:49:35Z","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 consider a network where strategic agents, who are contesting for allocation of resources, are divided into fixed groups. The network control protocol is such that within each group agents get to share the resource and across groups they contest for it. A prototypical example is the allocation of data rate on a network with multicast/multirate architecture. Compared to the unicast architecture (which is a special case), the multicast/multirate architecture can result in substantial bandwidth savings. However, design of a market mechanism in such a scenario requires dealing with both private","authors_text":"Abhinav Sinha, Achilleas Anastasopoulos","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-09T19:57:59Z","title":"Mechanism design for resource allocation in networks with intergroup competition and intragroup sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2569","kind":"arxiv","version":5},"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:e26413124e2393562449199782aeba7c236a8f1e048fd1949d5ba97731075796","target":"record","created_at":"2026-05-18T00:49:35Z","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":"be248dfaf3f87e50382ec34e95b1c39c4167aab094c02b3f85978e1b0690fe5e","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-09T19:57:59Z","title_canon_sha256":"d877f4859416f547ff2861b6144ba2f62ca1c33dd3f713687e875ea065ec7597"},"schema_version":"1.0","source":{"id":"1307.2569","kind":"arxiv","version":5}},"canonical_sha256":"7d56eaf9ad1daf7129eac819250a8eb951dd3e9ee47e58479adea0b8fbdd9475","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d56eaf9ad1daf7129eac819250a8eb951dd3e9ee47e58479adea0b8fbdd9475","first_computed_at":"2026-05-18T00:49:35.385361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:35.385361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GL8wLE/XfYnaGHVsToIIJ/AVHj9doCCsOKW7O021pwK5Vvu5dKHIq8b/VIEsuEq1i6BzW+D1NVSl6vyRU1M7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:35.385940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2569","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e26413124e2393562449199782aeba7c236a8f1e048fd1949d5ba97731075796","sha256:2a0f6bc2cf4fde2e4b425b14b9cd2cda4c92bcf518a462dd0c5f4420921b70d7"],"state_sha256":"b1542a3701874c1d9b3adb4072247213a49a5c4055101bd7becaef7c4667df24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3nbCC+1hFn2sQcteG7Au9XKCohZjQ+Q0ZACgokM7N4499HWDgmIncag8WAgyoiPawKXItNtGGHC65SNb8GjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:09:23.061420Z","bundle_sha256":"f4a1bd3b1427070f8308fb5b22fb61b6ce2dcf985457923924ec0b73500e41e1"}}