{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:325VQKU47MI7JCP7UMP32GRBVA","short_pith_number":"pith:325VQKU4","schema_version":"1.0","canonical_sha256":"debb582a9cfb11f489ffa31fbd1a21a8043f8e025775037a9bc27827214b7ecd","source":{"kind":"arxiv","id":"1709.05709","version":1},"attestation_state":"computed","paper":{"title":"Lexico-minimum Replica Placement in Multitrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"K. Alex Mills, Neeraj Mittal, R. Chandrasekaran","submitted_at":"2017-09-17T19:41:58Z","abstract_excerpt":"In this work, we consider the problem of placing replicas in a data center or storage area network, represented as a digraph, so as to lexico-minimize a previously proposed reliability measure which minimizes the impact of all failure events in the model in decreasing order of severity. Prior work focuses on the special case in which the digraph is an arborescence. In this work, we consider the broader class of multitrees: digraphs in which the subgraph induced by vertices reachable from a fixed node forms a tree. We parameterize multitrees by their number of \"roots\" (nodes with in-degree zero"},"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":"1709.05709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-17T19:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"7af6fb99693e0351dd9e36e6804e4b040adf996fb1462b7b4da6f119145a4876","abstract_canon_sha256":"1041649284cf047af87107b613a6a539b7586e7c22d541e9ea0695b5a3e59473"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:59.717226Z","signature_b64":"F+b0yPkH6zJE/KJO+4bzq3eaYihcdRcBODTyhE+rfogycErKLbAXF/dhYHCeWHXFb/15oyprHkDNN7VcALgkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"debb582a9cfb11f489ffa31fbd1a21a8043f8e025775037a9bc27827214b7ecd","last_reissued_at":"2026-05-18T00:34:59.716273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:59.716273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexico-minimum Replica Placement in Multitrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"K. Alex Mills, Neeraj Mittal, R. Chandrasekaran","submitted_at":"2017-09-17T19:41:58Z","abstract_excerpt":"In this work, we consider the problem of placing replicas in a data center or storage area network, represented as a digraph, so as to lexico-minimize a previously proposed reliability measure which minimizes the impact of all failure events in the model in decreasing order of severity. Prior work focuses on the special case in which the digraph is an arborescence. In this work, we consider the broader class of multitrees: digraphs in which the subgraph induced by vertices reachable from a fixed node forms a tree. We parameterize multitrees by their number of \"roots\" (nodes with in-degree zero"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05709","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":"1709.05709","created_at":"2026-05-18T00:34:59.716459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05709v1","created_at":"2026-05-18T00:34:59.716459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05709","created_at":"2026-05-18T00:34:59.716459+00:00"},{"alias_kind":"pith_short_12","alias_value":"325VQKU47MI7","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"325VQKU47MI7JCP7","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"325VQKU4","created_at":"2026-05-18T12:30:55.937587+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/325VQKU47MI7JCP7UMP32GRBVA","json":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA.json","graph_json":"https://pith.science/api/pith-number/325VQKU47MI7JCP7UMP32GRBVA/graph.json","events_json":"https://pith.science/api/pith-number/325VQKU47MI7JCP7UMP32GRBVA/events.json","paper":"https://pith.science/paper/325VQKU4"},"agent_actions":{"view_html":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA","download_json":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA.json","view_paper":"https://pith.science/paper/325VQKU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05709&json=true","fetch_graph":"https://pith.science/api/pith-number/325VQKU47MI7JCP7UMP32GRBVA/graph.json","fetch_events":"https://pith.science/api/pith-number/325VQKU47MI7JCP7UMP32GRBVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA/action/storage_attestation","attest_author":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA/action/author_attestation","sign_citation":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA/action/citation_signature","submit_replication":"https://pith.science/pith/325VQKU47MI7JCP7UMP32GRBVA/action/replication_record"}},"created_at":"2026-05-18T00:34:59.716459+00:00","updated_at":"2026-05-18T00:34:59.716459+00:00"}