{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IJ7PM7ZJDNNRMZNIBO3UQZ2MCK","short_pith_number":"pith:IJ7PM7ZJ","canonical_record":{"source":{"id":"1610.07735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-25T05:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"0ff14db1c842e7b26a7ebdb8c07ece970c5d807e33b70e69d5e20617a8139d59","abstract_canon_sha256":"d070cad933521b0cd6c7db6f9f6755525d4ec82cb3158735d9ddb0ef511aaf18"},"schema_version":"1.0"},"canonical_sha256":"427ef67f291b5b1665a80bb748674c12970f73f3889539ebcb9b0530361c39e5","source":{"kind":"arxiv","id":"1610.07735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07735","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07735v1","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07735","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"IJ7PM7ZJDNNR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJ7PM7ZJDNNRMZNI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJ7PM7ZJ","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IJ7PM7ZJDNNRMZNIBO3UQZ2MCK","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-25T05:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"0ff14db1c842e7b26a7ebdb8c07ece970c5d807e33b70e69d5e20617a8139d59","abstract_canon_sha256":"d070cad933521b0cd6c7db6f9f6755525d4ec82cb3158735d9ddb0ef511aaf18"},"schema_version":"1.0"},"canonical_sha256":"427ef67f291b5b1665a80bb748674c12970f73f3889539ebcb9b0530361c39e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:17.792093Z","signature_b64":"0xQ5vNTJMTQV2FxhvXVfqf7OrZbho0fhnlC09pZjbDhA5kBM+fpUSsPmupthg8JRAf7gFuWprBAmsw4ibl3wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"427ef67f291b5b1665a80bb748674c12970f73f3889539ebcb9b0530361c39e5","last_reissued_at":"2026-05-18T01:01:17.791449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:17.791449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07735","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-18T01:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/ZnoFWiJPvMm9ArFfiRMgPHZuu8xhX7r1dZT6uGF/MyHuWyJSWN1J1yCyK+qaw3ZeR+FYGw70gCRQ+hzjyjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:22:22.916059Z"},"content_sha256":"e394ecde037aaa319c8dcdd969b1c5d1c0c0f7a955fbfce71481125c77f65d34","schema_version":"1.0","event_id":"sha256:e394ecde037aaa319c8dcdd969b1c5d1c0c0f7a955fbfce71481125c77f65d34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IJ7PM7ZJDNNRMZNIBO3UQZ2MCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A parallel framework for reverse search using mts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Charles Jordan, David Avis","submitted_at":"2016-10-25T05:25:55Z","abstract_excerpt":"We describe mts, which is a generic framework for parallelizing certain types of tree search programs, that (a) provides a single common wrapper containing all of the parallelization, and (b) minimizes the changes needed to the existing single processor legacy code. The mts code was derived from ideas used to develop mplrs, a parallelization of the reverse search vertex enumeration code lrs. The tree search properties required for the use of mts are satisfied by any reverse search algorithm as well as other tree search methods such as backtracking and branch and bound. mts is programmed in C, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07735","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-18T01:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/x/dtk9kCtlDyo19zQz35YQEywsDYlm09vEfOkk4Kij+kSyfzUDSbDE3eMVB36dJo6m27yM5kusqVsquv9qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:22:22.916751Z"},"content_sha256":"e9437847f25a71a5acc25c5985f8b6f0ec8a4158db61ffb75ea8fc7010d693d5","schema_version":"1.0","event_id":"sha256:e9437847f25a71a5acc25c5985f8b6f0ec8a4158db61ffb75ea8fc7010d693d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJ7PM7ZJDNNRMZNIBO3UQZ2MCK/bundle.json","state_url":"https://pith.science/pith/IJ7PM7ZJDNNRMZNIBO3UQZ2MCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJ7PM7ZJDNNRMZNIBO3UQZ2MCK/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-06T08:22:22Z","links":{"resolver":"https://pith.science/pith/IJ7PM7ZJDNNRMZNIBO3UQZ2MCK","bundle":"https://pith.science/pith/IJ7PM7ZJDNNRMZNIBO3UQZ2MCK/bundle.json","state":"https://pith.science/pith/IJ7PM7ZJDNNRMZNIBO3UQZ2MCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJ7PM7ZJDNNRMZNIBO3UQZ2MCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IJ7PM7ZJDNNRMZNIBO3UQZ2MCK","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":"d070cad933521b0cd6c7db6f9f6755525d4ec82cb3158735d9ddb0ef511aaf18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-25T05:25:55Z","title_canon_sha256":"0ff14db1c842e7b26a7ebdb8c07ece970c5d807e33b70e69d5e20617a8139d59"},"schema_version":"1.0","source":{"id":"1610.07735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07735","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07735v1","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07735","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"IJ7PM7ZJDNNR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJ7PM7ZJDNNRMZNI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJ7PM7ZJ","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:e9437847f25a71a5acc25c5985f8b6f0ec8a4158db61ffb75ea8fc7010d693d5","target":"graph","created_at":"2026-05-18T01:01:17Z","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":"We describe mts, which is a generic framework for parallelizing certain types of tree search programs, that (a) provides a single common wrapper containing all of the parallelization, and (b) minimizes the changes needed to the existing single processor legacy code. The mts code was derived from ideas used to develop mplrs, a parallelization of the reverse search vertex enumeration code lrs. The tree search properties required for the use of mts are satisfied by any reverse search algorithm as well as other tree search methods such as backtracking and branch and bound. mts is programmed in C, ","authors_text":"Charles Jordan, David Avis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-25T05:25:55Z","title":"A parallel framework for reverse search using mts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07735","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:e394ecde037aaa319c8dcdd969b1c5d1c0c0f7a955fbfce71481125c77f65d34","target":"record","created_at":"2026-05-18T01:01:17Z","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":"d070cad933521b0cd6c7db6f9f6755525d4ec82cb3158735d9ddb0ef511aaf18","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-25T05:25:55Z","title_canon_sha256":"0ff14db1c842e7b26a7ebdb8c07ece970c5d807e33b70e69d5e20617a8139d59"},"schema_version":"1.0","source":{"id":"1610.07735","kind":"arxiv","version":1}},"canonical_sha256":"427ef67f291b5b1665a80bb748674c12970f73f3889539ebcb9b0530361c39e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"427ef67f291b5b1665a80bb748674c12970f73f3889539ebcb9b0530361c39e5","first_computed_at":"2026-05-18T01:01:17.791449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:17.791449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0xQ5vNTJMTQV2FxhvXVfqf7OrZbho0fhnlC09pZjbDhA5kBM+fpUSsPmupthg8JRAf7gFuWprBAmsw4ibl3wCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:17.792093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e394ecde037aaa319c8dcdd969b1c5d1c0c0f7a955fbfce71481125c77f65d34","sha256:e9437847f25a71a5acc25c5985f8b6f0ec8a4158db61ffb75ea8fc7010d693d5"],"state_sha256":"2a29126367a9950095185818298ed578094d8fc46ce039ac0cb0eedf2b4585b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wewXeEs9XomgCjcbooa/0SfeCWoJOLIR3bF+d50jipDPGCQz663KM/V5tIey45k6NZkh0WVm2GGF8kag95xfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:22:22.920145Z","bundle_sha256":"28ab7d7d19a20c71629bea437724388e6753cdafbc4829cea87185b8a75cbc59"}}