{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VQ2VKFDRWA2KI2HCC3KXTZ4JGG","short_pith_number":"pith:VQ2VKFDR","canonical_record":{"source":{"id":"2606.18106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T16:07:20Z","cross_cats_sorted":[],"title_canon_sha256":"fd7c2f2c7efc9a937d1e55f96e6bf4094c27d65accad2c048984ad9016bab616","abstract_canon_sha256":"37559c03e3143b741e65809c299070ed79a23359f315bd5cea730f5ef69a4f2d"},"schema_version":"1.0"},"canonical_sha256":"ac35551471b034a468e216d579e78931b7d30bca0effdabcdfd0d07a8a1dee05","source":{"kind":"arxiv","id":"2606.18106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18106","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18106v1","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18106","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"VQ2VKFDRWA2K","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"VQ2VKFDRWA2KI2HC","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"VQ2VKFDR","created_at":"2026-06-19T16:10:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VQ2VKFDRWA2KI2HCC3KXTZ4JGG","target":"record","payload":{"canonical_record":{"source":{"id":"2606.18106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T16:07:20Z","cross_cats_sorted":[],"title_canon_sha256":"fd7c2f2c7efc9a937d1e55f96e6bf4094c27d65accad2c048984ad9016bab616","abstract_canon_sha256":"37559c03e3143b741e65809c299070ed79a23359f315bd5cea730f5ef69a4f2d"},"schema_version":"1.0"},"canonical_sha256":"ac35551471b034a468e216d579e78931b7d30bca0effdabcdfd0d07a8a1dee05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:48.599020Z","signature_b64":"69Bw6/X3BqD/T6BPELCtPb79XisfQBd7dGIUdYMeG1Lvrm7Mswv91f6xcLYxa2Rp2zo6loukpvWRESZ9iWTBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac35551471b034a468e216d579e78931b7d30bca0effdabcdfd0d07a8a1dee05","last_reissued_at":"2026-06-19T16:10:48.598684Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:48.598684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.18106","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:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm73P0lCajs84RV24c+l8kecyp/gVYnb7gtIsQ5qFhHefTo1CtWJ5SSni8ucJNXTKDmx3dc3QLU/g36tdHy2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:51:11.219908Z"},"content_sha256":"4850f9586dab9d99d2d766c23c9b4b585e9ce83d14e4144f1798cf25fa5a0a6d","schema_version":"1.0","event_id":"sha256:4850f9586dab9d99d2d766c23c9b4b585e9ce83d14e4144f1798cf25fa5a0a6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VQ2VKFDRWA2KI2HCC3KXTZ4JGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning for Minimum Zero-Forcing Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Maur\\'icio Gruppi, Steve Halley","submitted_at":"2026-06-16T16:07:20Z","abstract_excerpt":"This paper explores the problem of finding the minimum zero-forcing set on undirected graphs and proposes an adapted machine-learning framework to solve the problem. The minimum zero-forcing set problem is a graph coloring problem where the color of an initial set of nodes propagates throughout a network. The set of nodes is zero-forcing if it forces all uncolored nodes to change color under the constraint of the color-change rule. There are several applications to this problem across different domains such as network science, network control, and designing logical circuits. Finding the minimu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18106","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.18106/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:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luJkrhXObXszQoyV2aVY1pPbnBiDcHvcSDVp4uiGjjxombvoUNoUBuJakZwXQxwS8Cb5WQ4Oae+tZq+lDNx0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:51:11.220274Z"},"content_sha256":"7b6bc146fe5cd0a815645ed4c9507a98ea80e1de23ce9b0133dea9ea805be9a9","schema_version":"1.0","event_id":"sha256:7b6bc146fe5cd0a815645ed4c9507a98ea80e1de23ce9b0133dea9ea805be9a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQ2VKFDRWA2KI2HCC3KXTZ4JGG/bundle.json","state_url":"https://pith.science/pith/VQ2VKFDRWA2KI2HCC3KXTZ4JGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQ2VKFDRWA2KI2HCC3KXTZ4JGG/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-04T20:51:11Z","links":{"resolver":"https://pith.science/pith/VQ2VKFDRWA2KI2HCC3KXTZ4JGG","bundle":"https://pith.science/pith/VQ2VKFDRWA2KI2HCC3KXTZ4JGG/bundle.json","state":"https://pith.science/pith/VQ2VKFDRWA2KI2HCC3KXTZ4JGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQ2VKFDRWA2KI2HCC3KXTZ4JGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VQ2VKFDRWA2KI2HCC3KXTZ4JGG","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":"37559c03e3143b741e65809c299070ed79a23359f315bd5cea730f5ef69a4f2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T16:07:20Z","title_canon_sha256":"fd7c2f2c7efc9a937d1e55f96e6bf4094c27d65accad2c048984ad9016bab616"},"schema_version":"1.0","source":{"id":"2606.18106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18106","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18106v1","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18106","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"VQ2VKFDRWA2K","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"VQ2VKFDRWA2KI2HC","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"VQ2VKFDR","created_at":"2026-06-19T16:10:48Z"}],"graph_snapshots":[{"event_id":"sha256:7b6bc146fe5cd0a815645ed4c9507a98ea80e1de23ce9b0133dea9ea805be9a9","target":"graph","created_at":"2026-06-19T16:10:48Z","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.18106/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper explores the problem of finding the minimum zero-forcing set on undirected graphs and proposes an adapted machine-learning framework to solve the problem. The minimum zero-forcing set problem is a graph coloring problem where the color of an initial set of nodes propagates throughout a network. The set of nodes is zero-forcing if it forces all uncolored nodes to change color under the constraint of the color-change rule. There are several applications to this problem across different domains such as network science, network control, and designing logical circuits. Finding the minimu","authors_text":"Maur\\'icio Gruppi, Steve Halley","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T16:07:20Z","title":"Deep Reinforcement Learning for Minimum Zero-Forcing Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18106","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:4850f9586dab9d99d2d766c23c9b4b585e9ce83d14e4144f1798cf25fa5a0a6d","target":"record","created_at":"2026-06-19T16:10:48Z","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":"37559c03e3143b741e65809c299070ed79a23359f315bd5cea730f5ef69a4f2d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-16T16:07:20Z","title_canon_sha256":"fd7c2f2c7efc9a937d1e55f96e6bf4094c27d65accad2c048984ad9016bab616"},"schema_version":"1.0","source":{"id":"2606.18106","kind":"arxiv","version":1}},"canonical_sha256":"ac35551471b034a468e216d579e78931b7d30bca0effdabcdfd0d07a8a1dee05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac35551471b034a468e216d579e78931b7d30bca0effdabcdfd0d07a8a1dee05","first_computed_at":"2026-06-19T16:10:48.598684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:48.598684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"69Bw6/X3BqD/T6BPELCtPb79XisfQBd7dGIUdYMeG1Lvrm7Mswv91f6xcLYxa2Rp2zo6loukpvWRESZ9iWTBAQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:48.599020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4850f9586dab9d99d2d766c23c9b4b585e9ce83d14e4144f1798cf25fa5a0a6d","sha256:7b6bc146fe5cd0a815645ed4c9507a98ea80e1de23ce9b0133dea9ea805be9a9"],"state_sha256":"870e6644f82ad16a06b84967bebd30bf6b32bb26ea234fa20533c0888c92ef0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16pZngq8ifhvoNghZsw1yJq7MEA2Fa1pQSSzUafl5NXRE/VSjNKtkIxxFXS7VMZ0kxtrFutopy+hHPxKDzQRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:51:11.222161Z","bundle_sha256":"14797d6479e903d00451567281325591febfed0aeb734e774e932e40918bdafc"}}