{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:COLAIVMC7AWPQDPDEDUVCCJ7BT","short_pith_number":"pith:COLAIVMC","schema_version":"1.0","canonical_sha256":"1396045582f82cf80de320e951093f0cfe4197802261f499ddba4b28bc594995","source":{"kind":"arxiv","id":"2306.05977","version":1},"attestation_state":"computed","paper":{"title":"Towards Universally Optimal Shortest Paths Algorithms in the Hybrid Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Philipp Schneider","submitted_at":"2023-06-09T15:40:59Z","abstract_excerpt":"A drawback of the classic approach for complexity analysis of distributed graph problems is that it mostly informs about the complexity of notorious classes of ``worst case'' graphs. Algorithms that are used to prove a tight (existential) bound are essentially optimized to perform well on such worst case graphs. However, such graphs are often either unlikely or actively avoided in practice, where benign graph instances usually admit much faster solutions.\n  To circumnavigate these drawbacks, the concept of universal complexity analysis in the distributed setting was suggested by [Kutten and Pe"},"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":"2306.05977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-06-09T15:40:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ad69660f2c25519c4b2931402f04c43636fd473060fb5f032d99995e7d0abac3","abstract_canon_sha256":"164ce4dd6354cf187a9d103d5600fe9279b0cd0fcd98a958068b003fb36ee855"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:12.519348Z","signature_b64":"DoDMs9Z+m+mnHO947xeUDjVUuQKuZ1KPTMWQgZLCezrVj2LXnIWQcEuec6YjuQklNukX49GEnyZWJ5iBW6+yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1396045582f82cf80de320e951093f0cfe4197802261f499ddba4b28bc594995","last_reissued_at":"2026-07-05T06:19:12.519005Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:12.519005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Universally Optimal Shortest Paths Algorithms in the Hybrid Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Philipp Schneider","submitted_at":"2023-06-09T15:40:59Z","abstract_excerpt":"A drawback of the classic approach for complexity analysis of distributed graph problems is that it mostly informs about the complexity of notorious classes of ``worst case'' graphs. Algorithms that are used to prove a tight (existential) bound are essentially optimized to perform well on such worst case graphs. However, such graphs are often either unlikely or actively avoided in practice, where benign graph instances usually admit much faster solutions.\n  To circumnavigate these drawbacks, the concept of universal complexity analysis in the distributed setting was suggested by [Kutten and Pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05977","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/2306.05977/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":"2306.05977","created_at":"2026-07-05T06:19:12.519060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.05977v1","created_at":"2026-07-05T06:19:12.519060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05977","created_at":"2026-07-05T06:19:12.519060+00:00"},{"alias_kind":"pith_short_12","alias_value":"COLAIVMC7AWP","created_at":"2026-07-05T06:19:12.519060+00:00"},{"alias_kind":"pith_short_16","alias_value":"COLAIVMC7AWPQDPD","created_at":"2026-07-05T06:19:12.519060+00:00"},{"alias_kind":"pith_short_8","alias_value":"COLAIVMC","created_at":"2026-07-05T06:19:12.519060+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/COLAIVMC7AWPQDPDEDUVCCJ7BT","json":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT.json","graph_json":"https://pith.science/api/pith-number/COLAIVMC7AWPQDPDEDUVCCJ7BT/graph.json","events_json":"https://pith.science/api/pith-number/COLAIVMC7AWPQDPDEDUVCCJ7BT/events.json","paper":"https://pith.science/paper/COLAIVMC"},"agent_actions":{"view_html":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT","download_json":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT.json","view_paper":"https://pith.science/paper/COLAIVMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.05977&json=true","fetch_graph":"https://pith.science/api/pith-number/COLAIVMC7AWPQDPDEDUVCCJ7BT/graph.json","fetch_events":"https://pith.science/api/pith-number/COLAIVMC7AWPQDPDEDUVCCJ7BT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT/action/storage_attestation","attest_author":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT/action/author_attestation","sign_citation":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT/action/citation_signature","submit_replication":"https://pith.science/pith/COLAIVMC7AWPQDPDEDUVCCJ7BT/action/replication_record"}},"created_at":"2026-07-05T06:19:12.519060+00:00","updated_at":"2026-07-05T06:19:12.519060+00:00"}