{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K7SDCZEJSFX7GX5DZSHXKBP23M","short_pith_number":"pith:K7SDCZEJ","schema_version":"1.0","canonical_sha256":"57e4316489916ff35fa3cc8f7505fadb11938da7a8627fcc2f78c7d1e4ae5914","source":{"kind":"arxiv","id":"1806.06223","version":2},"attestation_state":"computed","paper":{"title":"Advice Complexity of Priority Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allan Borodin, Denis Pankratov, Joan Boyar, Kim S. Larsen","submitted_at":"2018-06-16T11:16:07Z","abstract_excerpt":"The priority model of \"greedy-like\" algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002. We augment this model by allowing priority algorithms to have access to advice, i.e., side information precomputed by an all-powerful oracle. Obtaining lower bounds in the priority model without advice can be challenging and may involve intricate adversary arguments. Since the priority model with advice is even more powerful, obtaining lower bounds presents additional difficulties. We sidestep these difficulties by developing a general framework of reductions which makes lower bound proofs r"},"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":"1806.06223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-16T11:16:07Z","cross_cats_sorted":[],"title_canon_sha256":"dc559f74fd24ac7298aaa5ae3edd702cea9581ef32b961438f7d1fe1932691c0","abstract_canon_sha256":"4860f66a483e622eb9d1fa66c65a2aef53fd437558be07d9116de49ce92c2fbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:35.504805Z","signature_b64":"xjOZEZX1HI7j+Z1zfaV4/bqVYX49G59PtlvdAfpKidC0KG9GEeFonXqR4NIZnQj86eYPiPiYLJECSxZrivijCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57e4316489916ff35fa3cc8f7505fadb11938da7a8627fcc2f78c7d1e4ae5914","last_reissued_at":"2026-05-18T00:09:35.504298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:35.504298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advice Complexity of Priority Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allan Borodin, Denis Pankratov, Joan Boyar, Kim S. Larsen","submitted_at":"2018-06-16T11:16:07Z","abstract_excerpt":"The priority model of \"greedy-like\" algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002. We augment this model by allowing priority algorithms to have access to advice, i.e., side information precomputed by an all-powerful oracle. Obtaining lower bounds in the priority model without advice can be challenging and may involve intricate adversary arguments. Since the priority model with advice is even more powerful, obtaining lower bounds presents additional difficulties. We sidestep these difficulties by developing a general framework of reductions which makes lower bound proofs r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06223","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":""},"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":"1806.06223","created_at":"2026-05-18T00:09:35.504386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06223v2","created_at":"2026-05-18T00:09:35.504386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06223","created_at":"2026-05-18T00:09:35.504386+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7SDCZEJSFX7","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7SDCZEJSFX7GX5D","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7SDCZEJ","created_at":"2026-05-18T12:32:33.847187+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/K7SDCZEJSFX7GX5DZSHXKBP23M","json":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M.json","graph_json":"https://pith.science/api/pith-number/K7SDCZEJSFX7GX5DZSHXKBP23M/graph.json","events_json":"https://pith.science/api/pith-number/K7SDCZEJSFX7GX5DZSHXKBP23M/events.json","paper":"https://pith.science/paper/K7SDCZEJ"},"agent_actions":{"view_html":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M","download_json":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M.json","view_paper":"https://pith.science/paper/K7SDCZEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06223&json=true","fetch_graph":"https://pith.science/api/pith-number/K7SDCZEJSFX7GX5DZSHXKBP23M/graph.json","fetch_events":"https://pith.science/api/pith-number/K7SDCZEJSFX7GX5DZSHXKBP23M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M/action/storage_attestation","attest_author":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M/action/author_attestation","sign_citation":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M/action/citation_signature","submit_replication":"https://pith.science/pith/K7SDCZEJSFX7GX5DZSHXKBP23M/action/replication_record"}},"created_at":"2026-05-18T00:09:35.504386+00:00","updated_at":"2026-05-18T00:09:35.504386+00:00"}