{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G3JK2V7KS4PIXUOPBP36ABLMLR","short_pith_number":"pith:G3JK2V7K","canonical_record":{"source":{"id":"1809.01773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T00:39:12Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"571299fff26c539a6e362b95f37e7e132e1dc23cbc1c45f1d1978073141b877b","abstract_canon_sha256":"08602518570ea38cc20af5515ce7d407cb1d1448f190ab5746e9125c9e3ea718"},"schema_version":"1.0"},"canonical_sha256":"36d2ad57ea971e8bd1cf0bf7e0056c5c5cdae821b25a67f5dd286bf8b9e7da89","source":{"kind":"arxiv","id":"1809.01773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01773","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01773v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01773","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"G3JK2V7KS4PI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G3JK2V7KS4PIXUOP","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G3JK2V7K","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G3JK2V7KS4PIXUOPBP36ABLMLR","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T00:39:12Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"571299fff26c539a6e362b95f37e7e132e1dc23cbc1c45f1d1978073141b877b","abstract_canon_sha256":"08602518570ea38cc20af5515ce7d407cb1d1448f190ab5746e9125c9e3ea718"},"schema_version":"1.0"},"canonical_sha256":"36d2ad57ea971e8bd1cf0bf7e0056c5c5cdae821b25a67f5dd286bf8b9e7da89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.928918Z","signature_b64":"s+R3UpfXYY/GxRsvb+RjNQ2k8WmQAfedB9fhVHsOXLIkvhOzNX/I1wB/AcA+6PO86nh/Iif9dFDFPMCggpkZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36d2ad57ea971e8bd1cf0bf7e0056c5c5cdae821b25a67f5dd286bf8b9e7da89","last_reissued_at":"2026-05-18T00:06:21.928415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.928415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01773","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-18T00:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yWAdRSQZFhzIcuXQsDEc8jnBA9YTHbb1wz5Cz0qr0YArkgfr5Kpa9HjOyLPMOhP6UHft13xdBuV09mJkyOUrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:06:26.970297Z"},"content_sha256":"6bbac7b049d8196903ab487332a10b3e4ae50dddde8d232d3d9dfe7fec77a25b","schema_version":"1.0","event_id":"sha256:6bbac7b049d8196903ab487332a10b3e4ae50dddde8d232d3d9dfe7fec77a25b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G3JK2V7KS4PIXUOPBP36ABLMLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight MIP formulations for bounded length cyclic sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Hamish Waterer, Thomas Kalinowski, Tomas Lid\\'en","submitted_at":"2018-09-06T00:39:12Z","abstract_excerpt":"We study cyclic binary strings with bounds on the lengths of the intervals of consecutive ones and zeros. This is motivated by scheduling problems where such binary strings can be used to represent the state (on/off) of a machine. In this context the bounds correspond to minimum and maximum lengths of on- or off-intervals, and cyclic strings can be used to model periodic schedules. Extending results for non-cyclic strings is not straight forward. We present a non-trivial tight compact extended network flow formulation, as well as valid inequalities in the space of the state and start-up variab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01773","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-18T00:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJ1YOhRUvXOH0VjcdPzeAxVRxYUAMInc8LxFNMuShmJgZAnI3Lsn+oZ9bl+pm5FCYc5Rqa6VNeA4vLFjWXNFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:06:26.970945Z"},"content_sha256":"955c41b7b66fbc61472285545bdd64808e817e8b1aefde37db532f883a94da7c","schema_version":"1.0","event_id":"sha256:955c41b7b66fbc61472285545bdd64808e817e8b1aefde37db532f883a94da7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3JK2V7KS4PIXUOPBP36ABLMLR/bundle.json","state_url":"https://pith.science/pith/G3JK2V7KS4PIXUOPBP36ABLMLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3JK2V7KS4PIXUOPBP36ABLMLR/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-06-07T21:06:26Z","links":{"resolver":"https://pith.science/pith/G3JK2V7KS4PIXUOPBP36ABLMLR","bundle":"https://pith.science/pith/G3JK2V7KS4PIXUOPBP36ABLMLR/bundle.json","state":"https://pith.science/pith/G3JK2V7KS4PIXUOPBP36ABLMLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3JK2V7KS4PIXUOPBP36ABLMLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G3JK2V7KS4PIXUOPBP36ABLMLR","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":"08602518570ea38cc20af5515ce7d407cb1d1448f190ab5746e9125c9e3ea718","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T00:39:12Z","title_canon_sha256":"571299fff26c539a6e362b95f37e7e132e1dc23cbc1c45f1d1978073141b877b"},"schema_version":"1.0","source":{"id":"1809.01773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01773","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01773v1","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01773","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"G3JK2V7KS4PI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G3JK2V7KS4PIXUOP","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G3JK2V7K","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:955c41b7b66fbc61472285545bdd64808e817e8b1aefde37db532f883a94da7c","target":"graph","created_at":"2026-05-18T00:06:21Z","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 study cyclic binary strings with bounds on the lengths of the intervals of consecutive ones and zeros. This is motivated by scheduling problems where such binary strings can be used to represent the state (on/off) of a machine. In this context the bounds correspond to minimum and maximum lengths of on- or off-intervals, and cyclic strings can be used to model periodic schedules. Extending results for non-cyclic strings is not straight forward. We present a non-trivial tight compact extended network flow formulation, as well as valid inequalities in the space of the state and start-up variab","authors_text":"Hamish Waterer, Thomas Kalinowski, Tomas Lid\\'en","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T00:39:12Z","title":"Tight MIP formulations for bounded length cyclic sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01773","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:6bbac7b049d8196903ab487332a10b3e4ae50dddde8d232d3d9dfe7fec77a25b","target":"record","created_at":"2026-05-18T00:06:21Z","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":"08602518570ea38cc20af5515ce7d407cb1d1448f190ab5746e9125c9e3ea718","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-06T00:39:12Z","title_canon_sha256":"571299fff26c539a6e362b95f37e7e132e1dc23cbc1c45f1d1978073141b877b"},"schema_version":"1.0","source":{"id":"1809.01773","kind":"arxiv","version":1}},"canonical_sha256":"36d2ad57ea971e8bd1cf0bf7e0056c5c5cdae821b25a67f5dd286bf8b9e7da89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36d2ad57ea971e8bd1cf0bf7e0056c5c5cdae821b25a67f5dd286bf8b9e7da89","first_computed_at":"2026-05-18T00:06:21.928415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.928415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s+R3UpfXYY/GxRsvb+RjNQ2k8WmQAfedB9fhVHsOXLIkvhOzNX/I1wB/AcA+6PO86nh/Iif9dFDFPMCggpkZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.928918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bbac7b049d8196903ab487332a10b3e4ae50dddde8d232d3d9dfe7fec77a25b","sha256:955c41b7b66fbc61472285545bdd64808e817e8b1aefde37db532f883a94da7c"],"state_sha256":"36ece0c0273a83694cd93f0c49b8074c3ea519fcb3ec1c98f81f43224e58e5f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lffGhntdqVtcfpxquDFTwe2f9sgZTiW8wlL3GYCDUHEdQT6OVHZ8Dk3JAivzBOor8Z0WTpiWRAevidTS8To2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:06:26.974891Z","bundle_sha256":"231b50fd0026faa1951b27fc29476620cce93be22ddd71bb1471a3816f0ef3e7"}}