{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7BQHUFRUNRXDZSAHTIMSVMOVAU","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":"f50e6396cef285d12977937ddca267fe2b9adbc0a51d85814dd4101c18769b6e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-09T09:42:40Z","title_canon_sha256":"f7f911bef0d964da7cc0e593c09beab53776003751d4e00dbb2cf4b22f792bb3"},"schema_version":"1.0","source":{"id":"1205.1924","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1924","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1924v2","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1924","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"7BQHUFRUNRXD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7BQHUFRUNRXDZSAH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7BQHUFRU","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:5b9058d99c51d6144fcdf5ac878df0168aa4b9c0ab8b8fd7c0377ede9afbb1bc","target":"graph","created_at":"2026-05-18T03:44:02Z","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 have a set of processors (or agents) and a set of graph networks defined over some vertex set. Each processor can access a subset of the graph networks. Each processor has a demand specified as a pair of vertices $<u, v>$, along with a profit; the processor wishes to send data between $u$ and $v$. Towards that goal, the processor needs to select a graph network accessible to it and a path connecting $u$ and $v$ within the selected network. The processor requires exclusive access to the chosen path, in order to route the data. Thus, the processors are competing for routes/channels. A feasibl","authors_text":"Sambuddha Roy, Venkatesan T. Chakaravarthy, Yogish Sabharwal","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-09T09:42:40Z","title":"Distributed Algorithms for Scheduling on Line and Tree Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1924","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:1bd7996737b08642b49d083e51742831fc38971d6685128d34c6b5fb7d2829dc","target":"record","created_at":"2026-05-18T03:44:02Z","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":"f50e6396cef285d12977937ddca267fe2b9adbc0a51d85814dd4101c18769b6e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-09T09:42:40Z","title_canon_sha256":"f7f911bef0d964da7cc0e593c09beab53776003751d4e00dbb2cf4b22f792bb3"},"schema_version":"1.0","source":{"id":"1205.1924","kind":"arxiv","version":2}},"canonical_sha256":"f8607a16346c6e3cc8079a192ab1d5050a327ae0ae6a7d1b2665103038ad06f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8607a16346c6e3cc8079a192ab1d5050a327ae0ae6a7d1b2665103038ad06f7","first_computed_at":"2026-05-18T03:44:02.395796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:02.395796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xPhD07xhTxGM6R75D6NiOYAw51DdxvFx1GKFN0EVRliU+kboIhCXbSrZMopRj2SFQDKWZh1UJ94l/nEKhCxCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:02.396408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1924","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bd7996737b08642b49d083e51742831fc38971d6685128d34c6b5fb7d2829dc","sha256:5b9058d99c51d6144fcdf5ac878df0168aa4b9c0ab8b8fd7c0377ede9afbb1bc"],"state_sha256":"ca2885852ef5adeb41f6843fd805e1545c732bcb3436443fadc4e41f8f46f6be"}