{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7BQHUFRUNRXDZSAHTIMSVMOVAU","short_pith_number":"pith:7BQHUFRU","schema_version":"1.0","canonical_sha256":"f8607a16346c6e3cc8079a192ab1d5050a327ae0ae6a7d1b2665103038ad06f7","source":{"kind":"arxiv","id":"1205.1924","version":2},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Scheduling on Line and Tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Sambuddha Roy, Venkatesan T. Chakaravarthy, Yogish Sabharwal","submitted_at":"2012-05-09T09:42:40Z","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"},"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":"1205.1924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-09T09:42:40Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f7f911bef0d964da7cc0e593c09beab53776003751d4e00dbb2cf4b22f792bb3","abstract_canon_sha256":"f50e6396cef285d12977937ddca267fe2b9adbc0a51d85814dd4101c18769b6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:02.396408Z","signature_b64":"xPhD07xhTxGM6R75D6NiOYAw51DdxvFx1GKFN0EVRliU+kboIhCXbSrZMopRj2SFQDKWZh1UJ94l/nEKhCxCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8607a16346c6e3cc8079a192ab1d5050a327ae0ae6a7d1b2665103038ad06f7","last_reissued_at":"2026-05-18T03:44:02.395796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:02.395796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Scheduling on Line and Tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Sambuddha Roy, Venkatesan T. Chakaravarthy, Yogish Sabharwal","submitted_at":"2012-05-09T09:42:40Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1924","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":"1205.1924","created_at":"2026-05-18T03:44:02.395891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1924v2","created_at":"2026-05-18T03:44:02.395891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1924","created_at":"2026-05-18T03:44:02.395891+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BQHUFRUNRXD","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BQHUFRUNRXDZSAH","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BQHUFRU","created_at":"2026-05-18T12:26:56.085431+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/7BQHUFRUNRXDZSAHTIMSVMOVAU","json":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU.json","graph_json":"https://pith.science/api/pith-number/7BQHUFRUNRXDZSAHTIMSVMOVAU/graph.json","events_json":"https://pith.science/api/pith-number/7BQHUFRUNRXDZSAHTIMSVMOVAU/events.json","paper":"https://pith.science/paper/7BQHUFRU"},"agent_actions":{"view_html":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU","download_json":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU.json","view_paper":"https://pith.science/paper/7BQHUFRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1924&json=true","fetch_graph":"https://pith.science/api/pith-number/7BQHUFRUNRXDZSAHTIMSVMOVAU/graph.json","fetch_events":"https://pith.science/api/pith-number/7BQHUFRUNRXDZSAHTIMSVMOVAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU/action/storage_attestation","attest_author":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU/action/author_attestation","sign_citation":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU/action/citation_signature","submit_replication":"https://pith.science/pith/7BQHUFRUNRXDZSAHTIMSVMOVAU/action/replication_record"}},"created_at":"2026-05-18T03:44:02.395891+00:00","updated_at":"2026-05-18T03:44:02.395891+00:00"}