{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T4KSCALRAACELWLOKIWF37SMVM","short_pith_number":"pith:T4KSCALR","canonical_record":{"source":{"id":"1709.07605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-22T05:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"873508c0af81de6c543dcc788269aec19a40181643a23c1688b8210b94ab5e0c","abstract_canon_sha256":"663b58f593a2f3ae7a21c8038f4ffde64188d976103399e668ff738bff6ae227"},"schema_version":"1.0"},"canonical_sha256":"9f15210171000445d96e522c5dfe4cab08bd8960c4df53edd606af65a6507a90","source":{"kind":"arxiv","id":"1709.07605","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07605","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07605v2","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07605","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"T4KSCALRAACE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4KSCALRAACELWLO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4KSCALR","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T4KSCALRAACELWLOKIWF37SMVM","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-22T05:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"873508c0af81de6c543dcc788269aec19a40181643a23c1688b8210b94ab5e0c","abstract_canon_sha256":"663b58f593a2f3ae7a21c8038f4ffde64188d976103399e668ff738bff6ae227"},"schema_version":"1.0"},"canonical_sha256":"9f15210171000445d96e522c5dfe4cab08bd8960c4df53edd606af65a6507a90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:59.821752Z","signature_b64":"MUNx0LEdHMSey3YWsInaSsNDTXkqR516zZRWmvUE8hGQxaN1BiXsd3p1heeKMgSkhH2y9ak4y1NlxX7By8ObAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f15210171000445d96e522c5dfe4cab08bd8960c4df53edd606af65a6507a90","last_reissued_at":"2026-05-17T23:49:59.821211Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:59.821211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07605","source_version":2,"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-17T23:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qa05i44qKiBqbK+6FexGsOs/gPeRyFjUJ5gRWjewks0aSm8HVYH8Svm7kKAwSiMnbq6vLFc1DO9iDUoIybE/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:26.300477Z"},"content_sha256":"cbbf4cbbcbf7061bfcfd12d0afec46d9a5f0c1267871a2eea01c32780c044ad7","schema_version":"1.0","event_id":"sha256:cbbf4cbbcbf7061bfcfd12d0afec46d9a5f0c1267871a2eea01c32780c044ad7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T4KSCALRAACELWLOKIWF37SMVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"mts: A light framework for parallelizing tree search codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Charles Jordan, David Avis","submitted_at":"2017-09-22T05:59:21Z","abstract_excerpt":"We describe mts, a generic framework for parallelizing certain types of tree search programs including reverse search, backtracking, branch and bound and satisfiability testing. It abstracts and generalizes the ideas used in parallelizing lrs, a reverse search code for vertex enumeration. mts supports sharing information between processes which is important for applications such as satisfiability testing and branch-and-bound. No parallelization is implemented in the legacy single processor programs minimizing the changes needed and simplying debugging. mts is written in C, uses MPI for paralle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07605","kind":"arxiv","version":2},"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-17T23:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16ZCaFbzgIAJh9F9MZNOHfvzo7y2WGojG8TMV0U6hxWxLGdbfjnFVYTLMzvQRZwApjR9o1WJCn6+96F+rZeMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:26.301127Z"},"content_sha256":"f32799c23165eb840f0301a413042f787f9f92b188b2d4f03f7cb78d793090d0","schema_version":"1.0","event_id":"sha256:f32799c23165eb840f0301a413042f787f9f92b188b2d4f03f7cb78d793090d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4KSCALRAACELWLOKIWF37SMVM/bundle.json","state_url":"https://pith.science/pith/T4KSCALRAACELWLOKIWF37SMVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4KSCALRAACELWLOKIWF37SMVM/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-06T15:59:26Z","links":{"resolver":"https://pith.science/pith/T4KSCALRAACELWLOKIWF37SMVM","bundle":"https://pith.science/pith/T4KSCALRAACELWLOKIWF37SMVM/bundle.json","state":"https://pith.science/pith/T4KSCALRAACELWLOKIWF37SMVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4KSCALRAACELWLOKIWF37SMVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T4KSCALRAACELWLOKIWF37SMVM","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":"663b58f593a2f3ae7a21c8038f4ffde64188d976103399e668ff738bff6ae227","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-22T05:59:21Z","title_canon_sha256":"873508c0af81de6c543dcc788269aec19a40181643a23c1688b8210b94ab5e0c"},"schema_version":"1.0","source":{"id":"1709.07605","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07605","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07605v2","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07605","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"T4KSCALRAACE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4KSCALRAACELWLO","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4KSCALR","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:f32799c23165eb840f0301a413042f787f9f92b188b2d4f03f7cb78d793090d0","target":"graph","created_at":"2026-05-17T23:49:59Z","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, a generic framework for parallelizing certain types of tree search programs including reverse search, backtracking, branch and bound and satisfiability testing. It abstracts and generalizes the ideas used in parallelizing lrs, a reverse search code for vertex enumeration. mts supports sharing information between processes which is important for applications such as satisfiability testing and branch-and-bound. No parallelization is implemented in the legacy single processor programs minimizing the changes needed and simplying debugging. mts is written in C, uses MPI for paralle","authors_text":"Charles Jordan, David Avis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-22T05:59:21Z","title":"mts: A light framework for parallelizing tree search codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07605","kind":"arxiv","version":2},"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:cbbf4cbbcbf7061bfcfd12d0afec46d9a5f0c1267871a2eea01c32780c044ad7","target":"record","created_at":"2026-05-17T23:49:59Z","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":"663b58f593a2f3ae7a21c8038f4ffde64188d976103399e668ff738bff6ae227","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-22T05:59:21Z","title_canon_sha256":"873508c0af81de6c543dcc788269aec19a40181643a23c1688b8210b94ab5e0c"},"schema_version":"1.0","source":{"id":"1709.07605","kind":"arxiv","version":2}},"canonical_sha256":"9f15210171000445d96e522c5dfe4cab08bd8960c4df53edd606af65a6507a90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f15210171000445d96e522c5dfe4cab08bd8960c4df53edd606af65a6507a90","first_computed_at":"2026-05-17T23:49:59.821211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:59.821211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MUNx0LEdHMSey3YWsInaSsNDTXkqR516zZRWmvUE8hGQxaN1BiXsd3p1heeKMgSkhH2y9ak4y1NlxX7By8ObAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:59.821752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07605","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbbf4cbbcbf7061bfcfd12d0afec46d9a5f0c1267871a2eea01c32780c044ad7","sha256:f32799c23165eb840f0301a413042f787f9f92b188b2d4f03f7cb78d793090d0"],"state_sha256":"54366b8be6a94d618bce6aae326860d6dadc9ff7199b699a302d117c5db1b735"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdB4BoCXx+PV6dYhauWNJNN7vTr/cEQ5+02QQR5rxRjLn5ZZ1jHjLtYK1kg3Mv7t1JMnOmY2lpELsY7AqlC4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:59:26.304899Z","bundle_sha256":"7eeec925f27f1a0096514fc05cc8a6fe0177dbaa153dbacacb1375a4eeb19e63"}}