{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7QFHYNT7KBD25ZS2AN4HOPUHCQ","short_pith_number":"pith:7QFHYNT7","schema_version":"1.0","canonical_sha256":"fc0a7c367f5047aee65a0378773e87142a33183b8e7b2d1914afb806b82cc30a","source":{"kind":"arxiv","id":"2104.10025","version":1},"attestation_state":"computed","paper":{"title":"Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Stephen J. Maher, Ted K. Ralphs, Yuji Shinano","submitted_at":"2021-04-19T01:53:17Z","abstract_excerpt":"Empirical studies are fundamental in assessing the effectiveness of implementations of branch-and-bound algorithms. The complexity of such implementations makes empirical study difficult for a wide variety of reasons. Various attempts have been made to develop and codify a set of standard techniques for the assessment of optimization algorithms and their software implementations; however, most previous work has been focused on classical sequential algorithms. Since parallel computation has become increasingly mainstream, it is necessary to re-examine and modernize these practices. In this pape"},"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":"2104.10025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-04-19T01:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"a773b73823f0d80db1d489f26708c8e0b845ca885edeb8b2ddf43c9a3810005c","abstract_canon_sha256":"7e087616871d274ed78456e12781ff066bbcc4837d7f04b6924f15507c58db4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:39.322960Z","signature_b64":"dRmnUX/uGcIHvoS1Nlm4Sy21ISFWA71gquaUP99Df89qfWZiryNhanECwuUEPbQSwVOBGYG7LMQqgsmXLEtNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc0a7c367f5047aee65a0378773e87142a33183b8e7b2d1914afb806b82cc30a","last_reissued_at":"2026-07-05T02:33:39.322549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:39.322549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Stephen J. Maher, Ted K. Ralphs, Yuji Shinano","submitted_at":"2021-04-19T01:53:17Z","abstract_excerpt":"Empirical studies are fundamental in assessing the effectiveness of implementations of branch-and-bound algorithms. The complexity of such implementations makes empirical study difficult for a wide variety of reasons. Various attempts have been made to develop and codify a set of standard techniques for the assessment of optimization algorithms and their software implementations; however, most previous work has been focused on classical sequential algorithms. Since parallel computation has become increasingly mainstream, it is necessary to re-examine and modernize these practices. In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.10025","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/2104.10025/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":"2104.10025","created_at":"2026-07-05T02:33:39.322614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.10025v1","created_at":"2026-07-05T02:33:39.322614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.10025","created_at":"2026-07-05T02:33:39.322614+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QFHYNT7KBD2","created_at":"2026-07-05T02:33:39.322614+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QFHYNT7KBD25ZS2","created_at":"2026-07-05T02:33:39.322614+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QFHYNT7","created_at":"2026-07-05T02:33:39.322614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18278","citing_title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ","json":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ.json","graph_json":"https://pith.science/api/pith-number/7QFHYNT7KBD25ZS2AN4HOPUHCQ/graph.json","events_json":"https://pith.science/api/pith-number/7QFHYNT7KBD25ZS2AN4HOPUHCQ/events.json","paper":"https://pith.science/paper/7QFHYNT7"},"agent_actions":{"view_html":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ","download_json":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ.json","view_paper":"https://pith.science/paper/7QFHYNT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.10025&json=true","fetch_graph":"https://pith.science/api/pith-number/7QFHYNT7KBD25ZS2AN4HOPUHCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7QFHYNT7KBD25ZS2AN4HOPUHCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ/action/storage_attestation","attest_author":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ/action/author_attestation","sign_citation":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ/action/citation_signature","submit_replication":"https://pith.science/pith/7QFHYNT7KBD25ZS2AN4HOPUHCQ/action/replication_record"}},"created_at":"2026-07-05T02:33:39.322614+00:00","updated_at":"2026-07-05T02:33:39.322614+00:00"}