{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZWW2TGWQVM6B7HNCBEXDAZZKYG","short_pith_number":"pith:ZWW2TGWQ","canonical_record":{"source":{"id":"2606.18590","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"econ.EM","submitted_at":"2026-06-17T01:37:45Z","cross_cats_sorted":[],"title_canon_sha256":"7e67e5ee1f01263943ab9a51e42df82184662d6311f69a6c876ecad85595118e","abstract_canon_sha256":"92f8becc40ff02a99bc6de0098f4fd7b2e0eea5aaea32d58ff4db1d272d88e52"},"schema_version":"1.0"},"canonical_sha256":"cdada99ad0ab3c1f9da2092e30672ac1a3ca49155c9e95d50caf16475438a27c","source":{"kind":"arxiv","id":"2606.18590","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18590","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18590v1","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18590","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZWW2TGWQVM6B","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZWW2TGWQVM6B7HNC","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZWW2TGWQ","created_at":"2026-06-19T16:11:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZWW2TGWQVM6B7HNCBEXDAZZKYG","target":"record","payload":{"canonical_record":{"source":{"id":"2606.18590","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"econ.EM","submitted_at":"2026-06-17T01:37:45Z","cross_cats_sorted":[],"title_canon_sha256":"7e67e5ee1f01263943ab9a51e42df82184662d6311f69a6c876ecad85595118e","abstract_canon_sha256":"92f8becc40ff02a99bc6de0098f4fd7b2e0eea5aaea32d58ff4db1d272d88e52"},"schema_version":"1.0"},"canonical_sha256":"cdada99ad0ab3c1f9da2092e30672ac1a3ca49155c9e95d50caf16475438a27c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:41.857553Z","signature_b64":"uDzjsEuIY4tbxkK1L17kgkI19cMs2I/+iCJShtRC7gFSHloORh7x8jOj1zvrVHtIiHxQfjRkK0aYibwDMB5oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdada99ad0ab3c1f9da2092e30672ac1a3ca49155c9e95d50caf16475438a27c","last_reissued_at":"2026-06-19T16:11:41.857195Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:41.857195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.18590","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-06-19T16:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rc8wqdEFvhgloqIITR/BtgmCLncCLnXarC/sbBbCpKPpjicQCAOSg58f8I3LiJJ8nNEZndLTxNiqYArcCHZTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:01:11.253036Z"},"content_sha256":"3afe5b34257360e01892fef79843bd9e8b3cb229044e3bc526019281f882720c","schema_version":"1.0","event_id":"sha256:3afe5b34257360e01892fef79843bd9e8b3cb229044e3bc526019281f882720c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZWW2TGWQVM6B7HNCBEXDAZZKYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking Treatment Saturations under Clustered Network Interference","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"econ.EM","authors_text":"Julius Owusu, Seungjin Han, Youngki Shin","submitted_at":"2026-06-17T01:37:45Z","abstract_excerpt":"In this paper, we study how to rank a finite set of treatment saturations for a target population with clustered network interference. We propose an empirical success (ES) ranking rule that, for each pair of saturations, selects the saturation level with the higher estimated welfare using data from a two-stage randomized saturation design. We adopt the statistical decision theory framework with additively separable regret loss to assess the performance of the ES ranking rule. We derive non-asymptotic upper bounds on the maximum regret of the ES ranking rule that depend on the within-cluster ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18590","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/2606.18590/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-06-19T16:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/Mf1yaT7jQmxSEKwGSG4g+lu4PUuRbwJ3oxpjkAgZP3wsAzpkPCB5GXErz8Im5mNxvjGvn7YKOTcaIHIPHmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:01:11.253380Z"},"content_sha256":"306a8da98d78d5f8f379ade362870460757ad84891940b79e80ac576b49c5676","schema_version":"1.0","event_id":"sha256:306a8da98d78d5f8f379ade362870460757ad84891940b79e80ac576b49c5676"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWW2TGWQVM6B7HNCBEXDAZZKYG/bundle.json","state_url":"https://pith.science/pith/ZWW2TGWQVM6B7HNCBEXDAZZKYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWW2TGWQVM6B7HNCBEXDAZZKYG/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-14T07:01:11Z","links":{"resolver":"https://pith.science/pith/ZWW2TGWQVM6B7HNCBEXDAZZKYG","bundle":"https://pith.science/pith/ZWW2TGWQVM6B7HNCBEXDAZZKYG/bundle.json","state":"https://pith.science/pith/ZWW2TGWQVM6B7HNCBEXDAZZKYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWW2TGWQVM6B7HNCBEXDAZZKYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZWW2TGWQVM6B7HNCBEXDAZZKYG","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":"92f8becc40ff02a99bc6de0098f4fd7b2e0eea5aaea32d58ff4db1d272d88e52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"econ.EM","submitted_at":"2026-06-17T01:37:45Z","title_canon_sha256":"7e67e5ee1f01263943ab9a51e42df82184662d6311f69a6c876ecad85595118e"},"schema_version":"1.0","source":{"id":"2606.18590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18590","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18590v1","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18590","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZWW2TGWQVM6B","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"pith_short_16","alias_value":"ZWW2TGWQVM6B7HNC","created_at":"2026-06-19T16:11:41Z"},{"alias_kind":"pith_short_8","alias_value":"ZWW2TGWQ","created_at":"2026-06-19T16:11:41Z"}],"graph_snapshots":[{"event_id":"sha256:306a8da98d78d5f8f379ade362870460757ad84891940b79e80ac576b49c5676","target":"graph","created_at":"2026-06-19T16:11:41Z","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/2606.18590/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study how to rank a finite set of treatment saturations for a target population with clustered network interference. We propose an empirical success (ES) ranking rule that, for each pair of saturations, selects the saturation level with the higher estimated welfare using data from a two-stage randomized saturation design. We adopt the statistical decision theory framework with additively separable regret loss to assess the performance of the ES ranking rule. We derive non-asymptotic upper bounds on the maximum regret of the ES ranking rule that depend on the within-cluster ne","authors_text":"Julius Owusu, Seungjin Han, Youngki Shin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"econ.EM","submitted_at":"2026-06-17T01:37:45Z","title":"Ranking Treatment Saturations under Clustered Network Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18590","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:3afe5b34257360e01892fef79843bd9e8b3cb229044e3bc526019281f882720c","target":"record","created_at":"2026-06-19T16:11:41Z","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":"92f8becc40ff02a99bc6de0098f4fd7b2e0eea5aaea32d58ff4db1d272d88e52","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"econ.EM","submitted_at":"2026-06-17T01:37:45Z","title_canon_sha256":"7e67e5ee1f01263943ab9a51e42df82184662d6311f69a6c876ecad85595118e"},"schema_version":"1.0","source":{"id":"2606.18590","kind":"arxiv","version":1}},"canonical_sha256":"cdada99ad0ab3c1f9da2092e30672ac1a3ca49155c9e95d50caf16475438a27c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdada99ad0ab3c1f9da2092e30672ac1a3ca49155c9e95d50caf16475438a27c","first_computed_at":"2026-06-19T16:11:41.857195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:41.857195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uDzjsEuIY4tbxkK1L17kgkI19cMs2I/+iCJShtRC7gFSHloORh7x8jOj1zvrVHtIiHxQfjRkK0aYibwDMB5oDA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:41.857553Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3afe5b34257360e01892fef79843bd9e8b3cb229044e3bc526019281f882720c","sha256:306a8da98d78d5f8f379ade362870460757ad84891940b79e80ac576b49c5676"],"state_sha256":"41a334a3d3bcdd105545680ee1e8e3ddde802d49cc7671bb2ec0967141596d48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDZIC1duoX9JaY4gBmcPKmxk3NCJZ1w/eYGU2bvKRh8YCX5na/oQq5O+hURG6qAAlR9MEkhHXIfUGrEmDgAGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:01:11.256624Z","bundle_sha256":"2dad40c6602848fa92f03e476dfd6aea2d77f3d4f3301599ca543bebebee52dc"}}