{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:USVSARHDL2IJP5L7BAMDNMZQRJ","short_pith_number":"pith:USVSARHD","canonical_record":{"source":{"id":"1405.5988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-23T08:48:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aeffdfd0ac18d8b7d08157acb4229a4115f3403d0f4754587a4e6d8c9829baef","abstract_canon_sha256":"164ef812f95e3b9cadeaa0ba6bc0ca94d925a3cc0d19302359072cd9c4c5a2d3"},"schema_version":"1.0"},"canonical_sha256":"a4ab2044e35e9097f57f081836b3308a61d7a01aec2616850408d6fb07d86c07","source":{"kind":"arxiv","id":"1405.5988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5988","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5988v1","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5988","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"USVSARHDL2IJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"USVSARHDL2IJP5L7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"USVSARHD","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:USVSARHDL2IJP5L7BAMDNMZQRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-23T08:48:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"aeffdfd0ac18d8b7d08157acb4229a4115f3403d0f4754587a4e6d8c9829baef","abstract_canon_sha256":"164ef812f95e3b9cadeaa0ba6bc0ca94d925a3cc0d19302359072cd9c4c5a2d3"},"schema_version":"1.0"},"canonical_sha256":"a4ab2044e35e9097f57f081836b3308a61d7a01aec2616850408d6fb07d86c07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:52.167391Z","signature_b64":"ads2pxRs06Ttc3Wq+kLkm0/gYuN/wfQDZd9TJ11dCF+pFtcR4YKvrAY8uZOqjhhLN8X13mbiO7Xlo7kIV1MBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ab2044e35e9097f57f081836b3308a61d7a01aec2616850408d6fb07d86c07","last_reissued_at":"2026-05-18T02:17:52.166791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:52.166791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5988","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-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLogB/o7f8jLq59HRWpbR/fK0Rd8PPufRfTUUq0hTh/4haLdwXVCIjzORxNhmMkr7RNdWnUo1KeFW4rVOkbcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:11:10.919164Z"},"content_sha256":"27afc1b527451f3499a867bf43eda63f5abc0891215d9eeb20802c491f53cbd4","schema_version":"1.0","event_id":"sha256:27afc1b527451f3499a867bf43eda63f5abc0891215d9eeb20802c491f53cbd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:USVSARHDL2IJP5L7BAMDNMZQRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal proper non-IRUP instances of the one-dimensional Cutting Stock Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz, Vadim M. Kartak","submitted_at":"2014-05-23T08:48:13Z","abstract_excerpt":"We consider the well-known one dimensional cutting stock problem (1CSP). Based on the pattern structure of the classical ILP formulation of Gilmore and Gomory, we can decompose the infinite set of 1CSP instances, with a fixed demand n, into a finite number of equivalence classes. We show up a strong relation to weighted simple games. Studying the integer round-up property we computationally show that all 1CSP instances with $n\\le 9$ are proper IRUP, while we give examples of a proper non-IRUP instances with $n=10$. A gap larger than 1 occurs for $n=11$. The worst known gap is raised from 1.003"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5988","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-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rn+XAPCRk4wK51ZNIJj8RbDBMH0sI2yhP0SI3Q/7awjoIkn1MLW01vKvJDe9tV2oEE+BohIZo+ITwSoE0ERrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:11:10.919922Z"},"content_sha256":"bd3550747ec1dd7a0313fdbf47ea36af65f922b8991bc48f12efc2bfd6d490fa","schema_version":"1.0","event_id":"sha256:bd3550747ec1dd7a0313fdbf47ea36af65f922b8991bc48f12efc2bfd6d490fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USVSARHDL2IJP5L7BAMDNMZQRJ/bundle.json","state_url":"https://pith.science/pith/USVSARHDL2IJP5L7BAMDNMZQRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USVSARHDL2IJP5L7BAMDNMZQRJ/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-05-25T16:11:10Z","links":{"resolver":"https://pith.science/pith/USVSARHDL2IJP5L7BAMDNMZQRJ","bundle":"https://pith.science/pith/USVSARHDL2IJP5L7BAMDNMZQRJ/bundle.json","state":"https://pith.science/pith/USVSARHDL2IJP5L7BAMDNMZQRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USVSARHDL2IJP5L7BAMDNMZQRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:USVSARHDL2IJP5L7BAMDNMZQRJ","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":"164ef812f95e3b9cadeaa0ba6bc0ca94d925a3cc0d19302359072cd9c4c5a2d3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-23T08:48:13Z","title_canon_sha256":"aeffdfd0ac18d8b7d08157acb4229a4115f3403d0f4754587a4e6d8c9829baef"},"schema_version":"1.0","source":{"id":"1405.5988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5988","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5988v1","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5988","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"USVSARHDL2IJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"USVSARHDL2IJP5L7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"USVSARHD","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:bd3550747ec1dd7a0313fdbf47ea36af65f922b8991bc48f12efc2bfd6d490fa","target":"graph","created_at":"2026-05-18T02:17:52Z","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 consider the well-known one dimensional cutting stock problem (1CSP). Based on the pattern structure of the classical ILP formulation of Gilmore and Gomory, we can decompose the infinite set of 1CSP instances, with a fixed demand n, into a finite number of equivalence classes. We show up a strong relation to weighted simple games. Studying the integer round-up property we computationally show that all 1CSP instances with $n\\le 9$ are proper IRUP, while we give examples of a proper non-IRUP instances with $n=10$. A gap larger than 1 occurs for $n=11$. The worst known gap is raised from 1.003","authors_text":"Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz, Vadim M. Kartak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-23T08:48:13Z","title":"Minimal proper non-IRUP instances of the one-dimensional Cutting Stock Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5988","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:27afc1b527451f3499a867bf43eda63f5abc0891215d9eeb20802c491f53cbd4","target":"record","created_at":"2026-05-18T02:17:52Z","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":"164ef812f95e3b9cadeaa0ba6bc0ca94d925a3cc0d19302359072cd9c4c5a2d3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-23T08:48:13Z","title_canon_sha256":"aeffdfd0ac18d8b7d08157acb4229a4115f3403d0f4754587a4e6d8c9829baef"},"schema_version":"1.0","source":{"id":"1405.5988","kind":"arxiv","version":1}},"canonical_sha256":"a4ab2044e35e9097f57f081836b3308a61d7a01aec2616850408d6fb07d86c07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4ab2044e35e9097f57f081836b3308a61d7a01aec2616850408d6fb07d86c07","first_computed_at":"2026-05-18T02:17:52.166791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:52.166791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ads2pxRs06Ttc3Wq+kLkm0/gYuN/wfQDZd9TJ11dCF+pFtcR4YKvrAY8uZOqjhhLN8X13mbiO7Xlo7kIV1MBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:52.167391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27afc1b527451f3499a867bf43eda63f5abc0891215d9eeb20802c491f53cbd4","sha256:bd3550747ec1dd7a0313fdbf47ea36af65f922b8991bc48f12efc2bfd6d490fa"],"state_sha256":"4ffe01f8e044797204a763df0025d6169cb7fdcd3467f6eb8faf2c40ec05a79f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jM7aUW1dzIbjAcTJO9RSAup8qqDO02E63j52HSzl5VdzKjJiFky429lfGn0RlW/Pl3kNr0SE6KEwMa9zc4OuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:11:10.923667Z","bundle_sha256":"049f42f9a55d9c61c3f52b72700ec10fff636d76521f27696bd84d7761ad11f8"}}