{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:Z5VH4PU5DOQNGR2DAHHQ6OGSPR","short_pith_number":"pith:Z5VH4PU5","canonical_record":{"source":{"id":"2108.03024","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-06T09:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"ea88c2f245b119457d483468da3e14e6f02096ba87232292d50977e20d3e9ea4","abstract_canon_sha256":"a75239753b98bf9c22ff65bed9950c0e6fb0c06cca514d781cde0e4aa59b391a"},"schema_version":"1.0"},"canonical_sha256":"cf6a7e3e9d1ba0d3474301cf0f38d27c54f672cf8de5f161efd7498d4e72a0c4","source":{"kind":"arxiv","id":"2108.03024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.03024","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"2108.03024v1","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.03024","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"Z5VH4PU5DOQN","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"pith_short_16","alias_value":"Z5VH4PU5DOQNGR2D","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"pith_short_8","alias_value":"Z5VH4PU5","created_at":"2026-07-05T03:03:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:Z5VH4PU5DOQNGR2DAHHQ6OGSPR","target":"record","payload":{"canonical_record":{"source":{"id":"2108.03024","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-06T09:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"ea88c2f245b119457d483468da3e14e6f02096ba87232292d50977e20d3e9ea4","abstract_canon_sha256":"a75239753b98bf9c22ff65bed9950c0e6fb0c06cca514d781cde0e4aa59b391a"},"schema_version":"1.0"},"canonical_sha256":"cf6a7e3e9d1ba0d3474301cf0f38d27c54f672cf8de5f161efd7498d4e72a0c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:44.874871Z","signature_b64":"vOOa6Zgl5lNdCBUlJLdH06XbxQs2+brdiSZmcCvaZy8uGkrzZle8BTbK/xdBejC4yrxe+u+RkYJU9LVEv8UxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf6a7e3e9d1ba0d3474301cf0f38d27c54f672cf8de5f161efd7498d4e72a0c4","last_reissued_at":"2026-07-05T03:03:44.874449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:44.874449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.03024","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-05T03:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7D77FD3Ra7/DBZOtaF5LrLlG6U+os7dIi7b61sBcVzZXImm1RbYaztVf7T8H039fU7r4Oyvr9zeYXYjUofvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:27:59.231756Z"},"content_sha256":"c977ac48cd2748936dca7536ccabbe5c52d1cb9d22dca25b2257fa1a88712afd","schema_version":"1.0","event_id":"sha256:c977ac48cd2748936dca7536ccabbe5c52d1cb9d22dca25b2257fa1a88712afd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:Z5VH4PU5DOQNGR2DAHHQ6OGSPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An iterative exact algorithm for the weighted fair sequences problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Markus Sinnl","submitted_at":"2021-08-06T09:59:02Z","abstract_excerpt":"In this work, we present a new iterative exact solution algorithm for the weighted fair sequences problem, which is a recently introduced NP-hard sequencing problem with applications in diverse areas such as TV advertisement scheduling, periodic machine maintenance and real-time scheduling. In the problem we are given an upper bound on the allowed solution sequence length and a list of symbols. For each symbols, there is a positive weight and a number, which gives the minimum times the symbol has to occur in a feasible solution sequence. The goal is to find a feasible sequence, which minimizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.03024","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/2108.03024/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-05T03:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6a1LRBhVI1CcMaHsWz3I/J7y1VZB4rrxyIjQcr9kY3l8rICIur8NL1/zRjGvLOrTpYJC6mWXE7tFgCJSsMpPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:27:59.232294Z"},"content_sha256":"f89d245b7d04661fb49655b59c0dfb80c67f20dd2a3591adb01c5b0a79ccad7b","schema_version":"1.0","event_id":"sha256:f89d245b7d04661fb49655b59c0dfb80c67f20dd2a3591adb01c5b0a79ccad7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z5VH4PU5DOQNGR2DAHHQ6OGSPR/bundle.json","state_url":"https://pith.science/pith/Z5VH4PU5DOQNGR2DAHHQ6OGSPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z5VH4PU5DOQNGR2DAHHQ6OGSPR/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-21T03:27:59Z","links":{"resolver":"https://pith.science/pith/Z5VH4PU5DOQNGR2DAHHQ6OGSPR","bundle":"https://pith.science/pith/Z5VH4PU5DOQNGR2DAHHQ6OGSPR/bundle.json","state":"https://pith.science/pith/Z5VH4PU5DOQNGR2DAHHQ6OGSPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z5VH4PU5DOQNGR2DAHHQ6OGSPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:Z5VH4PU5DOQNGR2DAHHQ6OGSPR","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":"a75239753b98bf9c22ff65bed9950c0e6fb0c06cca514d781cde0e4aa59b391a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-06T09:59:02Z","title_canon_sha256":"ea88c2f245b119457d483468da3e14e6f02096ba87232292d50977e20d3e9ea4"},"schema_version":"1.0","source":{"id":"2108.03024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.03024","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"2108.03024v1","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.03024","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"Z5VH4PU5DOQN","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"pith_short_16","alias_value":"Z5VH4PU5DOQNGR2D","created_at":"2026-07-05T03:03:44Z"},{"alias_kind":"pith_short_8","alias_value":"Z5VH4PU5","created_at":"2026-07-05T03:03:44Z"}],"graph_snapshots":[{"event_id":"sha256:f89d245b7d04661fb49655b59c0dfb80c67f20dd2a3591adb01c5b0a79ccad7b","target":"graph","created_at":"2026-07-05T03:03:44Z","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/2108.03024/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we present a new iterative exact solution algorithm for the weighted fair sequences problem, which is a recently introduced NP-hard sequencing problem with applications in diverse areas such as TV advertisement scheduling, periodic machine maintenance and real-time scheduling. In the problem we are given an upper bound on the allowed solution sequence length and a list of symbols. For each symbols, there is a positive weight and a number, which gives the minimum times the symbol has to occur in a feasible solution sequence. The goal is to find a feasible sequence, which minimizes","authors_text":"Markus Sinnl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-06T09:59:02Z","title":"An iterative exact algorithm for the weighted fair sequences problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.03024","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:c977ac48cd2748936dca7536ccabbe5c52d1cb9d22dca25b2257fa1a88712afd","target":"record","created_at":"2026-07-05T03:03:44Z","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":"a75239753b98bf9c22ff65bed9950c0e6fb0c06cca514d781cde0e4aa59b391a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-06T09:59:02Z","title_canon_sha256":"ea88c2f245b119457d483468da3e14e6f02096ba87232292d50977e20d3e9ea4"},"schema_version":"1.0","source":{"id":"2108.03024","kind":"arxiv","version":1}},"canonical_sha256":"cf6a7e3e9d1ba0d3474301cf0f38d27c54f672cf8de5f161efd7498d4e72a0c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf6a7e3e9d1ba0d3474301cf0f38d27c54f672cf8de5f161efd7498d4e72a0c4","first_computed_at":"2026-07-05T03:03:44.874449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:03:44.874449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vOOa6Zgl5lNdCBUlJLdH06XbxQs2+brdiSZmcCvaZy8uGkrzZle8BTbK/xdBejC4yrxe+u+RkYJU9LVEv8UxDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:03:44.874871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.03024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c977ac48cd2748936dca7536ccabbe5c52d1cb9d22dca25b2257fa1a88712afd","sha256:f89d245b7d04661fb49655b59c0dfb80c67f20dd2a3591adb01c5b0a79ccad7b"],"state_sha256":"e1888416f7b7f261603debf20ec93095f7f64d84d1e6309e4e8633f6b01b2d97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tOEAuLdRTEoFI8SzAydSPGNb0mLME2ilieVlyWeRbqvydwV5wP2oNY+mMUqIhyTBPlcddAti6GFrbvmImnlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T03:27:59.238580Z","bundle_sha256":"007f4638454b61f0d684357aaebc05ba8080eeca04156bd771b43d202788bde0"}}