{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6MBR4ZNH7XGWSCFE4QV4HLWR3L","short_pith_number":"pith:6MBR4ZNH","canonical_record":{"source":{"id":"2606.20236","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-18T13:47:28Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"dacd9d06ce2a00b45601a0079fac2566894af624a767ec81dbe37c0a43d745e4","abstract_canon_sha256":"2fc2e5028e5decc027cb5e1cd7bfc29d5eb32ad4a7d2128fc308554827451338"},"schema_version":"1.0"},"canonical_sha256":"f3031e65a7fdcd6908a4e42bc3aed1dacf69bcc725e1298f7d41b5585a2759ef","source":{"kind":"arxiv","id":"2606.20236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20236","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20236v1","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20236","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"6MBR4ZNH7XGW","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"pith_short_16","alias_value":"6MBR4ZNH7XGWSCFE","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"pith_short_8","alias_value":"6MBR4ZNH","created_at":"2026-06-19T16:13:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6MBR4ZNH7XGWSCFE4QV4HLWR3L","target":"record","payload":{"canonical_record":{"source":{"id":"2606.20236","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-18T13:47:28Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"dacd9d06ce2a00b45601a0079fac2566894af624a767ec81dbe37c0a43d745e4","abstract_canon_sha256":"2fc2e5028e5decc027cb5e1cd7bfc29d5eb32ad4a7d2128fc308554827451338"},"schema_version":"1.0"},"canonical_sha256":"f3031e65a7fdcd6908a4e42bc3aed1dacf69bcc725e1298f7d41b5585a2759ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:06.583272Z","signature_b64":"iKFd6i9sGH3AcOemmut5shYEwF2qbQ4e+d7zyHF5R+PfauDZhqlSAbznH0hnF4/taKjCPlhHKOuI73HU9P7LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3031e65a7fdcd6908a4e42bc3aed1dacf69bcc725e1298f7d41b5585a2759ef","last_reissued_at":"2026-06-19T16:13:06.582930Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:06.582930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.20236","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:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kH6Vnifb2Q/J4NnGbDArhwVu23iARdwlocxzUoljRoc8YR/vFtQ+bH4VQNi/ZrIR+7iBDywTBhTxLaHi0EHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T00:29:53.496156Z"},"content_sha256":"bbf4a2b2e9861e637f4f5caa6551f3a8c9257dce25b98cfea69e6c7b46763780","schema_version":"1.0","event_id":"sha256:bbf4a2b2e9861e637f4f5caa6551f3a8c9257dce25b98cfea69e6c7b46763780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6MBR4ZNH7XGWSCFE4QV4HLWR3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multi-Agent system for Multi-Objective constrained optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.AI","authors_text":"Federica Filippini","submitted_at":"2026-06-18T13:47:28Z","abstract_excerpt":"Many decision-making problems in computing and networking systems can be naturally formulated as cost-minimization problems under performance constraints. In dynamic environments, reinforcement learning (RL) is often used to solve such problems at runtime by embedding both costs and constraint violations into a single scalar reward through weighted penalty terms, following a Lagrangian-inspired formulation. However, in this context the behavior of the learned policy critically depends on the choice of these weights, which are typically selected manually. This makes it difficult to identify an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20236","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.20236/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:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VzpE0PRKRus/avLSYbqk2GyCL7UlOiM6/gK9T8/y9OZjz7CBvvWGQbu95+EYe7WmU6DDktdwupiBKrBwcAcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T00:29:53.496582Z"},"content_sha256":"c687095a16af40158ca16780a65a00968837a485bc4c6bc3194d947326c712e7","schema_version":"1.0","event_id":"sha256:c687095a16af40158ca16780a65a00968837a485bc4c6bc3194d947326c712e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MBR4ZNH7XGWSCFE4QV4HLWR3L/bundle.json","state_url":"https://pith.science/pith/6MBR4ZNH7XGWSCFE4QV4HLWR3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MBR4ZNH7XGWSCFE4QV4HLWR3L/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-07-04T00:29:53Z","links":{"resolver":"https://pith.science/pith/6MBR4ZNH7XGWSCFE4QV4HLWR3L","bundle":"https://pith.science/pith/6MBR4ZNH7XGWSCFE4QV4HLWR3L/bundle.json","state":"https://pith.science/pith/6MBR4ZNH7XGWSCFE4QV4HLWR3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MBR4ZNH7XGWSCFE4QV4HLWR3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6MBR4ZNH7XGWSCFE4QV4HLWR3L","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":"2fc2e5028e5decc027cb5e1cd7bfc29d5eb32ad4a7d2128fc308554827451338","cross_cats_sorted":["cs.LG","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-18T13:47:28Z","title_canon_sha256":"dacd9d06ce2a00b45601a0079fac2566894af624a767ec81dbe37c0a43d745e4"},"schema_version":"1.0","source":{"id":"2606.20236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20236","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20236v1","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20236","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"6MBR4ZNH7XGW","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"pith_short_16","alias_value":"6MBR4ZNH7XGWSCFE","created_at":"2026-06-19T16:13:06Z"},{"alias_kind":"pith_short_8","alias_value":"6MBR4ZNH","created_at":"2026-06-19T16:13:06Z"}],"graph_snapshots":[{"event_id":"sha256:c687095a16af40158ca16780a65a00968837a485bc4c6bc3194d947326c712e7","target":"graph","created_at":"2026-06-19T16:13:06Z","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.20236/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many decision-making problems in computing and networking systems can be naturally formulated as cost-minimization problems under performance constraints. In dynamic environments, reinforcement learning (RL) is often used to solve such problems at runtime by embedding both costs and constraint violations into a single scalar reward through weighted penalty terms, following a Lagrangian-inspired formulation. However, in this context the behavior of the learned policy critically depends on the choice of these weights, which are typically selected manually. This makes it difficult to identify an ","authors_text":"Federica Filippini","cross_cats":["cs.LG","cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-18T13:47:28Z","title":"A Multi-Agent system for Multi-Objective constrained optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20236","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:bbf4a2b2e9861e637f4f5caa6551f3a8c9257dce25b98cfea69e6c7b46763780","target":"record","created_at":"2026-06-19T16:13:06Z","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":"2fc2e5028e5decc027cb5e1cd7bfc29d5eb32ad4a7d2128fc308554827451338","cross_cats_sorted":["cs.LG","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-18T13:47:28Z","title_canon_sha256":"dacd9d06ce2a00b45601a0079fac2566894af624a767ec81dbe37c0a43d745e4"},"schema_version":"1.0","source":{"id":"2606.20236","kind":"arxiv","version":1}},"canonical_sha256":"f3031e65a7fdcd6908a4e42bc3aed1dacf69bcc725e1298f7d41b5585a2759ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3031e65a7fdcd6908a4e42bc3aed1dacf69bcc725e1298f7d41b5585a2759ef","first_computed_at":"2026-06-19T16:13:06.582930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:06.582930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iKFd6i9sGH3AcOemmut5shYEwF2qbQ4e+d7zyHF5R+PfauDZhqlSAbznH0hnF4/taKjCPlhHKOuI73HU9P7LBw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:06.583272Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbf4a2b2e9861e637f4f5caa6551f3a8c9257dce25b98cfea69e6c7b46763780","sha256:c687095a16af40158ca16780a65a00968837a485bc4c6bc3194d947326c712e7"],"state_sha256":"3336a390da01ddedbc063d25c6011258c99363d1cba4642f949c2123129a94d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTV7yLrsIZT7SWitClm+BamS3KOkaeWQPfGRy+Piy896ovOp/NUOPO/q4vFO9p2gzZqnlgrPniwQgYwNBNSuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T00:29:53.499485Z","bundle_sha256":"a1fee4763e68b412abaf0787f0d753b4dfb6c21984b6e3ca41773dd8ae5d9f1c"}}