{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MCTZKFPRMMFNS43TJNMWARGF55","short_pith_number":"pith:MCTZKFPR","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"},"canonical_sha256":"60a79515f1630ad973734b596044c5ef6e66c24ebdae0be4a46daa51c632c765","source":{"kind":"arxiv","id":"1707.01702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01702","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01702v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01702","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"MCTZKFPRMMFN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MCTZKFPRMMFNS43T","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MCTZKFPR","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MCTZKFPRMMFNS43TJNMWARGF55","target":"record","payload":{"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"},"canonical_sha256":"60a79515f1630ad973734b596044c5ef6e66c24ebdae0be4a46daa51c632c765","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"},"source_kind":"arxiv","source_id":"1707.01702","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-05-18T00:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBqYczTNnvRXXWngYZ7ftGE5C3Qvvik257mzNFoFdpiDagB59nsMfvJV/7SoYx4Rwv6sksY3cw8720gMcOyLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:50:13.399587Z"},"content_sha256":"8acdd197721f769104a1a61af371345e5f366db08c7a924d6a2c3201fbbf81b4","schema_version":"1.0","event_id":"sha256:8acdd197721f769104a1a61af371345e5f366db08c7a924d6a2c3201fbbf81b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MCTZKFPRMMFNS43TJNMWARGF55","target":"graph","payload":{"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"},"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-05-18T00:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0m+b7O88iPitNy0Qdt+Q2FfQLM+sX7XUIbpzryzfAyvdQ+t3zGkLFdNGOvQrSXaaqzU0FN6G5s1pYYGQT9xTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:50:13.400250Z"},"content_sha256":"aa534f4118f326060a8d975cf7eaba8103393611cfb160b58a147e9d3f5d9999","schema_version":"1.0","event_id":"sha256:aa534f4118f326060a8d975cf7eaba8103393611cfb160b58a147e9d3f5d9999"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/bundle.json","state_url":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCTZKFPRMMFNS43TJNMWARGF55/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-05-24T23:50:13Z","links":{"resolver":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55","bundle":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/bundle.json","state":"https://pith.science/pith/MCTZKFPRMMFNS43TJNMWARGF55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCTZKFPRMMFNS43TJNMWARGF55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MCTZKFPRMMFNS43TJNMWARGF55","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":"36f7fd51c42d606faf0d666830c313cf1b9fb1fecb06909e30e4016fdcbf8af3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T09:30:22Z","title_canon_sha256":"d09b6cbfeda4c2818d4e7eb3604a5b9ce0a9b433396b4234843b9c7c05065b8d"},"schema_version":"1.0","source":{"id":"1707.01702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01702","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01702v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01702","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"MCTZKFPRMMFN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MCTZKFPRMMFNS43T","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MCTZKFPR","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:aa534f4118f326060a8d975cf7eaba8103393611cfb160b58a147e9d3f5d9999","target":"graph","created_at":"2026-05-18T00:40:47Z","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"},"paper":{"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","authors_text":"Fabrizio Grandoni, Marek Adamczyk, MIchal Wlodarczyk, Stefano Leonardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T09:30:22Z","title":"When the Optimum is also Blind: a New Perspective on Universal Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01702","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:8acdd197721f769104a1a61af371345e5f366db08c7a924d6a2c3201fbbf81b4","target":"record","created_at":"2026-05-18T00:40:47Z","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":"36f7fd51c42d606faf0d666830c313cf1b9fb1fecb06909e30e4016fdcbf8af3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T09:30:22Z","title_canon_sha256":"d09b6cbfeda4c2818d4e7eb3604a5b9ce0a9b433396b4234843b9c7c05065b8d"},"schema_version":"1.0","source":{"id":"1707.01702","kind":"arxiv","version":1}},"canonical_sha256":"60a79515f1630ad973734b596044c5ef6e66c24ebdae0be4a46daa51c632c765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60a79515f1630ad973734b596044c5ef6e66c24ebdae0be4a46daa51c632c765","first_computed_at":"2026-05-18T00:40:47.765847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:47.765847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5GUqu1dNGh+UgLDaLIZy1tFoZLChJY38ALaPEMZFPGTQ+cCCzoTNdZzZeNKr0qtv0vgbcjyLakHXbXWKjBP5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:47.766742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8acdd197721f769104a1a61af371345e5f366db08c7a924d6a2c3201fbbf81b4","sha256:aa534f4118f326060a8d975cf7eaba8103393611cfb160b58a147e9d3f5d9999"],"state_sha256":"45a72bf7c6393deba0bdac57020988eb0c7ab95483192bc9fc33185d62c1963c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NxSaA2jRxNYvIm4MIipojR3PVid+F/s3Nk/mQb0qJVhvilBb+Tdp+aMQ+goIXBBVytKNlqYMAcNh7C4r/THOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:50:13.403749Z","bundle_sha256":"6b71827d598c773d91e8fc9f5e20c48f25b60359a35d666d6c284bef32f076a6"}}