{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RTR55I3Y5BNC44LRAI7MC2UAO5","short_pith_number":"pith:RTR55I3Y","canonical_record":{"source":{"id":"2607.27630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T03:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"32572a9ccbeba58ccd111ac7b765a5ea713c1bfdb0a0e5608896c8c47967cfbb","abstract_canon_sha256":"cc9ce1b9527f71f177b884b29750def177147cfe57485870c7eb247f11a4ff4e"},"schema_version":"1.0"},"canonical_sha256":"8ce3dea378e85a2e7171023ec16a80776ce10d1feb7025c1a018b49b8b82b52e","source":{"kind":"arxiv","id":"2607.27630","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27630","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27630v1","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27630","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"RTR55I3Y5BNC","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"RTR55I3Y5BNC44LR","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"RTR55I3Y","created_at":"2026-07-31T01:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RTR55I3Y5BNC44LRAI7MC2UAO5","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T03:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"32572a9ccbeba58ccd111ac7b765a5ea713c1bfdb0a0e5608896c8c47967cfbb","abstract_canon_sha256":"cc9ce1b9527f71f177b884b29750def177147cfe57485870c7eb247f11a4ff4e"},"schema_version":"1.0"},"canonical_sha256":"8ce3dea378e85a2e7171023ec16a80776ce10d1feb7025c1a018b49b8b82b52e","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ce3dea378e85a2e7171023ec16a80776ce10d1feb7025c1a018b49b8b82b52e","last_reissued_at":"2026-07-31T01:28:35.744940Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:28:35.744940Z"},"source_kind":"arxiv","source_id":"2607.27630","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-31T01:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfzU32pjTRX6Q87WEfKd2z4RK9AaYSjvSy4Kzu5Yt01m47SU0SzT47yX2KiBXLEpMm0D3PlTevAnlj+MgeV/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:36:52.607925Z"},"content_sha256":"fd17befd5b193b546afabc406975c775c86c0e09c4a40c8db83b4892919e0b0c","schema_version":"1.0","event_id":"sha256:fd17befd5b193b546afabc406975c775c86c0e09c4a40c8db83b4892919e0b0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RTR55I3Y5BNC44LRAI7MC2UAO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SCOPE: Synthetic Conditional Objectives for Policy Evolution in Black-Box Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Huynh Thi Thanh Binh, Le Cong Bang, Nguyen Huu Duc, Nguyen Viet Tuan Kiet, Tran Cong Dao","submitted_at":"2026-07-30T03:42:18Z","abstract_excerpt":"Black-box combinatorial optimization requires systematically identifying high-quality solutions under a limited evaluation budget, yet the unknown objective function provides little guidance for deciding where the search should explore next. We introduce SCOPE, a general framework for Synthetic Conditional Objectives for Policy Evolution in Black-Box Combinatorial Optimization. Rather than directly optimizing the inaccessible objective, SCOPE learns a set of synthetic objectives conditioned on the accumulated search history, where each objective is designed to expose a distinct and potentially"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27630","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.27630/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-31T01:28:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qQ+SEZgTY3C1pm+vckGsYbkr1OnYEPA3ChaTQ6sTLwFhchOHPYNc3p9kQz3gulh06km1lokeK2QGixzBw4KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:36:52.608464Z"},"content_sha256":"bf50c5227f4f1eca0d83a70e21105adfbfd10d50b4fe52ea6c0601b4281e1ddb","schema_version":"1.0","event_id":"sha256:bf50c5227f4f1eca0d83a70e21105adfbfd10d50b4fe52ea6c0601b4281e1ddb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTR55I3Y5BNC44LRAI7MC2UAO5/bundle.json","state_url":"https://pith.science/pith/RTR55I3Y5BNC44LRAI7MC2UAO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTR55I3Y5BNC44LRAI7MC2UAO5/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-19T01:36:52Z","links":{"resolver":"https://pith.science/pith/RTR55I3Y5BNC44LRAI7MC2UAO5","bundle":"https://pith.science/pith/RTR55I3Y5BNC44LRAI7MC2UAO5/bundle.json","state":"https://pith.science/pith/RTR55I3Y5BNC44LRAI7MC2UAO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTR55I3Y5BNC44LRAI7MC2UAO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RTR55I3Y5BNC44LRAI7MC2UAO5","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":"cc9ce1b9527f71f177b884b29750def177147cfe57485870c7eb247f11a4ff4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T03:42:18Z","title_canon_sha256":"32572a9ccbeba58ccd111ac7b765a5ea713c1bfdb0a0e5608896c8c47967cfbb"},"schema_version":"1.0","source":{"id":"2607.27630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27630","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27630v1","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27630","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"pith_short_12","alias_value":"RTR55I3Y5BNC","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"RTR55I3Y5BNC44LR","created_at":"2026-07-31T01:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"RTR55I3Y","created_at":"2026-07-31T01:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:bf50c5227f4f1eca0d83a70e21105adfbfd10d50b4fe52ea6c0601b4281e1ddb","target":"graph","created_at":"2026-07-31T01:28:35Z","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.27630/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Black-box combinatorial optimization requires systematically identifying high-quality solutions under a limited evaluation budget, yet the unknown objective function provides little guidance for deciding where the search should explore next. We introduce SCOPE, a general framework for Synthetic Conditional Objectives for Policy Evolution in Black-Box Combinatorial Optimization. Rather than directly optimizing the inaccessible objective, SCOPE learns a set of synthetic objectives conditioned on the accumulated search history, where each objective is designed to expose a distinct and potentially","authors_text":"Huynh Thi Thanh Binh, Le Cong Bang, Nguyen Huu Duc, Nguyen Viet Tuan Kiet, Tran Cong Dao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T03:42:18Z","title":"SCOPE: Synthetic Conditional Objectives for Policy Evolution in Black-Box Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27630","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:fd17befd5b193b546afabc406975c775c86c0e09c4a40c8db83b4892919e0b0c","target":"record","created_at":"2026-07-31T01:28:35Z","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":"cc9ce1b9527f71f177b884b29750def177147cfe57485870c7eb247f11a4ff4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T03:42:18Z","title_canon_sha256":"32572a9ccbeba58ccd111ac7b765a5ea713c1bfdb0a0e5608896c8c47967cfbb"},"schema_version":"1.0","source":{"id":"2607.27630","kind":"arxiv","version":1}},"canonical_sha256":"8ce3dea378e85a2e7171023ec16a80776ce10d1feb7025c1a018b49b8b82b52e","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ce3dea378e85a2e7171023ec16a80776ce10d1feb7025c1a018b49b8b82b52e","first_computed_at":"2026-07-31T01:28:35.744940Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:28:35.744940Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd17befd5b193b546afabc406975c775c86c0e09c4a40c8db83b4892919e0b0c","sha256:bf50c5227f4f1eca0d83a70e21105adfbfd10d50b4fe52ea6c0601b4281e1ddb"],"state_sha256":"56076f9fe9c92963d256c032644f8df7ffdc0f01395e749988b5f2ac00f4929c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0L0qwrb9q4AnGLLcQgijYWmcygHMWl1G/RwcsgA82lgsn8pQwoWT3PAD/EV7zwBg0LDtbXEf5+WDf0gp0rq0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T01:36:52.612790Z","bundle_sha256":"5007c1db2549a1480245506dfda79e077949be68bd53878ecd4d64d1920f92b8"}}