{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:AVRW4AVOM6FINH5M5OJ4QYOZSB","short_pith_number":"pith:AVRW4AVO","schema_version":"1.0","canonical_sha256":"05636e02ae678a869faceb93c861d9907d5c6d190872bc1fb92e78888bfbdcd9","source":{"kind":"arxiv","id":"cs/0611034","version":1},"attestation_state":"computed","paper":{"title":"Strategies for Replica Placement in Tree Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne Benoit (INRIA Rh\\^one-Alpes, LIP), Veronika Rehn (INRIA Rh\\^one-Alpes, Yves Robert (INRIA Rh\\^one-Alpes","submitted_at":"2006-11-08T08:16:55Z","abstract_excerpt":"In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by the closest server in the tree. We introduce and study two new policies. In the first policy, all requests from a given client are still processed by the same server, but this server can be located anywhere in the path from the client to the root. In the "},"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":"cs/0611034","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DC","submitted_at":"2006-11-08T08:16:55Z","cross_cats_sorted":[],"title_canon_sha256":"ece52d98436613cc4d2c60ec5313544c811c82bfe3c3f8bec9e0976bf6697234","abstract_canon_sha256":"75cd4bce215064ab0169e3a22d7df8620d002a705e4739c5e2b06ffd436ad6cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.266617Z","signature_b64":"orn1U7u5QC2qHCzsFl6nVHfTGZtFHUqPP5xOIJIKG7X3IDfTaQg6SXrCiq7B5HL3TTbIlPZ8Yc1GdbC35ct6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05636e02ae678a869faceb93c861d9907d5c6d190872bc1fb92e78888bfbdcd9","last_reissued_at":"2026-05-18T01:08:54.265993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.265993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategies for Replica Placement in Tree Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne Benoit (INRIA Rh\\^one-Alpes, LIP), Veronika Rehn (INRIA Rh\\^one-Alpes, Yves Robert (INRIA Rh\\^one-Alpes","submitted_at":"2006-11-08T08:16:55Z","abstract_excerpt":"In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by the closest server in the tree. We introduce and study two new policies. In the first policy, all requests from a given client are still processed by the same server, but this server can be located anywhere in the path from the client to the root. In the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611034","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":"cs/0611034","created_at":"2026-05-18T01:08:54.266092+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0611034v1","created_at":"2026-05-18T01:08:54.266092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611034","created_at":"2026-05-18T01:08:54.266092+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVRW4AVOM6FI","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVRW4AVOM6FINH5M","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVRW4AVO","created_at":"2026-05-18T12:25:53.939244+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/AVRW4AVOM6FINH5M5OJ4QYOZSB","json":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB.json","graph_json":"https://pith.science/api/pith-number/AVRW4AVOM6FINH5M5OJ4QYOZSB/graph.json","events_json":"https://pith.science/api/pith-number/AVRW4AVOM6FINH5M5OJ4QYOZSB/events.json","paper":"https://pith.science/paper/AVRW4AVO"},"agent_actions":{"view_html":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB","download_json":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB.json","view_paper":"https://pith.science/paper/AVRW4AVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0611034&json=true","fetch_graph":"https://pith.science/api/pith-number/AVRW4AVOM6FINH5M5OJ4QYOZSB/graph.json","fetch_events":"https://pith.science/api/pith-number/AVRW4AVOM6FINH5M5OJ4QYOZSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB/action/storage_attestation","attest_author":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB/action/author_attestation","sign_citation":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB/action/citation_signature","submit_replication":"https://pith.science/pith/AVRW4AVOM6FINH5M5OJ4QYOZSB/action/replication_record"}},"created_at":"2026-05-18T01:08:54.266092+00:00","updated_at":"2026-05-18T01:08:54.266092+00:00"}