{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:BYU3TJWTKVJQWFMKIAPSE3YTNQ","short_pith_number":"pith:BYU3TJWT","canonical_record":{"source":{"id":"2105.12706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-26T17:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"a763357ea3507e4f72a50ca632ae1346a2367adf5f6a6872fb6db0a6dca186ec","abstract_canon_sha256":"fc28c6bf5d37b727186fd2417fdfc7334f4de4a5379f3e335991219ed40513fc"},"schema_version":"1.0"},"canonical_sha256":"0e29b9a6d355530b158a401f226f136c2649a18316005acd4d02e0477491a976","source":{"kind":"arxiv","id":"2105.12706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12706","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12706v1","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12706","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"BYU3TJWTKVJQ","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_16","alias_value":"BYU3TJWTKVJQWFMK","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_8","alias_value":"BYU3TJWT","created_at":"2026-07-05T02:43:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:BYU3TJWTKVJQWFMKIAPSE3YTNQ","target":"record","payload":{"canonical_record":{"source":{"id":"2105.12706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-26T17:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"a763357ea3507e4f72a50ca632ae1346a2367adf5f6a6872fb6db0a6dca186ec","abstract_canon_sha256":"fc28c6bf5d37b727186fd2417fdfc7334f4de4a5379f3e335991219ed40513fc"},"schema_version":"1.0"},"canonical_sha256":"0e29b9a6d355530b158a401f226f136c2649a18316005acd4d02e0477491a976","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:41.653378Z","signature_b64":"YmHH3Zq10ch0CsSTZtyMoIc0501wk+Ty/UnrubQz3dYVGGbDwh1StsnKZ/32NUGSWs0eX2Q9AK2FAtFIXNqFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e29b9a6d355530b158a401f226f136c2649a18316005acd4d02e0477491a976","last_reissued_at":"2026-07-05T02:43:41.652927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:41.652927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.12706","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mfMSsbD/TsROqU8OL00fk6mSfGosIPj6hQ+c90E7QtkFxng7MqRlIxq7D4ExR5GaSLYfiu4yha0CDCGLHaHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:09:58.884577Z"},"content_sha256":"af7571d7cfd0ae4b5b1b27208602087709d634a07b1e72c23bd283657824e009","schema_version":"1.0","event_id":"sha256:af7571d7cfd0ae4b5b1b27208602087709d634a07b1e72c23bd283657824e009"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:BYU3TJWTKVJQWFMKIAPSE3YTNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contention Resolution with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Weaver, Calvin Newport, Nitin Vaidya, Seth Gilbert","submitted_at":"2021-05-26T17:39:11Z","abstract_excerpt":"In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that predicts the likelihood of each size occurring. The goal is to leverage the predictive power of this distribution to improve on worst-case time complexity bounds. Using a novel connection between contention resolution and information theory, we prove lower bounds on the expected time complexity with respect to the Shannon entropy of the correspondin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12706","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/2105.12706/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:43:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcEo5CUWRn/idTD1EG5htFVKsFctuKop3rw1yraHUbm+UpFGJqQTUo9FnqT22kc5sprEf/0xGeOdegfFHo0fAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:09:58.885102Z"},"content_sha256":"8f541fb2715d0c14cdda9f6ec80ce1493b958b6fd5ac6621e2e3b480cd703fd1","schema_version":"1.0","event_id":"sha256:8f541fb2715d0c14cdda9f6ec80ce1493b958b6fd5ac6621e2e3b480cd703fd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYU3TJWTKVJQWFMKIAPSE3YTNQ/bundle.json","state_url":"https://pith.science/pith/BYU3TJWTKVJQWFMKIAPSE3YTNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYU3TJWTKVJQWFMKIAPSE3YTNQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T22:09:58Z","links":{"resolver":"https://pith.science/pith/BYU3TJWTKVJQWFMKIAPSE3YTNQ","bundle":"https://pith.science/pith/BYU3TJWTKVJQWFMKIAPSE3YTNQ/bundle.json","state":"https://pith.science/pith/BYU3TJWTKVJQWFMKIAPSE3YTNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYU3TJWTKVJQWFMKIAPSE3YTNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:BYU3TJWTKVJQWFMKIAPSE3YTNQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fc28c6bf5d37b727186fd2417fdfc7334f4de4a5379f3e335991219ed40513fc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-26T17:39:11Z","title_canon_sha256":"a763357ea3507e4f72a50ca632ae1346a2367adf5f6a6872fb6db0a6dca186ec"},"schema_version":"1.0","source":{"id":"2105.12706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12706","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12706v1","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12706","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"BYU3TJWTKVJQ","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_16","alias_value":"BYU3TJWTKVJQWFMK","created_at":"2026-07-05T02:43:41Z"},{"alias_kind":"pith_short_8","alias_value":"BYU3TJWT","created_at":"2026-07-05T02:43:41Z"}],"graph_snapshots":[{"event_id":"sha256:8f541fb2715d0c14cdda9f6ec80ce1493b958b6fd5ac6621e2e3b480cd703fd1","target":"graph","created_at":"2026-07-05T02:43:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.12706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that predicts the likelihood of each size occurring. The goal is to leverage the predictive power of this distribution to improve on worst-case time complexity bounds. Using a novel connection between contention resolution and information theory, we prove lower bounds on the expected time complexity with respect to the Shannon entropy of the correspondin","authors_text":"Alex Weaver, Calvin Newport, Nitin Vaidya, Seth Gilbert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-26T17:39:11Z","title":"Contention Resolution with Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12706","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:af7571d7cfd0ae4b5b1b27208602087709d634a07b1e72c23bd283657824e009","target":"record","created_at":"2026-07-05T02:43:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fc28c6bf5d37b727186fd2417fdfc7334f4de4a5379f3e335991219ed40513fc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2021-05-26T17:39:11Z","title_canon_sha256":"a763357ea3507e4f72a50ca632ae1346a2367adf5f6a6872fb6db0a6dca186ec"},"schema_version":"1.0","source":{"id":"2105.12706","kind":"arxiv","version":1}},"canonical_sha256":"0e29b9a6d355530b158a401f226f136c2649a18316005acd4d02e0477491a976","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e29b9a6d355530b158a401f226f136c2649a18316005acd4d02e0477491a976","first_computed_at":"2026-07-05T02:43:41.652927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:41.652927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmHH3Zq10ch0CsSTZtyMoIc0501wk+Ty/UnrubQz3dYVGGbDwh1StsnKZ/32NUGSWs0eX2Q9AK2FAtFIXNqFAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:41.653378Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af7571d7cfd0ae4b5b1b27208602087709d634a07b1e72c23bd283657824e009","sha256:8f541fb2715d0c14cdda9f6ec80ce1493b958b6fd5ac6621e2e3b480cd703fd1"],"state_sha256":"893a8003f05fe3943a708a6de34597403c4eda3830293149a50778bef101670a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXunyKdYE3keVqRCGqQuKa0rskBOhzOweYU7cR3xUyKTAVYzT3+T6kpTCZ6Mko90qeyqU5/Ji9v4ennkR7KZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:09:58.889318Z","bundle_sha256":"048129aa76a2059fa3453c9feca6de07d0e14c58ede333d81af110a24d733812"}}