{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HZUYPNP43NCWSS5B2UFVZGZI4C","short_pith_number":"pith:HZUYPNP4","canonical_record":{"source":{"id":"1811.03031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:33:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7c3829d9ce73da605c187b3c5e30f212b8c4dea074bded85253e4e921dc7a303","abstract_canon_sha256":"f7756dc17a4cd3c135806176d56452b7d8eb578b011452240c3c9ea6e923e924"},"schema_version":"1.0"},"canonical_sha256":"3e6987b5fcdb45694ba1d50b5c9b28e0b60b8d59a4f60e33bda7dd23b83a6123","source":{"kind":"arxiv","id":"1811.03031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03031","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03031v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03031","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"HZUYPNP43NCW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZUYPNP43NCWSS5B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZUYPNP4","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HZUYPNP43NCWSS5B2UFVZGZI4C","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:33:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7c3829d9ce73da605c187b3c5e30f212b8c4dea074bded85253e4e921dc7a303","abstract_canon_sha256":"f7756dc17a4cd3c135806176d56452b7d8eb578b011452240c3c9ea6e923e924"},"schema_version":"1.0"},"canonical_sha256":"3e6987b5fcdb45694ba1d50b5c9b28e0b60b8d59a4f60e33bda7dd23b83a6123","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.094324Z","signature_b64":"yfqIt4R95jnknBt/iWNpnReFS64a3uaaa2oWykvx+v5hgbpctJeWv8zTbfdn3ncLYtDwtey+5yRSHKrAr7uwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e6987b5fcdb45694ba1d50b5c9b28e0b60b8d59a4f60e33bda7dd23b83a6123","last_reissued_at":"2026-05-18T00:01:20.093727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.093727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03031","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-05-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3cmQXMMIcfiwGpjEx1vYN44VP3iK/4uzAizODTkuQc5KXm8MJ+STLHU1ybGUe2sV1VS9dMjYmdQCSWHU8KTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:33:06.878188Z"},"content_sha256":"f80c8dfc78818400cd81a455cafa9cbe3635aec840294d0445a2e01369e65a57","schema_version":"1.0","event_id":"sha256:f80c8dfc78818400cd81a455cafa9cbe3635aec840294d0445a2e01369e65a57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HZUYPNP43NCWSS5B2UFVZGZI4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Aleksandr Maksimenko","submitted_at":"2018-11-07T17:33:26Z","abstract_excerpt":"In this paper, we consider the notion of a direct type algorithm introduced by V.A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties. Until recently, it was thought that the class of direct type algorithms is wide and includes many classical combinatorial algorithms, including the branch and bound algorithm for the traveling salesman problem, proposed by J.D.C. Little, K.G. Murty, D.W. Sweeney, C. Karel in 1963. We show that this algorithm is not a direct type algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03031","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":""},"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-05-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTeYsA5YR0/GVJf03U1ZL5LAzkowGBVF81Sb8hnhTYvqHokIm9F91hiyp3PT//THBzivzibx42wPHCWjt2GKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:33:06.878547Z"},"content_sha256":"299e70db164bfc258674e4e0fd36d648f559188f5d144e54064f8d10bc6b242d","schema_version":"1.0","event_id":"sha256:299e70db164bfc258674e4e0fd36d648f559188f5d144e54064f8d10bc6b242d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZUYPNP43NCWSS5B2UFVZGZI4C/bundle.json","state_url":"https://pith.science/pith/HZUYPNP43NCWSS5B2UFVZGZI4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZUYPNP43NCWSS5B2UFVZGZI4C/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-06-05T16:33:06Z","links":{"resolver":"https://pith.science/pith/HZUYPNP43NCWSS5B2UFVZGZI4C","bundle":"https://pith.science/pith/HZUYPNP43NCWSS5B2UFVZGZI4C/bundle.json","state":"https://pith.science/pith/HZUYPNP43NCWSS5B2UFVZGZI4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZUYPNP43NCWSS5B2UFVZGZI4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HZUYPNP43NCWSS5B2UFVZGZI4C","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":"f7756dc17a4cd3c135806176d56452b7d8eb578b011452240c3c9ea6e923e924","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:33:26Z","title_canon_sha256":"7c3829d9ce73da605c187b3c5e30f212b8c4dea074bded85253e4e921dc7a303"},"schema_version":"1.0","source":{"id":"1811.03031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03031","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03031v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03031","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"HZUYPNP43NCW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HZUYPNP43NCWSS5B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HZUYPNP4","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:299e70db164bfc258674e4e0fd36d648f559188f5d144e54064f8d10bc6b242d","target":"graph","created_at":"2026-05-18T00:01:20Z","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"},"paper":{"abstract_excerpt":"In this paper, we consider the notion of a direct type algorithm introduced by V.A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properties. Until recently, it was thought that the class of direct type algorithms is wide and includes many classical combinatorial algorithms, including the branch and bound algorithm for the traveling salesman problem, proposed by J.D.C. Little, K.G. Murty, D.W. Sweeney, C. Karel in 1963. We show that this algorithm is not a direct type algorithm.","authors_text":"Aleksandr Maksimenko","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:33:26Z","title":"Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03031","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:f80c8dfc78818400cd81a455cafa9cbe3635aec840294d0445a2e01369e65a57","target":"record","created_at":"2026-05-18T00:01:20Z","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":"f7756dc17a4cd3c135806176d56452b7d8eb578b011452240c3c9ea6e923e924","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T17:33:26Z","title_canon_sha256":"7c3829d9ce73da605c187b3c5e30f212b8c4dea074bded85253e4e921dc7a303"},"schema_version":"1.0","source":{"id":"1811.03031","kind":"arxiv","version":1}},"canonical_sha256":"3e6987b5fcdb45694ba1d50b5c9b28e0b60b8d59a4f60e33bda7dd23b83a6123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e6987b5fcdb45694ba1d50b5c9b28e0b60b8d59a4f60e33bda7dd23b83a6123","first_computed_at":"2026-05-18T00:01:20.093727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.093727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yfqIt4R95jnknBt/iWNpnReFS64a3uaaa2oWykvx+v5hgbpctJeWv8zTbfdn3ncLYtDwtey+5yRSHKrAr7uwBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.094324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f80c8dfc78818400cd81a455cafa9cbe3635aec840294d0445a2e01369e65a57","sha256:299e70db164bfc258674e4e0fd36d648f559188f5d144e54064f8d10bc6b242d"],"state_sha256":"e2bd29d21f1a9e6f65e93c4763eb53a6b71ae61b840f495176f97e4ede7e7394"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Ozpmn2jPQKaYqLf6nZ9sjDC5xBK56o4Ybduk3ej3qIbfHgQSY80BDJLyiNrPpL6hZfaOox5JPAMiFzjUjl9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:33:06.880512Z","bundle_sha256":"721a4dcd70cbca1ff725c346af3c79efeba8116fb065fe99b03c7fe0f2c0e068"}}