{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QBASRGN7UVGT3ZZVNWGLNMHIRH","short_pith_number":"pith:QBASRGN7","schema_version":"1.0","canonical_sha256":"80412899bfa54d3de7356d8cb6b0e889d12cc7c1168c60e017293d4888704b24","source":{"kind":"arxiv","id":"1908.07584","version":1},"attestation_state":"computed","paper":{"title":"Optimization Bounds from the Branching Dual","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. G. Benade, J. N. Hooker","submitted_at":"2019-08-20T19:45:46Z","abstract_excerpt":"We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with the minimum bandwidth problem. The method strengthens a known bound for a given problem by formulating a dual problem whose feasible solutions are partial branching trees. It solves the dual problem with a \"worst-bound\" local search heuristic that explores neighboring partial trees. After proving some optimality properties of the heuristic, we show that it "},"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":"1908.07584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-20T19:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"2b0642e77af2f2ed3ab7c4dc4d766dc4fdf81fdacfb42af4e1238ec6d3b698a2","abstract_canon_sha256":"df68829a41f1fff49714f361c574ee55c641da0f8fd0fcc0e1a4a061a8a1a0ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:59.383860Z","signature_b64":"gAjMK3GLLukMS2IWENcSVSyidTH3QseyOUHYPwUkyZV9ZlUOK3XW0e+q1y0o0bFBJouTI1yD46hQ/oJox7OZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80412899bfa54d3de7356d8cb6b0e889d12cc7c1168c60e017293d4888704b24","last_reissued_at":"2026-07-04T23:58:59.383515Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:59.383515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization Bounds from the Branching Dual","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. G. Benade, J. N. Hooker","submitted_at":"2019-08-20T19:45:46Z","abstract_excerpt":"We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with the minimum bandwidth problem. The method strengthens a known bound for a given problem by formulating a dual problem whose feasible solutions are partial branching trees. It solves the dual problem with a \"worst-bound\" local search heuristic that explores neighboring partial trees. After proving some optimality properties of the heuristic, we show that it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07584","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.07584/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.07584","created_at":"2026-07-04T23:58:59.383573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07584v1","created_at":"2026-07-04T23:58:59.383573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07584","created_at":"2026-07-04T23:58:59.383573+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBASRGN7UVGT","created_at":"2026-07-04T23:58:59.383573+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBASRGN7UVGT3ZZV","created_at":"2026-07-04T23:58:59.383573+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBASRGN7","created_at":"2026-07-04T23:58:59.383573+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/QBASRGN7UVGT3ZZVNWGLNMHIRH","json":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH.json","graph_json":"https://pith.science/api/pith-number/QBASRGN7UVGT3ZZVNWGLNMHIRH/graph.json","events_json":"https://pith.science/api/pith-number/QBASRGN7UVGT3ZZVNWGLNMHIRH/events.json","paper":"https://pith.science/paper/QBASRGN7"},"agent_actions":{"view_html":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH","download_json":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH.json","view_paper":"https://pith.science/paper/QBASRGN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07584&json=true","fetch_graph":"https://pith.science/api/pith-number/QBASRGN7UVGT3ZZVNWGLNMHIRH/graph.json","fetch_events":"https://pith.science/api/pith-number/QBASRGN7UVGT3ZZVNWGLNMHIRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH/action/storage_attestation","attest_author":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH/action/author_attestation","sign_citation":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH/action/citation_signature","submit_replication":"https://pith.science/pith/QBASRGN7UVGT3ZZVNWGLNMHIRH/action/replication_record"}},"created_at":"2026-07-04T23:58:59.383573+00:00","updated_at":"2026-07-04T23:58:59.383573+00:00"}