{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6FIATDP7AX3RD5NTLUACH5A3PL","short_pith_number":"pith:6FIATDP7","schema_version":"1.0","canonical_sha256":"f150098dff05f711f5b35d0023f41b7acf1282abfa3324889304be5eb4de6fee","source":{"kind":"arxiv","id":"2412.11447","version":3},"attestation_state":"computed","paper":{"title":"Decouple and Decompose: Scaling Resource Allocation with DeDe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Francis Y. Yan, Minlan Yu, Zhiying Xu","submitted_at":"2024-12-16T04:58:42Z","abstract_excerpt":"Efficient resource allocation is essential in cloud systems to facilitate resource sharing among tenants. However, the growing scale of these optimization problems have outpaced commercial solvers commonly employed in production. To accelerate resource allocation, prior approaches either customize solutions for narrow domains or impose workload-specific assumptions. In this work, we revisit real-world resource allocation problems and uncover a common underlying structure: the vast majority of these problems are inherently separable, i.e., they optimize the aggregate utility of individual resou"},"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":"2412.11447","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-12-16T04:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"fb5bde2b2b94aaf4abe5fc2b4d907ee7fe1957b35ffb8eb724871506882683b9","abstract_canon_sha256":"118798ae7ec0994f74ec59044c555cafab773e07aba84e3e7c2dad15a6cc3bb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:39.118528Z","signature_b64":"bqyk4IBB1xiRIjich0FcBIa0o5+tNe5CBQdm6BwLmNF/JczRgKMCHQj3XjBCXd/ViMdmXHxKIn+tj9AB8T0wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f150098dff05f711f5b35d0023f41b7acf1282abfa3324889304be5eb4de6fee","last_reissued_at":"2026-07-05T11:21:39.117985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:39.117985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decouple and Decompose: Scaling Resource Allocation with DeDe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Francis Y. Yan, Minlan Yu, Zhiying Xu","submitted_at":"2024-12-16T04:58:42Z","abstract_excerpt":"Efficient resource allocation is essential in cloud systems to facilitate resource sharing among tenants. However, the growing scale of these optimization problems have outpaced commercial solvers commonly employed in production. To accelerate resource allocation, prior approaches either customize solutions for narrow domains or impose workload-specific assumptions. In this work, we revisit real-world resource allocation problems and uncover a common underlying structure: the vast majority of these problems are inherently separable, i.e., they optimize the aggregate utility of individual resou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11447","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.11447/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.11447","created_at":"2026-07-05T11:21:39.118044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11447v3","created_at":"2026-07-05T11:21:39.118044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11447","created_at":"2026-07-05T11:21:39.118044+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FIATDP7AX3R","created_at":"2026-07-05T11:21:39.118044+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FIATDP7AX3RD5NT","created_at":"2026-07-05T11:21:39.118044+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FIATDP7","created_at":"2026-07-05T11:21:39.118044+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16187","citing_title":"Near-optimal Online Traffic Engineering","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL","json":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL.json","graph_json":"https://pith.science/api/pith-number/6FIATDP7AX3RD5NTLUACH5A3PL/graph.json","events_json":"https://pith.science/api/pith-number/6FIATDP7AX3RD5NTLUACH5A3PL/events.json","paper":"https://pith.science/paper/6FIATDP7"},"agent_actions":{"view_html":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL","download_json":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL.json","view_paper":"https://pith.science/paper/6FIATDP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11447&json=true","fetch_graph":"https://pith.science/api/pith-number/6FIATDP7AX3RD5NTLUACH5A3PL/graph.json","fetch_events":"https://pith.science/api/pith-number/6FIATDP7AX3RD5NTLUACH5A3PL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL/action/storage_attestation","attest_author":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL/action/author_attestation","sign_citation":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL/action/citation_signature","submit_replication":"https://pith.science/pith/6FIATDP7AX3RD5NTLUACH5A3PL/action/replication_record"}},"created_at":"2026-07-05T11:21:39.118044+00:00","updated_at":"2026-07-05T11:21:39.118044+00:00"}