{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YVXOHHYGRL7RFHEVTINOLGV6BG","short_pith_number":"pith:YVXOHHYG","canonical_record":{"source":{"id":"1908.07076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T21:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"da3914ea82a0718abacf4922ddf04edbb60eacd7429e387cfe29beec5c6d936b","abstract_canon_sha256":"195ecd145e8ccccf95a44bbcb4751f0918bd14c7eed06c1a5d02f5511fc34164"},"schema_version":"1.0"},"canonical_sha256":"c56ee39f068aff129c959a1ae59abe09801b578439a716aeb018de93bb033265","source":{"kind":"arxiv","id":"1908.07076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07076","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07076v1","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07076","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"pith_short_12","alias_value":"YVXOHHYGRL7R","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"pith_short_16","alias_value":"YVXOHHYGRL7RFHEV","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"pith_short_8","alias_value":"YVXOHHYG","created_at":"2026-07-04T23:58:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YVXOHHYGRL7RFHEVTINOLGV6BG","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T21:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"da3914ea82a0718abacf4922ddf04edbb60eacd7429e387cfe29beec5c6d936b","abstract_canon_sha256":"195ecd145e8ccccf95a44bbcb4751f0918bd14c7eed06c1a5d02f5511fc34164"},"schema_version":"1.0"},"canonical_sha256":"c56ee39f068aff129c959a1ae59abe09801b578439a716aeb018de93bb033265","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:30.605289Z","signature_b64":"A+2/+q+klDbrEUJAsI+6Uswo7kInDZt8prr4wwFkNNLXkS0+wYppTcEYYtZjrocImLudWrymY5PZcf9T1FdkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56ee39f068aff129c959a1ae59abe09801b578439a716aeb018de93bb033265","last_reissued_at":"2026-07-04T23:58:30.604872Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:30.604872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07076","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-04T23:58:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkyXBUdIVZ+FE5UosXmjBuAvy9h+bxETuXpl/qwpefdIrLozuqyCE9phXH6h2VwKiZTrS+d8aDA5aw16br8AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:20:40.077479Z"},"content_sha256":"54e6f44383e5255d07a883483fdd3469fbc629f533d00e460956e7a3fe06e59c","schema_version":"1.0","event_id":"sha256:54e6f44383e5255d07a883483fdd3469fbc629f533d00e460956e7a3fe06e59c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YVXOHHYGRL7RFHEVTINOLGV6BG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Job sequencing Bounds from Decision Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. N. Hooker","submitted_at":"2019-08-19T21:29:04Z","abstract_excerpt":"We introduce a general method for relaxing decision diagrams that allows one to bound job sequencing problems by solving a Lagrangian dual problem on a relaxed diagram. We also provide guidelines for identifying problems for which this approach can result in useful bounds. These same guidelines can be applied to bounding deterministic dynamic programming problems in general, since decision diagrams rely on DP formulations. Computational tests show that \\mbox{Lagrangian} relaxation on a decision diagram can yield very tight bounds for certain classes of hard job sequencing problems. For example"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07076","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/1908.07076/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-04T23:58:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bPBvcQwFxV4zYRb8Faty4u5UjSHitM0DUSTdAUTiLgRxsQLr49sKL780jR998XnIXlpG+BUA59mDyMDOJUoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:20:40.077968Z"},"content_sha256":"113eb495fca26f32f871447b51f44790b9a2361450c77a227dcd316f70856558","schema_version":"1.0","event_id":"sha256:113eb495fca26f32f871447b51f44790b9a2361450c77a227dcd316f70856558"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVXOHHYGRL7RFHEVTINOLGV6BG/bundle.json","state_url":"https://pith.science/pith/YVXOHHYGRL7RFHEVTINOLGV6BG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVXOHHYGRL7RFHEVTINOLGV6BG/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-16T13:20:40Z","links":{"resolver":"https://pith.science/pith/YVXOHHYGRL7RFHEVTINOLGV6BG","bundle":"https://pith.science/pith/YVXOHHYGRL7RFHEVTINOLGV6BG/bundle.json","state":"https://pith.science/pith/YVXOHHYGRL7RFHEVTINOLGV6BG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVXOHHYGRL7RFHEVTINOLGV6BG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YVXOHHYGRL7RFHEVTINOLGV6BG","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":"195ecd145e8ccccf95a44bbcb4751f0918bd14c7eed06c1a5d02f5511fc34164","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T21:29:04Z","title_canon_sha256":"da3914ea82a0718abacf4922ddf04edbb60eacd7429e387cfe29beec5c6d936b"},"schema_version":"1.0","source":{"id":"1908.07076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07076","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07076v1","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07076","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"pith_short_12","alias_value":"YVXOHHYGRL7R","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"pith_short_16","alias_value":"YVXOHHYGRL7RFHEV","created_at":"2026-07-04T23:58:30Z"},{"alias_kind":"pith_short_8","alias_value":"YVXOHHYG","created_at":"2026-07-04T23:58:30Z"}],"graph_snapshots":[{"event_id":"sha256:113eb495fca26f32f871447b51f44790b9a2361450c77a227dcd316f70856558","target":"graph","created_at":"2026-07-04T23:58:30Z","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/1908.07076/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a general method for relaxing decision diagrams that allows one to bound job sequencing problems by solving a Lagrangian dual problem on a relaxed diagram. We also provide guidelines for identifying problems for which this approach can result in useful bounds. These same guidelines can be applied to bounding deterministic dynamic programming problems in general, since decision diagrams rely on DP formulations. Computational tests show that \\mbox{Lagrangian} relaxation on a decision diagram can yield very tight bounds for certain classes of hard job sequencing problems. For example","authors_text":"J. N. Hooker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T21:29:04Z","title":"Improved Job sequencing Bounds from Decision Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07076","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:54e6f44383e5255d07a883483fdd3469fbc629f533d00e460956e7a3fe06e59c","target":"record","created_at":"2026-07-04T23:58:30Z","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":"195ecd145e8ccccf95a44bbcb4751f0918bd14c7eed06c1a5d02f5511fc34164","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T21:29:04Z","title_canon_sha256":"da3914ea82a0718abacf4922ddf04edbb60eacd7429e387cfe29beec5c6d936b"},"schema_version":"1.0","source":{"id":"1908.07076","kind":"arxiv","version":1}},"canonical_sha256":"c56ee39f068aff129c959a1ae59abe09801b578439a716aeb018de93bb033265","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c56ee39f068aff129c959a1ae59abe09801b578439a716aeb018de93bb033265","first_computed_at":"2026-07-04T23:58:30.604872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:30.604872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A+2/+q+klDbrEUJAsI+6Uswo7kInDZt8prr4wwFkNNLXkS0+wYppTcEYYtZjrocImLudWrymY5PZcf9T1FdkAw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:30.605289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54e6f44383e5255d07a883483fdd3469fbc629f533d00e460956e7a3fe06e59c","sha256:113eb495fca26f32f871447b51f44790b9a2361450c77a227dcd316f70856558"],"state_sha256":"7dbe26c4a7a02010e9c1c9a3c4aa9fe6e2432e6de3072c58855f26b926a4bef9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcsgLA8k9q7e6VRdiNftL0pQbKJh9VTu3GSQ2PCBmWJ3nGCRVl++gTFO4hxMhrS4KOmM0EnjA7GlUxWONjdwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:20:40.081332Z","bundle_sha256":"e3ad22c515a6ca1d5e6059e0570a8da7498f2458f758ff6acb0dd47204d1d322"}}