{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JXY7API7BAODH6PDAE74SN74CY","short_pith_number":"pith:JXY7API7","canonical_record":{"source":{"id":"1902.08299","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T23:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"aab2cb9f907f9211012713e3cbd34b007f74fe545ec2ac16d26b58294fcbed54","abstract_canon_sha256":"d3bab6ea736639c7f81ce764748e2f5cc996e7aa931bbe4787c27b3cf88363f0"},"schema_version":"1.0"},"canonical_sha256":"4df1f03d1f081c33f9e3013fc937fc1610a2ac4e226a9de6cd8a12a800ea3a7c","source":{"kind":"arxiv","id":"1902.08299","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08299","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08299v3","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08299","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"JXY7API7BAOD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JXY7API7BAODH6PD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JXY7API7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JXY7API7BAODH6PDAE74SN74CY","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08299","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T23:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"aab2cb9f907f9211012713e3cbd34b007f74fe545ec2ac16d26b58294fcbed54","abstract_canon_sha256":"d3bab6ea736639c7f81ce764748e2f5cc996e7aa931bbe4787c27b3cf88363f0"},"schema_version":"1.0"},"canonical_sha256":"4df1f03d1f081c33f9e3013fc937fc1610a2ac4e226a9de6cd8a12a800ea3a7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:13.801054Z","signature_b64":"Fh+v3QODnCYvPqQoDJhegrc0wrwJQU5jH37zEheX9pQw3CvOvjbuYddAJYssY8/gDGkIak2bPqecS0+z6p3CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df1f03d1f081c33f9e3013fc937fc1610a2ac4e226a9de6cd8a12a800ea3a7c","last_reissued_at":"2026-05-17T23:51:13.800493Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:13.800493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08299","source_version":3,"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-17T23:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7dIRnqOeXC7R6YSVNO6d29O3pIOgBCX80xCKtOeh8TlYSaZ9XEUiMTlct/d0+0YsofXd5I2+ePx8amE/zWfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:42:36.447634Z"},"content_sha256":"4c75da78cafe010fea31373943a1c7b42303b671c6e14104586087c4bc54c40c","schema_version":"1.0","event_id":"sha256:4c75da78cafe010fea31373943a1c7b42303b671c6e14104586087c4bc54c40c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JXY7API7BAODH6PDAE74SN74CY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Self-Reducibility: Selectivity, Information, and Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lane A. Hemaspaandra","submitted_at":"2019-02-21T23:04:54Z","abstract_excerpt":"This chapter provides a hands-on tutorial on the important technique known as self-reducibility. Through a series of \"Challenge Problems\" that are theorems that the reader will---after being given definitions and tools---try to prove, the tutorial will ask the reader not to read proofs that use self-reducibility, but rather to discover proofs that use self-reducibility. In particular, the chapter will seek to guide the reader to the discovery of proofs of four interesting theorems---whose focus areas range from selectivity to information to approximation---from the literature, whose proofs dra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08299","kind":"arxiv","version":3},"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-17T23:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWtUrCUuYf6C7b5cUyMIqc0nAzQUP1aW+fZCtae1O/tou5fK+XSKn2pCe0JqWgqKe+0b1e0CLEo8uK8djrN9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:42:36.448263Z"},"content_sha256":"8a1e6e3cb1c871b92835512786cab562cb30f9baec84f2a8764387e69226a5f6","schema_version":"1.0","event_id":"sha256:8a1e6e3cb1c871b92835512786cab562cb30f9baec84f2a8764387e69226a5f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXY7API7BAODH6PDAE74SN74CY/bundle.json","state_url":"https://pith.science/pith/JXY7API7BAODH6PDAE74SN74CY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXY7API7BAODH6PDAE74SN74CY/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-27T04:42:36Z","links":{"resolver":"https://pith.science/pith/JXY7API7BAODH6PDAE74SN74CY","bundle":"https://pith.science/pith/JXY7API7BAODH6PDAE74SN74CY/bundle.json","state":"https://pith.science/pith/JXY7API7BAODH6PDAE74SN74CY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXY7API7BAODH6PDAE74SN74CY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JXY7API7BAODH6PDAE74SN74CY","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":"d3bab6ea736639c7f81ce764748e2f5cc996e7aa931bbe4787c27b3cf88363f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T23:04:54Z","title_canon_sha256":"aab2cb9f907f9211012713e3cbd34b007f74fe545ec2ac16d26b58294fcbed54"},"schema_version":"1.0","source":{"id":"1902.08299","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08299","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08299v3","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08299","created_at":"2026-05-17T23:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"JXY7API7BAOD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JXY7API7BAODH6PD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JXY7API7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:8a1e6e3cb1c871b92835512786cab562cb30f9baec84f2a8764387e69226a5f6","target":"graph","created_at":"2026-05-17T23:51:13Z","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":"This chapter provides a hands-on tutorial on the important technique known as self-reducibility. Through a series of \"Challenge Problems\" that are theorems that the reader will---after being given definitions and tools---try to prove, the tutorial will ask the reader not to read proofs that use self-reducibility, but rather to discover proofs that use self-reducibility. In particular, the chapter will seek to guide the reader to the discovery of proofs of four interesting theorems---whose focus areas range from selectivity to information to approximation---from the literature, whose proofs dra","authors_text":"Lane A. Hemaspaandra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T23:04:54Z","title":"The Power of Self-Reducibility: Selectivity, Information, and Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08299","kind":"arxiv","version":3},"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:4c75da78cafe010fea31373943a1c7b42303b671c6e14104586087c4bc54c40c","target":"record","created_at":"2026-05-17T23:51:13Z","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":"d3bab6ea736639c7f81ce764748e2f5cc996e7aa931bbe4787c27b3cf88363f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-21T23:04:54Z","title_canon_sha256":"aab2cb9f907f9211012713e3cbd34b007f74fe545ec2ac16d26b58294fcbed54"},"schema_version":"1.0","source":{"id":"1902.08299","kind":"arxiv","version":3}},"canonical_sha256":"4df1f03d1f081c33f9e3013fc937fc1610a2ac4e226a9de6cd8a12a800ea3a7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4df1f03d1f081c33f9e3013fc937fc1610a2ac4e226a9de6cd8a12a800ea3a7c","first_computed_at":"2026-05-17T23:51:13.800493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:13.800493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fh+v3QODnCYvPqQoDJhegrc0wrwJQU5jH37zEheX9pQw3CvOvjbuYddAJYssY8/gDGkIak2bPqecS0+z6p3CAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:13.801054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08299","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c75da78cafe010fea31373943a1c7b42303b671c6e14104586087c4bc54c40c","sha256:8a1e6e3cb1c871b92835512786cab562cb30f9baec84f2a8764387e69226a5f6"],"state_sha256":"f1e7cfd827d86864bdc0fa599bdcafe6b9136531d2456abff214f86ef12b0900"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vesS9bBHyvkp8YwdxTYrlOvwOzo4pXKnsJB5odMvMrGfJgIp0AVJQPNYzUxPoZMicD2GAhcsrIZL9+64+IClBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:42:36.451844Z","bundle_sha256":"84c3ea9a14f8a5e0a35305324abeafd7560883f8f6aa4b8e1bc9e78530c3dcfa"}}