{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Z5VMBQRR3HQTJHHVCJ4BWLXQX4","short_pith_number":"pith:Z5VMBQRR","canonical_record":{"source":{"id":"2507.16635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T14:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"e4fd12fe250c704bfd8bcee593b7c8ff1fec7af87e0772fafc4fcf17ef51e288","abstract_canon_sha256":"ee7af2f8655cb477f6e18a5824f1353c4918d3c98d1c288015a04c21da4267cd"},"schema_version":"1.0"},"canonical_sha256":"cf6ac0c231d9e1349cf512781b2ef0bf193dcbde097bd896edff039e6448cf3b","source":{"kind":"arxiv","id":"2507.16635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.16635","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"2507.16635v1","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.16635","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"Z5VMBQRR3HQT","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"pith_short_16","alias_value":"Z5VMBQRR3HQTJHHV","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"pith_short_8","alias_value":"Z5VMBQRR","created_at":"2026-07-05T11:41:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Z5VMBQRR3HQTJHHVCJ4BWLXQX4","target":"record","payload":{"canonical_record":{"source":{"id":"2507.16635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T14:34:36Z","cross_cats_sorted":[],"title_canon_sha256":"e4fd12fe250c704bfd8bcee593b7c8ff1fec7af87e0772fafc4fcf17ef51e288","abstract_canon_sha256":"ee7af2f8655cb477f6e18a5824f1353c4918d3c98d1c288015a04c21da4267cd"},"schema_version":"1.0"},"canonical_sha256":"cf6ac0c231d9e1349cf512781b2ef0bf193dcbde097bd896edff039e6448cf3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:28.062130Z","signature_b64":"b6jMZDCb1TtfwPR3C+Ktu7Xe1V/Qf7WslpIvQDKNlXjHqvpPuCuB+OYQe+rPxPwVH0803Sx+mGF63N2Ppv+bBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf6ac0c231d9e1349cf512781b2ef0bf193dcbde097bd896edff039e6448cf3b","last_reissued_at":"2026-07-05T11:41:28.061728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:28.061728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.16635","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-05T11:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XoEt6frHV/c2lgm8nKBz0oQOFTrYWYjQEvXgcGPBADwc2h35e+ku76dn7n4S5WFyfK0f6B6WVuzduAlOFshIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:38:45.399761Z"},"content_sha256":"11a8d484b55fd2e2bea9b58d9db732474270c07debf16a37fb28634fd069db68","schema_version":"1.0","event_id":"sha256:11a8d484b55fd2e2bea9b58d9db732474270c07debf16a37fb28634fd069db68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Z5VMBQRR3HQTJHHVCJ4BWLXQX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Novel Multi-Agent Action Masked Deep Reinforcement Learning for General Industrial Assembly Lines Balancing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ali Mohamed Ali, Hashim A. Hashim, Luca Tirel","submitted_at":"2025-07-22T14:34:36Z","abstract_excerpt":"Efficient planning of activities is essential for modern industrial assembly lines to uphold manufacturing standards, prevent project constraint violations, and achieve cost-effective operations. While exact solutions to such challenges can be obtained through Integer Programming (IP), the dependence of the search space on input parameters often makes IP computationally infeasible for large-scale scenarios. Heuristic methods, such as Genetic Algorithms, can also be applied, but they frequently produce suboptimal solutions in extensive cases. This paper introduces a novel mathematical model of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.16635","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/2507.16635/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-05T11:41:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0AXIyghKVoXh7WFa/LWIbwtK/Zx5feLLXsgAuf9qgHfxd+l/vwBHtt785T6AYHlE0w7s5dOh70LBQ6YJcyvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:38:45.400308Z"},"content_sha256":"980608470136384b6dec0a7f54e751426c73d6541619e9ec1974c022f452736a","schema_version":"1.0","event_id":"sha256:980608470136384b6dec0a7f54e751426c73d6541619e9ec1974c022f452736a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5VMBQRR3HQTJHHVCJ4BWLXQX4/bundle.json","state_url":"https://pith.science/pith/Z5VMBQRR3HQTJHHVCJ4BWLXQX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5VMBQRR3HQTJHHVCJ4BWLXQX4/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-09T02:38:45Z","links":{"resolver":"https://pith.science/pith/Z5VMBQRR3HQTJHHVCJ4BWLXQX4","bundle":"https://pith.science/pith/Z5VMBQRR3HQTJHHVCJ4BWLXQX4/bundle.json","state":"https://pith.science/pith/Z5VMBQRR3HQTJHHVCJ4BWLXQX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5VMBQRR3HQTJHHVCJ4BWLXQX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Z5VMBQRR3HQTJHHVCJ4BWLXQX4","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":"ee7af2f8655cb477f6e18a5824f1353c4918d3c98d1c288015a04c21da4267cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T14:34:36Z","title_canon_sha256":"e4fd12fe250c704bfd8bcee593b7c8ff1fec7af87e0772fafc4fcf17ef51e288"},"schema_version":"1.0","source":{"id":"2507.16635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.16635","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"arxiv_version","alias_value":"2507.16635v1","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.16635","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"pith_short_12","alias_value":"Z5VMBQRR3HQT","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"pith_short_16","alias_value":"Z5VMBQRR3HQTJHHV","created_at":"2026-07-05T11:41:28Z"},{"alias_kind":"pith_short_8","alias_value":"Z5VMBQRR","created_at":"2026-07-05T11:41:28Z"}],"graph_snapshots":[{"event_id":"sha256:980608470136384b6dec0a7f54e751426c73d6541619e9ec1974c022f452736a","target":"graph","created_at":"2026-07-05T11:41:28Z","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/2507.16635/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient planning of activities is essential for modern industrial assembly lines to uphold manufacturing standards, prevent project constraint violations, and achieve cost-effective operations. While exact solutions to such challenges can be obtained through Integer Programming (IP), the dependence of the search space on input parameters often makes IP computationally infeasible for large-scale scenarios. Heuristic methods, such as Genetic Algorithms, can also be applied, but they frequently produce suboptimal solutions in extensive cases. This paper introduces a novel mathematical model of ","authors_text":"Ali Mohamed Ali, Hashim A. Hashim, Luca Tirel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T14:34:36Z","title":"Novel Multi-Agent Action Masked Deep Reinforcement Learning for General Industrial Assembly Lines Balancing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.16635","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:11a8d484b55fd2e2bea9b58d9db732474270c07debf16a37fb28634fd069db68","target":"record","created_at":"2026-07-05T11:41:28Z","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":"ee7af2f8655cb477f6e18a5824f1353c4918d3c98d1c288015a04c21da4267cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-22T14:34:36Z","title_canon_sha256":"e4fd12fe250c704bfd8bcee593b7c8ff1fec7af87e0772fafc4fcf17ef51e288"},"schema_version":"1.0","source":{"id":"2507.16635","kind":"arxiv","version":1}},"canonical_sha256":"cf6ac0c231d9e1349cf512781b2ef0bf193dcbde097bd896edff039e6448cf3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf6ac0c231d9e1349cf512781b2ef0bf193dcbde097bd896edff039e6448cf3b","first_computed_at":"2026-07-05T11:41:28.061728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:41:28.061728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b6jMZDCb1TtfwPR3C+Ktu7Xe1V/Qf7WslpIvQDKNlXjHqvpPuCuB+OYQe+rPxPwVH0803Sx+mGF63N2Ppv+bBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:41:28.062130Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.16635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11a8d484b55fd2e2bea9b58d9db732474270c07debf16a37fb28634fd069db68","sha256:980608470136384b6dec0a7f54e751426c73d6541619e9ec1974c022f452736a"],"state_sha256":"54e0b28d44f3c961a20d2ebb480577087b8a03b3a68b67f1ec25a83f8f32eb1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDIOThMlNXV3xjlwjyz6kfytMH4CwcXgImFK1GBYXN+9z23KVnRNpA2AV190PrBIp2zWmuAKuS427eMkE7CuBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:38:45.405470Z","bundle_sha256":"df68a506a5d96441516c069576ce81369ba6c74dae37f73bb9668e2aef2d023e"}}