{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MCTZKFPRMMFNS43TJNMWARGF55","short_pith_number":"pith:MCTZKFPR","schema_version":"1.0","canonical_sha256":"60a79515f1630ad973734b596044c5ef6e66c24ebdae0be4a46daa51c632c765","source":{"kind":"arxiv","id":"1707.01702","version":1},"attestation_state":"computed","paper":{"title":"When the Optimum is also Blind: a New Perspective on Universal Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fabrizio Grandoni, Marek Adamczyk, MIchal Wlodarczyk, Stefano Leonardi","submitted_at":"2017-07-06T09:30:22Z","abstract_excerpt":"Consider the following variant of the set cover problem. We are given a universe $U=\\{1,...,n\\}$ and a collection of subsets $\\mathcal{C} = \\{S_1,...,S_m\\}$ where $S_i \\subseteq U$. For every element $u \\in U$ we need to find a set $\\phi(u) \\in \\mathcal C$ such that $u\\in \\phi(u)$. Once we construct and fix the mapping $\\phi:U \\rightarrow \\mathcal{C}$ a subset $X \\subseteq U$ of the universe is revealed, and we need to cover all elements from $X$ with exactly $\\phi(X):=\\cup_{u\\in X} \\phi(u)$. The goal is to find a mapping such that the cover $\\phi(X)$ is as cheap as possible.\n  This is an exam"},"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":"1707.01702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T09:30:22Z","cross_cats_sorted":[],"title_canon_sha256":"d09b6cbfeda4c2818d4e7eb3604a5b9ce0a9b433396b4234843b9c7c05065b8d","abstract_canon_sha256":"36f7fd51c42d606faf0d666830c313cf1b9fb1fecb06909e30e4016fdcbf8af3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:47.766742Z","signature_b64":"5GUqu1dNGh+UgLDaLIZy1tFoZLChJY38ALaPEMZFPGTQ+cCCzoTNdZzZeNKr0qtv0vgbcjyLakHXbXWKjBP5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60a79515f1630ad973734b596044c5ef6e66c24ebdae0be4a46daa51c632c765","last_reissued_at":"2026-05-18T00:40:47.765847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:47.765847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When the Optimum is also Blind: a New Perspective on Universal Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fabrizio Grandoni, Marek Adamczyk, MIchal Wlodarczyk, Stefano Leonardi","submitted_at":"2017-07-06T09:30:22Z","abstract_excerpt":"Consider the following variant of the set cover problem. We are given a universe $U=\\{1,...,n\\}$ and a collection of subsets $\\mathcal{C} = \\{S_1,...,S_m\\}$ where $S_i \\subseteq U$. For every element $u \\in U$ we need to find a set $\\phi(u) \\in \\mathcal C$ such that $u\\in \\phi(u)$. Once we construct and fix the mapping $\\phi:U \\rightarrow \\mathcal{C}$ a subset $X \\subseteq U$ of the universe is revealed, and we need to cover all elements from $X$ with exactly $\\phi(X):=\\cup_{u\\in X} \\phi(u)$. The goal is to find a mapping such that the cover $\\phi(X)$ is as cheap as possible.\n  This is an exam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01702","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":""},"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":"1707.01702","created_at":"2026-05-18T00:40:47.766013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01702v1","created_at":"2026-05-18T00:40:47.766013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01702","created_at":"2026-05-18T00:40:47.766013+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCTZKFPRMMFN","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCTZKFPRMMFNS43T","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCTZKFPR","created_at":"2026-05-18T12:31:31.346846+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/MCTZKFPRMMFNS43TJNMWARGF55","json":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55.json","graph_json":"https://pith.science/api/pith-number/MCTZKFPRMMFNS43TJNMWARGF55/graph.json","events_json":"https://pith.science/api/pith-number/MCTZKFPRMMFNS43TJNMWARGF55/events.json","paper":"https://pith.science/paper/MCTZKFPR"},"agent_actions":{"view_html":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55","download_json":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55.json","view_paper":"https://pith.science/paper/MCTZKFPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01702&json=true","fetch_graph":"https://pith.science/api/pith-number/MCTZKFPRMMFNS43TJNMWARGF55/graph.json","fetch_events":"https://pith.science/api/pith-number/MCTZKFPRMMFNS43TJNMWARGF55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/action/storage_attestation","attest_author":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/action/author_attestation","sign_citation":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/action/citation_signature","submit_replication":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/action/replication_record"}},"created_at":"2026-05-18T00:40:47.766013+00:00","updated_at":"2026-05-18T00:40:47.766013+00:00"}