{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DCJBEPRX47RJU3KBPPLK46D66J","short_pith_number":"pith:DCJBEPRX","canonical_record":{"source":{"id":"2402.02328","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T03:03:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8a36e393728298ac82cd82de4e8b575664fdfa090736d314e2f7448bdd543163","abstract_canon_sha256":"c54e344490c0d8261338bf933063109664feb0e4957d6a604dc215e3cc9de6a3"},"schema_version":"1.0"},"canonical_sha256":"1892123e37e7e29a6d417bd6ae787ef25f81cc3791bcb3faf1e9088cc853f2ce","source":{"kind":"arxiv","id":"2402.02328","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02328","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02328v3","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02328","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"DCJBEPRX47RJ","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"pith_short_16","alias_value":"DCJBEPRX47RJU3KB","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"pith_short_8","alias_value":"DCJBEPRX","created_at":"2026-07-05T08:27:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DCJBEPRX47RJU3KBPPLK46D66J","target":"record","payload":{"canonical_record":{"source":{"id":"2402.02328","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T03:03:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8a36e393728298ac82cd82de4e8b575664fdfa090736d314e2f7448bdd543163","abstract_canon_sha256":"c54e344490c0d8261338bf933063109664feb0e4957d6a604dc215e3cc9de6a3"},"schema_version":"1.0"},"canonical_sha256":"1892123e37e7e29a6d417bd6ae787ef25f81cc3791bcb3faf1e9088cc853f2ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:03.200803Z","signature_b64":"TRz2FO0iTVkgcoAo8E3gtMCP720gTvdre2cWEc8NIS5ifIJ31qnu92kVoJ16tECmuur8S1rRU8QcJTfg0mYICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1892123e37e7e29a6d417bd6ae787ef25f81cc3791bcb3faf1e9088cc853f2ce","last_reissued_at":"2026-07-05T08:27:03.200376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:03.200376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.02328","source_version":3,"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-05T08:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmQHlBhfmot3zZq781ma7pwMBtxDR2dZiF0xSWYrRzpqoHgFWfpEa5XfdaMwTpV9Xm5AOExvNTXNeQ4EqySJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T20:40:21.829729Z"},"content_sha256":"7a2296c55a28b48ba958fccbd836e1c6311190129f89f4b1d80fbfca3e84f1a6","schema_version":"1.0","event_id":"sha256:7a2296c55a28b48ba958fccbd836e1c6311190129f89f4b1d80fbfca3e84f1a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DCJBEPRX47RJU3KBPPLK46D66J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Amitabh Basu, Barbara Fiedorowicz, Hongyu Cheng, Sammy Khalife","submitted_at":"2024-02-04T03:03:27Z","abstract_excerpt":"Data-driven algorithm design is a paradigm that uses statistical and machine learning techniques to select from a class of algorithms for a computational problem an algorithm that has the best expected performance with respect to some (unknown) distribution on the instances of the problem. We build upon recent work in this line of research by considering the setup where, instead of selecting a single algorithm that has the best performance, we allow the possibility of selecting an algorithm based on the instance to be solved, using neural networks. In particular, given a representative sample "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02328","kind":"arxiv","version":3},"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/2402.02328/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-05T08:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mOrSy130wIW8q6ubEeclG8liC/MGzyEsnfNP5KiMuYQ5ryyFDR/jZbRe4ftgP1jOnl8xqQItE4w6A+6/7QYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T20:40:21.830096Z"},"content_sha256":"0a92534a706002d02f4c7c1c24aa5ccb2a8fb95624b129c8b4c554725e852971","schema_version":"1.0","event_id":"sha256:0a92534a706002d02f4c7c1c24aa5ccb2a8fb95624b129c8b4c554725e852971"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCJBEPRX47RJU3KBPPLK46D66J/bundle.json","state_url":"https://pith.science/pith/DCJBEPRX47RJU3KBPPLK46D66J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCJBEPRX47RJU3KBPPLK46D66J/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-07-14T20:40:21Z","links":{"resolver":"https://pith.science/pith/DCJBEPRX47RJU3KBPPLK46D66J","bundle":"https://pith.science/pith/DCJBEPRX47RJU3KBPPLK46D66J/bundle.json","state":"https://pith.science/pith/DCJBEPRX47RJU3KBPPLK46D66J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCJBEPRX47RJU3KBPPLK46D66J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DCJBEPRX47RJU3KBPPLK46D66J","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":"c54e344490c0d8261338bf933063109664feb0e4957d6a604dc215e3cc9de6a3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T03:03:27Z","title_canon_sha256":"8a36e393728298ac82cd82de4e8b575664fdfa090736d314e2f7448bdd543163"},"schema_version":"1.0","source":{"id":"2402.02328","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.02328","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"2402.02328v3","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.02328","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"DCJBEPRX47RJ","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"pith_short_16","alias_value":"DCJBEPRX47RJU3KB","created_at":"2026-07-05T08:27:03Z"},{"alias_kind":"pith_short_8","alias_value":"DCJBEPRX","created_at":"2026-07-05T08:27:03Z"}],"graph_snapshots":[{"event_id":"sha256:0a92534a706002d02f4c7c1c24aa5ccb2a8fb95624b129c8b4c554725e852971","target":"graph","created_at":"2026-07-05T08:27:03Z","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/2402.02328/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Data-driven algorithm design is a paradigm that uses statistical and machine learning techniques to select from a class of algorithms for a computational problem an algorithm that has the best expected performance with respect to some (unknown) distribution on the instances of the problem. We build upon recent work in this line of research by considering the setup where, instead of selecting a single algorithm that has the best performance, we allow the possibility of selecting an algorithm based on the instance to be solved, using neural networks. In particular, given a representative sample ","authors_text":"Amitabh Basu, Barbara Fiedorowicz, Hongyu Cheng, Sammy Khalife","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T03:03:27Z","title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.02328","kind":"arxiv","version":3},"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:7a2296c55a28b48ba958fccbd836e1c6311190129f89f4b1d80fbfca3e84f1a6","target":"record","created_at":"2026-07-05T08:27:03Z","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":"c54e344490c0d8261338bf933063109664feb0e4957d6a604dc215e3cc9de6a3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T03:03:27Z","title_canon_sha256":"8a36e393728298ac82cd82de4e8b575664fdfa090736d314e2f7448bdd543163"},"schema_version":"1.0","source":{"id":"2402.02328","kind":"arxiv","version":3}},"canonical_sha256":"1892123e37e7e29a6d417bd6ae787ef25f81cc3791bcb3faf1e9088cc853f2ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1892123e37e7e29a6d417bd6ae787ef25f81cc3791bcb3faf1e9088cc853f2ce","first_computed_at":"2026-07-05T08:27:03.200376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:03.200376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TRz2FO0iTVkgcoAo8E3gtMCP720gTvdre2cWEc8NIS5ifIJ31qnu92kVoJ16tECmuur8S1rRU8QcJTfg0mYICQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:03.200803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.02328","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a2296c55a28b48ba958fccbd836e1c6311190129f89f4b1d80fbfca3e84f1a6","sha256:0a92534a706002d02f4c7c1c24aa5ccb2a8fb95624b129c8b4c554725e852971"],"state_sha256":"d6121c1534e51f62bf650f9af338ff8a4cbab82f8726f947a7834f9929af8214"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PxBCDhHPaC90Bd5IAYQV9gahVhtHDztixUxV+snxyb+qpiosCYB85OkLOmpecAff4F4/xcvuUeVriKSYxt9lDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T20:40:21.832251Z","bundle_sha256":"b9bacc336c073e1516b2b40653ba2081f67d9e2b2655ac907259c130218f55cf"}}