{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3RGR5HOCYBX6DSJOAP34S4YZKV","short_pith_number":"pith:3RGR5HOC","schema_version":"1.0","canonical_sha256":"dc4d1e9dc2c06fe1c92e03f7c973195564b149455de053f8bc9ab0fa21c561d0","source":{"kind":"arxiv","id":"1903.07557","version":1},"attestation_state":"computed","paper":{"title":"A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.AI","authors_text":"Dayong Shen, Fei-Yue Wang, Timo R. Nyberg, Xiuqin Shang","submitted_at":"2019-03-13T07:51:27Z","abstract_excerpt":"We study the fabric spreading and cutting problem in apparel factories. For the sake of saving the material costs, the cutting requirement should be met exactly without producing additional garment components. For reducing the production costs, the number of lays that corresponds to the frequency of using the cutting beds should be minimized. We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem. This algorithm contains a constructive procedure and an improving loop. Firstly the constructive procedure creates a set of lays in sequence, and then the improv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.07557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-13T07:51:27Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"7e82ff249714fd6a4935f37b4d06bd5dd5349452416812dcf90d358bf04ff9ec","abstract_canon_sha256":"27a0d45ab20362de4bf49af11083a45c29648fef4bdd6fd51a34916b01ca26d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.002541Z","signature_b64":"5wpQ19+Vwp6OqHXi+1fJ1RPJS4BwdPI36WpHz22PflJvaIDLwG1BvekLZk1GuXzNYgB7Gc+eu+On+CQEsUKjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc4d1e9dc2c06fe1c92e03f7c973195564b149455de053f8bc9ab0fa21c561d0","last_reissued_at":"2026-05-17T23:51:01.001958Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.001958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.AI","authors_text":"Dayong Shen, Fei-Yue Wang, Timo R. Nyberg, Xiuqin Shang","submitted_at":"2019-03-13T07:51:27Z","abstract_excerpt":"We study the fabric spreading and cutting problem in apparel factories. For the sake of saving the material costs, the cutting requirement should be met exactly without producing additional garment components. For reducing the production costs, the number of lays that corresponds to the frequency of using the cutting beds should be minimized. We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem. This algorithm contains a constructive procedure and an improving loop. Firstly the constructive procedure creates a set of lays in sequence, and then the improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07557","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.07557","created_at":"2026-05-17T23:51:01.002059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07557v1","created_at":"2026-05-17T23:51:01.002059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07557","created_at":"2026-05-17T23:51:01.002059+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RGR5HOCYBX6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RGR5HOCYBX6DSJO","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RGR5HOC","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV","json":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV.json","graph_json":"https://pith.science/api/pith-number/3RGR5HOCYBX6DSJOAP34S4YZKV/graph.json","events_json":"https://pith.science/api/pith-number/3RGR5HOCYBX6DSJOAP34S4YZKV/events.json","paper":"https://pith.science/paper/3RGR5HOC"},"agent_actions":{"view_html":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV","download_json":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV.json","view_paper":"https://pith.science/paper/3RGR5HOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07557&json=true","fetch_graph":"https://pith.science/api/pith-number/3RGR5HOCYBX6DSJOAP34S4YZKV/graph.json","fetch_events":"https://pith.science/api/pith-number/3RGR5HOCYBX6DSJOAP34S4YZKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV/action/storage_attestation","attest_author":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV/action/author_attestation","sign_citation":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV/action/citation_signature","submit_replication":"https://pith.science/pith/3RGR5HOCYBX6DSJOAP34S4YZKV/action/replication_record"}},"created_at":"2026-05-17T23:51:01.002059+00:00","updated_at":"2026-05-17T23:51:01.002059+00:00"}