{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:S7QR23W4F3GC2YMQU3U4LJ3LHI","short_pith_number":"pith:S7QR23W4","canonical_record":{"source":{"id":"2607.03947","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-04T16:43:46Z","cross_cats_sorted":[],"title_canon_sha256":"36b29df802dcf2e6f09cac9bf34804fe9d71b7533b5ece040b1b80e68fa10b05","abstract_canon_sha256":"7ac4231fae06518e5f88e596bcd6e65aa34e867ba1e4a8c14ed24c29dad3dc75"},"schema_version":"1.0"},"canonical_sha256":"97e11d6edc2ecc2d6190a6e9c5a76b3a0ef253fbcf3aa6323c21fbdefe55b69e","source":{"kind":"arxiv","id":"2607.03947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03947","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03947v1","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03947","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"pith_short_12","alias_value":"S7QR23W4F3GC","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"pith_short_16","alias_value":"S7QR23W4F3GC2YMQ","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"pith_short_8","alias_value":"S7QR23W4","created_at":"2026-07-07T02:18:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:S7QR23W4F3GC2YMQU3U4LJ3LHI","target":"record","payload":{"canonical_record":{"source":{"id":"2607.03947","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-04T16:43:46Z","cross_cats_sorted":[],"title_canon_sha256":"36b29df802dcf2e6f09cac9bf34804fe9d71b7533b5ece040b1b80e68fa10b05","abstract_canon_sha256":"7ac4231fae06518e5f88e596bcd6e65aa34e867ba1e4a8c14ed24c29dad3dc75"},"schema_version":"1.0"},"canonical_sha256":"97e11d6edc2ecc2d6190a6e9c5a76b3a0ef253fbcf3aa6323c21fbdefe55b69e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:49.091468Z","signature_b64":"PrmMv86Z3Cph1An8tBNpvKmfyuRkvWp3inxVHffutkdvjYOAI75Eyit2yzkWNGQl4ooZRLDVGCm3eYToHdtBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e11d6edc2ecc2d6190a6e9c5a76b3a0ef253fbcf3aa6323c21fbdefe55b69e","last_reissued_at":"2026-07-07T02:18:49.090450Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:49.090450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.03947","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-07T02:18:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aR0jS670ugmjCj45RLfqQ1o6gkn0dr/ilrKImdk4hut/ajHylhYwxW6a7xLf1Nh88sKPWorSjSgVYvNFuvwMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:27:23.941761Z"},"content_sha256":"b8068547bc77c4bf0521ac3be476b27bca4e7231e411c4ad613d32c93ac0b7da","schema_version":"1.0","event_id":"sha256:b8068547bc77c4bf0521ac3be476b27bca4e7231e411c4ad613d32c93ac0b7da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:S7QR23W4F3GC2YMQU3U4LJ3LHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Caching via Subset Entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Joseph (Seffi) Naor, Ravi Kumar, Roie Levin","submitted_at":"2026-07-04T16:43:46Z","abstract_excerpt":"A classic approach to beyond worst-case algorithm design is to impose stochastic assumptions on the input. However, a limiting feature of stochastic analyses is that, by the min-max principle, performance on worst-case distributions mirrors that of randomized algorithms on worst-case inputs. In other words, the same shortcoming of worst-case analysis -- its inability to distinguish \"easy\" and \"hard\" instances -- reappears as an inability to distinguish \"easy\" and \"hard\" distributions. This raises a natural question: Can we characterize \"easy\" input distributions with useful beyond worst-case b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03947","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/2607.03947/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-07T02:18:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvNLnwVZmP2VhNmdrQMpoYZpONbJ4hlNGeLe3FkyLZo8WkPKjcyNX9z68IczGF/yOf4ltdhoOrn+lJ4U77pbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:27:23.943097Z"},"content_sha256":"ee6346dbba2510708f8b06dfc9a5e1a96a1a3c77fe98d5936195535e38cb4923","schema_version":"1.0","event_id":"sha256:ee6346dbba2510708f8b06dfc9a5e1a96a1a3c77fe98d5936195535e38cb4923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7QR23W4F3GC2YMQU3U4LJ3LHI/bundle.json","state_url":"https://pith.science/pith/S7QR23W4F3GC2YMQU3U4LJ3LHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7QR23W4F3GC2YMQU3U4LJ3LHI/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-10T16:27:23Z","links":{"resolver":"https://pith.science/pith/S7QR23W4F3GC2YMQU3U4LJ3LHI","bundle":"https://pith.science/pith/S7QR23W4F3GC2YMQU3U4LJ3LHI/bundle.json","state":"https://pith.science/pith/S7QR23W4F3GC2YMQU3U4LJ3LHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7QR23W4F3GC2YMQU3U4LJ3LHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S7QR23W4F3GC2YMQU3U4LJ3LHI","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":"7ac4231fae06518e5f88e596bcd6e65aa34e867ba1e4a8c14ed24c29dad3dc75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-04T16:43:46Z","title_canon_sha256":"36b29df802dcf2e6f09cac9bf34804fe9d71b7533b5ece040b1b80e68fa10b05"},"schema_version":"1.0","source":{"id":"2607.03947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03947","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03947v1","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03947","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"pith_short_12","alias_value":"S7QR23W4F3GC","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"pith_short_16","alias_value":"S7QR23W4F3GC2YMQ","created_at":"2026-07-07T02:18:49Z"},{"alias_kind":"pith_short_8","alias_value":"S7QR23W4","created_at":"2026-07-07T02:18:49Z"}],"graph_snapshots":[{"event_id":"sha256:ee6346dbba2510708f8b06dfc9a5e1a96a1a3c77fe98d5936195535e38cb4923","target":"graph","created_at":"2026-07-07T02:18:49Z","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/2607.03947/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A classic approach to beyond worst-case algorithm design is to impose stochastic assumptions on the input. However, a limiting feature of stochastic analyses is that, by the min-max principle, performance on worst-case distributions mirrors that of randomized algorithms on worst-case inputs. In other words, the same shortcoming of worst-case analysis -- its inability to distinguish \"easy\" and \"hard\" instances -- reappears as an inability to distinguish \"easy\" and \"hard\" distributions. This raises a natural question: Can we characterize \"easy\" input distributions with useful beyond worst-case b","authors_text":"Debmalya Panigrahi, Joseph (Seffi) Naor, Ravi Kumar, Roie Levin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-04T16:43:46Z","title":"Stochastic Caching via Subset Entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03947","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:b8068547bc77c4bf0521ac3be476b27bca4e7231e411c4ad613d32c93ac0b7da","target":"record","created_at":"2026-07-07T02:18:49Z","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":"7ac4231fae06518e5f88e596bcd6e65aa34e867ba1e4a8c14ed24c29dad3dc75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-04T16:43:46Z","title_canon_sha256":"36b29df802dcf2e6f09cac9bf34804fe9d71b7533b5ece040b1b80e68fa10b05"},"schema_version":"1.0","source":{"id":"2607.03947","kind":"arxiv","version":1}},"canonical_sha256":"97e11d6edc2ecc2d6190a6e9c5a76b3a0ef253fbcf3aa6323c21fbdefe55b69e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97e11d6edc2ecc2d6190a6e9c5a76b3a0ef253fbcf3aa6323c21fbdefe55b69e","first_computed_at":"2026-07-07T02:18:49.090450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:18:49.090450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PrmMv86Z3Cph1An8tBNpvKmfyuRkvWp3inxVHffutkdvjYOAI75Eyit2yzkWNGQl4ooZRLDVGCm3eYToHdtBAw==","signature_status":"signed_v1","signed_at":"2026-07-07T02:18:49.091468Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.03947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8068547bc77c4bf0521ac3be476b27bca4e7231e411c4ad613d32c93ac0b7da","sha256:ee6346dbba2510708f8b06dfc9a5e1a96a1a3c77fe98d5936195535e38cb4923"],"state_sha256":"d858f30fe2b82df145ae2790edbc235384bec48cfeea27d1f7d0245d68c9cbfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLSE1aOczEuZ4h80/aqyYdn4/wRXk9DW2Bv1G2M1En3hk6lXIvYYmuQH5A4MXRDw+YgQR2Ri3Cad4o+r2KKlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T16:27:23.951382Z","bundle_sha256":"2be1abc9fdb2f6449cb9565b530fbc77b472999e07eb540263c58369a280ce50"}}