{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VSWAVVWNAH7GKIGLY3WT3TV3FN","short_pith_number":"pith:VSWAVVWN","canonical_record":{"source":{"id":"2605.14649","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T10:06:49Z","cross_cats_sorted":[],"title_canon_sha256":"e314f70ac2db9d95c8f64d08d6b0f353e1f16f50b27aaf33bc54ac0c6c320584","abstract_canon_sha256":"2afafc2c98b7f7cffc4b4803a7f6571e2c4a2008be9ea7eb97f53b06299cdffa"},"schema_version":"1.0"},"canonical_sha256":"acac0ad6cd01fe6520cbc6ed3dcebb2b7298eaec05be5344c1c87e65ef710ea5","source":{"kind":"arxiv","id":"2605.14649","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14649","created_at":"2026-05-17T23:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14649v1","created_at":"2026-05-17T23:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14649","created_at":"2026-05-17T23:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"VSWAVVWNAH7G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VSWAVVWNAH7GKIGL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VSWAVVWN","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VSWAVVWNAH7GKIGLY3WT3TV3FN","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14649","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T10:06:49Z","cross_cats_sorted":[],"title_canon_sha256":"e314f70ac2db9d95c8f64d08d6b0f353e1f16f50b27aaf33bc54ac0c6c320584","abstract_canon_sha256":"2afafc2c98b7f7cffc4b4803a7f6571e2c4a2008be9ea7eb97f53b06299cdffa"},"schema_version":"1.0"},"canonical_sha256":"acac0ad6cd01fe6520cbc6ed3dcebb2b7298eaec05be5344c1c87e65ef710ea5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:03.820129Z","signature_b64":"fBhYSFV79ycZJSYT8h+u+41oIvojqJ8NzvoNhlTH4rllpSatDS1dWBQlPOZFFyDmLcUFXZPro606LnKWZpTNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acac0ad6cd01fe6520cbc6ed3dcebb2b7298eaec05be5344c1c87e65ef710ea5","last_reissued_at":"2026-05-17T23:39:03.819473Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:03.819473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14649","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-05-17T23:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+CexckqMI+JPdN0YnCTWpiUy1iVIFutdBhvMglpGUGmog5G4p+vtrlNuEB1ZGyn1AZ8L4J3ubU6wCLXZ1iUdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:41:50.878786Z"},"content_sha256":"9873c418142f7b20fcb724da230d2fed084234ac2880f427fc28fa58ac24a3f5","schema_version":"1.0","event_id":"sha256:9873c418142f7b20fcb724da230d2fed084234ac2880f427fc28fa58ac24a3f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VSWAVVWNAH7GKIGLY3WT3TV3FN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-objective application placement in fog computing using graph neural network-based reinforcement learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carlos Guerrero, Isaac Lera","submitted_at":"2026-05-14T10:06:49Z","abstract_excerpt":"We propose a framework designed to tackle a multi-objective optimization challenge related to the placement of applications in fog computing, employing a deep reinforcement learning (DRL) approach. Unlike other optimization techniques, such as integer linear programming or genetic algorithms, DRL models are applied in real time to solve similar problem situations after training. Our model comprises a learning process featuring a graph neural network and two actor-critics, providing a holistic perspective on the priorities concerning interconnected services that constitute an application. The l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14649","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":""},"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:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/GrxgSQcrcBtslDQKfgzgx6pJwKmJgR/6kFhi6chVqXvjzsxryFNeGZKD4xTp5EU0Ew7VDn84uKOuVaHEYIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:41:50.879119Z"},"content_sha256":"06775d81dbf20ffcc320f8eb4d91ff730d32b4374b375167e91f0c2e0a639e28","schema_version":"1.0","event_id":"sha256:06775d81dbf20ffcc320f8eb4d91ff730d32b4374b375167e91f0c2e0a639e28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSWAVVWNAH7GKIGLY3WT3TV3FN/bundle.json","state_url":"https://pith.science/pith/VSWAVVWNAH7GKIGLY3WT3TV3FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSWAVVWNAH7GKIGLY3WT3TV3FN/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-02T20:41:50Z","links":{"resolver":"https://pith.science/pith/VSWAVVWNAH7GKIGLY3WT3TV3FN","bundle":"https://pith.science/pith/VSWAVVWNAH7GKIGLY3WT3TV3FN/bundle.json","state":"https://pith.science/pith/VSWAVVWNAH7GKIGLY3WT3TV3FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSWAVVWNAH7GKIGLY3WT3TV3FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VSWAVVWNAH7GKIGLY3WT3TV3FN","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":"2afafc2c98b7f7cffc4b4803a7f6571e2c4a2008be9ea7eb97f53b06299cdffa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T10:06:49Z","title_canon_sha256":"e314f70ac2db9d95c8f64d08d6b0f353e1f16f50b27aaf33bc54ac0c6c320584"},"schema_version":"1.0","source":{"id":"2605.14649","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14649","created_at":"2026-05-17T23:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14649v1","created_at":"2026-05-17T23:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14649","created_at":"2026-05-17T23:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"VSWAVVWNAH7G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VSWAVVWNAH7GKIGL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VSWAVVWN","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:06775d81dbf20ffcc320f8eb4d91ff730d32b4374b375167e91f0c2e0a639e28","target":"graph","created_at":"2026-05-17T23:39:03Z","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":"We propose a framework designed to tackle a multi-objective optimization challenge related to the placement of applications in fog computing, employing a deep reinforcement learning (DRL) approach. Unlike other optimization techniques, such as integer linear programming or genetic algorithms, DRL models are applied in real time to solve similar problem situations after training. Our model comprises a learning process featuring a graph neural network and two actor-critics, providing a holistic perspective on the priorities concerning interconnected services that constitute an application. The l","authors_text":"Carlos Guerrero, Isaac Lera","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T10:06:49Z","title":"Multi-objective application placement in fog computing using graph neural network-based reinforcement learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14649","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:9873c418142f7b20fcb724da230d2fed084234ac2880f427fc28fa58ac24a3f5","target":"record","created_at":"2026-05-17T23:39:03Z","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":"2afafc2c98b7f7cffc4b4803a7f6571e2c4a2008be9ea7eb97f53b06299cdffa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-14T10:06:49Z","title_canon_sha256":"e314f70ac2db9d95c8f64d08d6b0f353e1f16f50b27aaf33bc54ac0c6c320584"},"schema_version":"1.0","source":{"id":"2605.14649","kind":"arxiv","version":1}},"canonical_sha256":"acac0ad6cd01fe6520cbc6ed3dcebb2b7298eaec05be5344c1c87e65ef710ea5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acac0ad6cd01fe6520cbc6ed3dcebb2b7298eaec05be5344c1c87e65ef710ea5","first_computed_at":"2026-05-17T23:39:03.819473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:03.819473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fBhYSFV79ycZJSYT8h+u+41oIvojqJ8NzvoNhlTH4rllpSatDS1dWBQlPOZFFyDmLcUFXZPro606LnKWZpTNBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:03.820129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14649","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9873c418142f7b20fcb724da230d2fed084234ac2880f427fc28fa58ac24a3f5","sha256:06775d81dbf20ffcc320f8eb4d91ff730d32b4374b375167e91f0c2e0a639e28"],"state_sha256":"cadf74fc769d9d3c8d03fc38f9d3f5791d7b4f0836385336525bc7b489042f68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DC8BgtadF2CQjtHYkkVYMUPLz49+IgSEmhglIXGN8NI7f0OlrD3z9icguNZFzHpdi+JWGJZ5psi26gBIC/pYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T20:41:50.881029Z","bundle_sha256":"a59ce9c80b318eaadbdab3fa4a3b16ed65070541d178f5c526c49ef8ab1603c9"}}