{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PADNCLZEB6LJR4SRD5INFJDBYV","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":"6be922aa1ea577e5cda8e3bcaa1622c0724fdea3ec7e32b8efc4ad7d0820e4c8","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-05T07:02:27Z","title_canon_sha256":"6cbf4259a9cd71ad6258c2ae091bb1f50c0ceedf1a97ee197bd3e5ce0b014a76"},"schema_version":"1.0","source":{"id":"2008.01960","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.01960","created_at":"2026-07-05T01:27:26Z"},{"alias_kind":"arxiv_version","alias_value":"2008.01960v3","created_at":"2026-07-05T01:27:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01960","created_at":"2026-07-05T01:27:26Z"},{"alias_kind":"pith_short_12","alias_value":"PADNCLZEB6LJ","created_at":"2026-07-05T01:27:26Z"},{"alias_kind":"pith_short_16","alias_value":"PADNCLZEB6LJR4SR","created_at":"2026-07-05T01:27:26Z"},{"alias_kind":"pith_short_8","alias_value":"PADNCLZE","created_at":"2026-07-05T01:27:26Z"}],"graph_snapshots":[{"event_id":"sha256:0030dd47e77453b85caaac0b9c541734a97b15ccb557820686ab07f236352665","target":"graph","created_at":"2026-07-05T01:27:26Z","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/2008.01960/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Process Planning and Scheduling (PPS) is an essential and practical topic but a very intractable problem in manufacturing systems. Many research use iterative methods to solve such problems; however, they cannot achieve satisfactory results in both quality and computational speed. Other studies formulate scheduling problems as a graph coloring problem (GCP) or its extensions, but these formulations are limited to certain types of scheduling problems. In this paper, we propose a novel approach to formulate a general type of the PPS problem with resource allocation and process planning integrate","authors_text":"Kai Sun","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-05T07:02:27Z","title":"A Novel Approach for the Process Planning and Scheduling Problem Using the Concept of Maximum Weighted Independent Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01960","kind":"arxiv","version":3},"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:46b68b6d4f662440241596806f4ba916638714612439bf43baaac448c55eba5f","target":"record","created_at":"2026-07-05T01:27:26Z","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":"6be922aa1ea577e5cda8e3bcaa1622c0724fdea3ec7e32b8efc4ad7d0820e4c8","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-08-05T07:02:27Z","title_canon_sha256":"6cbf4259a9cd71ad6258c2ae091bb1f50c0ceedf1a97ee197bd3e5ce0b014a76"},"schema_version":"1.0","source":{"id":"2008.01960","kind":"arxiv","version":3}},"canonical_sha256":"7806d12f240f9698f2511f50d2a461c554f7b46a6fd06fdd85e4c6896190c84f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7806d12f240f9698f2511f50d2a461c554f7b46a6fd06fdd85e4c6896190c84f","first_computed_at":"2026-07-05T01:27:26.444275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:27:26.444275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ji/RZ4HPUw8Guf3oJfzMQPDOGN4wlLdWjmAe5WSPm5ABdcZSemdDkN87h29PAreOX2d59UAKyy36RFARMAw8CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:27:26.444679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.01960","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46b68b6d4f662440241596806f4ba916638714612439bf43baaac448c55eba5f","sha256:0030dd47e77453b85caaac0b9c541734a97b15ccb557820686ab07f236352665"],"state_sha256":"0b2583c9e956505045f80dd1cee7be189a4e084d3d9b8c27116b8e5cf931ae1d"}