{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YVEIYXTM3SHBGZ6JRNDC6OK77C","short_pith_number":"pith:YVEIYXTM","schema_version":"1.0","canonical_sha256":"c5488c5e6cdc8e1367c98b462f395ff899965cce7d590f5dabec3623dfeda6c8","source":{"kind":"arxiv","id":"2005.14150","version":1},"attestation_state":"computed","paper":{"title":"Network Partitioning and Avoidable Contention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Oded Schwartz (Hebrew University of Jerusalem), Yishai Oltchik (ETH Zurich)","submitted_at":"2020-05-28T17:10:32Z","abstract_excerpt":"Network contention frequently dominates the run time of parallel algorithms and limits scaling performance. Most previous studies mitigate or eliminate contention by utilizing one of several approaches: communication-minimizing algorithms; hotspot-avoiding routing schemes; topology-aware task mapping; or improving global network properties, such as bisection bandwidth, edge-expansion, partitioning, and network diameter. In practice, parallel jobs often use only a fraction of a host system. How do processor allocation policies affect contention within a partition? We utilize edge-isoperimetric "},"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":"2005.14150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-05-28T17:10:32Z","cross_cats_sorted":[],"title_canon_sha256":"60716435462b151ea57e85d079dce3db217bc11e8fd9a6ac0558d11997242fab","abstract_canon_sha256":"441371f2de34751b9531c53d7c9fe80a73de4c781633f21608c31c987fef8338"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:28.531551Z","signature_b64":"NUADQNYNS5esTe2U1/GiPY9FGpAlDU5DgQ3r9DPhVEBQuXTLqhcjmPgBWPcKggLPbwFmhl48HnKflkQxSlnzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5488c5e6cdc8e1367c98b462f395ff899965cce7d590f5dabec3623dfeda6c8","last_reissued_at":"2026-07-05T01:06:28.531161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:28.531161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Partitioning and Avoidable Contention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Oded Schwartz (Hebrew University of Jerusalem), Yishai Oltchik (ETH Zurich)","submitted_at":"2020-05-28T17:10:32Z","abstract_excerpt":"Network contention frequently dominates the run time of parallel algorithms and limits scaling performance. Most previous studies mitigate or eliminate contention by utilizing one of several approaches: communication-minimizing algorithms; hotspot-avoiding routing schemes; topology-aware task mapping; or improving global network properties, such as bisection bandwidth, edge-expansion, partitioning, and network diameter. In practice, parallel jobs often use only a fraction of a host system. How do processor allocation policies affect contention within a partition? We utilize edge-isoperimetric "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.14150","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.14150/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":"2005.14150","created_at":"2026-07-05T01:06:28.531221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.14150v1","created_at":"2026-07-05T01:06:28.531221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14150","created_at":"2026-07-05T01:06:28.531221+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVEIYXTM3SHB","created_at":"2026-07-05T01:06:28.531221+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVEIYXTM3SHBGZ6J","created_at":"2026-07-05T01:06:28.531221+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVEIYXTM","created_at":"2026-07-05T01:06:28.531221+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06675","citing_title":"Accurate analysis of the pitch pulse-based magnitude/phase structure of natural vowels and assessment of three lightweight time/frequency voicing restoration methods","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C","json":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C.json","graph_json":"https://pith.science/api/pith-number/YVEIYXTM3SHBGZ6JRNDC6OK77C/graph.json","events_json":"https://pith.science/api/pith-number/YVEIYXTM3SHBGZ6JRNDC6OK77C/events.json","paper":"https://pith.science/paper/YVEIYXTM"},"agent_actions":{"view_html":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C","download_json":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C.json","view_paper":"https://pith.science/paper/YVEIYXTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.14150&json=true","fetch_graph":"https://pith.science/api/pith-number/YVEIYXTM3SHBGZ6JRNDC6OK77C/graph.json","fetch_events":"https://pith.science/api/pith-number/YVEIYXTM3SHBGZ6JRNDC6OK77C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C/action/storage_attestation","attest_author":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C/action/author_attestation","sign_citation":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C/action/citation_signature","submit_replication":"https://pith.science/pith/YVEIYXTM3SHBGZ6JRNDC6OK77C/action/replication_record"}},"created_at":"2026-07-05T01:06:28.531221+00:00","updated_at":"2026-07-05T01:06:28.531221+00:00"}