{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HXKCUPF254RS7TLMYIN2LYWDYR","short_pith_number":"pith:HXKCUPF2","schema_version":"1.0","canonical_sha256":"3dd42a3cbaef232fcd6cc21ba5e2c3c4525c2b4b6ef8c512c41c9525f6c1d8ee","source":{"kind":"arxiv","id":"2301.04205","version":2},"attestation_state":"computed","paper":{"title":"A Performance Verification Methodology for Resource Allocation Heuristics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aditya Akella, Ahmed Saeed, Benjamin Mikek, Jehad Aly, Saksham Goel, Venkat Arun","submitted_at":"2023-01-10T20:46:20Z","abstract_excerpt":"Performance verification is a nascent but promising tool for understanding the performance and limitations of heuristics under realistic assumptions. Bespoke performance verification tools have already demonstrated their value in settings like congestion control and packet scheduling. In this paper, we aim to emphasize the broad applicability and utility of performance verification. To that end, we highlight the design principles of performance verification. Then, we leverage that understanding to develop a set of easy-to-follow guidelines that are applicable to a wide range of resource alloca"},"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":"2301.04205","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-01-10T20:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"87e2954a4a409e4008b39f9de275c6e37750b6599d2b049cd9c7df358f4956f6","abstract_canon_sha256":"3c025449d4b54a5d561ce439bbf99a937522b26eced2b87def33b15fee2ffe5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:49:59.809329Z","signature_b64":"fFiVuiSauTVAZ7q1mnb1WK/NWAub7QS1jWpuB5VIool+LyfdyQV65RS39igqw7jksFbcW004hCEtsPnkrfeCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd42a3cbaef232fcd6cc21ba5e2c3c4525c2b4b6ef8c512c41c9525f6c1d8ee","last_reissued_at":"2026-07-05T07:49:59.808894Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:49:59.808894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Performance Verification Methodology for Resource Allocation Heuristics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aditya Akella, Ahmed Saeed, Benjamin Mikek, Jehad Aly, Saksham Goel, Venkat Arun","submitted_at":"2023-01-10T20:46:20Z","abstract_excerpt":"Performance verification is a nascent but promising tool for understanding the performance and limitations of heuristics under realistic assumptions. Bespoke performance verification tools have already demonstrated their value in settings like congestion control and packet scheduling. In this paper, we aim to emphasize the broad applicability and utility of performance verification. To that end, we highlight the design principles of performance verification. Then, we leverage that understanding to develop a set of easy-to-follow guidelines that are applicable to a wide range of resource alloca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04205","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.04205/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":"2301.04205","created_at":"2026-07-05T07:49:59.808950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.04205v2","created_at":"2026-07-05T07:49:59.808950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04205","created_at":"2026-07-05T07:49:59.808950+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXKCUPF254RS","created_at":"2026-07-05T07:49:59.808950+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXKCUPF254RS7TLM","created_at":"2026-07-05T07:49:59.808950+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXKCUPF2","created_at":"2026-07-05T07:49:59.808950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.07750","citing_title":"A Performance Analyzer for a Public Cloud's ML-Augmented VM Allocator","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR","json":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR.json","graph_json":"https://pith.science/api/pith-number/HXKCUPF254RS7TLMYIN2LYWDYR/graph.json","events_json":"https://pith.science/api/pith-number/HXKCUPF254RS7TLMYIN2LYWDYR/events.json","paper":"https://pith.science/paper/HXKCUPF2"},"agent_actions":{"view_html":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR","download_json":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR.json","view_paper":"https://pith.science/paper/HXKCUPF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.04205&json=true","fetch_graph":"https://pith.science/api/pith-number/HXKCUPF254RS7TLMYIN2LYWDYR/graph.json","fetch_events":"https://pith.science/api/pith-number/HXKCUPF254RS7TLMYIN2LYWDYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR/action/storage_attestation","attest_author":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR/action/author_attestation","sign_citation":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR/action/citation_signature","submit_replication":"https://pith.science/pith/HXKCUPF254RS7TLMYIN2LYWDYR/action/replication_record"}},"created_at":"2026-07-05T07:49:59.808950+00:00","updated_at":"2026-07-05T07:49:59.808950+00:00"}