{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU","short_pith_number":"pith:QPO6ZWOK","canonical_record":{"source":{"id":"1306.2552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-11T15:29:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7b047eba0070e58b2e21c6f4b093d6cd6b643b8487143ffa3a78c4258ef69e6d","abstract_canon_sha256":"1ffd87463a4d7d317980feba167c127dacaac788c124e10b5d31fc311e9113bf"},"schema_version":"1.0"},"canonical_sha256":"83ddecd9cad950087f1d49cff7c3474511b0fd16d52651d0d819db5c54540db9","source":{"kind":"arxiv","id":"1306.2552","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2552","created_at":"2026-05-18T02:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2552v2","created_at":"2026-05-18T02:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2552","created_at":"2026-05-18T02:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"QPO6ZWOK3FIA","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QPO6ZWOK3FIAQ7Y5","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QPO6ZWOK","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-11T15:29:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7b047eba0070e58b2e21c6f4b093d6cd6b643b8487143ffa3a78c4258ef69e6d","abstract_canon_sha256":"1ffd87463a4d7d317980feba167c127dacaac788c124e10b5d31fc311e9113bf"},"schema_version":"1.0"},"canonical_sha256":"83ddecd9cad950087f1d49cff7c3474511b0fd16d52651d0d819db5c54540db9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:36.400341Z","signature_b64":"rw8gqlnFOSMVZdlDK96XghSteumGjefyo3fg5De456Scb9Yq84d8uPbBkf5RG8GNGYVew8sX/IURaZl2og1ADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83ddecd9cad950087f1d49cff7c3474511b0fd16d52651d0d819db5c54540db9","last_reissued_at":"2026-05-18T02:55:36.399533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:36.399533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2552","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-18T02:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"htB+9HdzMziUNG4zcpLlh6hmuewysCNAEWD1TbMOizl2s6S7p87Wxp0d52emUH2/wn/jmfwfTLB2iWHAhym5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:29:22.832950Z"},"content_sha256":"60b81c3e0143b117bb32c5b0c6558edc49cb94192671b0007fae344b351820ca","schema_version":"1.0","event_id":"sha256:60b81c3e0143b117bb32c5b0c6558edc49cb94192671b0007fae344b351820ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Efficient Parallel Algorithms for Combinatorial Search Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Andrea Pietracaprina, Fabio Vandin, Francesco Silvestri, Geppino Pucci","submitted_at":"2013-06-11T15:29:17Z","abstract_excerpt":"We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an $n$-node tree of height $h$ under the assumption that a node can be accessed only through its father or its children. For both problems we propose efficient algorithms that run on a $p$-processor distributed-memory machine. For backtrack search, we give a deterministic algorithm running in $O(n/p+h\\log p)$ time, and a Las Vegas algorithm requiring optimal $O(n/p+h)$ time, with high probability. Building on the backtrack "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2552","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-18T02:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8z3jU3Igqe1sH9EsjL2/u0jB9uk35X5TEVkJ7ST6kdbZKAfp6wk0VBCnBp/Hsx6CBoHv9G+oSiiuNzuyZbBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:29:22.833349Z"},"content_sha256":"b3ccf9f06e94fa9cde2812871aa927503749ca67c5ca0de506b85a60aa3d6f71","schema_version":"1.0","event_id":"sha256:b3ccf9f06e94fa9cde2812871aa927503749ca67c5ca0de506b85a60aa3d6f71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU/bundle.json","state_url":"https://pith.science/pith/QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU/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:29:22Z","links":{"resolver":"https://pith.science/pith/QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU","bundle":"https://pith.science/pith/QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU/bundle.json","state":"https://pith.science/pith/QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QPO6ZWOK3FIAQ7Y5JHH7PQ2HIU","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":"1ffd87463a4d7d317980feba167c127dacaac788c124e10b5d31fc311e9113bf","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-11T15:29:17Z","title_canon_sha256":"7b047eba0070e58b2e21c6f4b093d6cd6b643b8487143ffa3a78c4258ef69e6d"},"schema_version":"1.0","source":{"id":"1306.2552","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2552","created_at":"2026-05-18T02:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2552v2","created_at":"2026-05-18T02:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2552","created_at":"2026-05-18T02:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"QPO6ZWOK3FIA","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QPO6ZWOK3FIAQ7Y5","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QPO6ZWOK","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:b3ccf9f06e94fa9cde2812871aa927503749ca67c5ca0de506b85a60aa3d6f71","target":"graph","created_at":"2026-05-18T02:55:36Z","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 present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an $n$-node tree of height $h$ under the assumption that a node can be accessed only through its father or its children. For both problems we propose efficient algorithms that run on a $p$-processor distributed-memory machine. For backtrack search, we give a deterministic algorithm running in $O(n/p+h\\log p)$ time, and a Las Vegas algorithm requiring optimal $O(n/p+h)$ time, with high probability. Building on the backtrack ","authors_text":"Andrea Pietracaprina, Fabio Vandin, Francesco Silvestri, Geppino Pucci","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-11T15:29:17Z","title":"Space-Efficient Parallel Algorithms for Combinatorial Search Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2552","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:60b81c3e0143b117bb32c5b0c6558edc49cb94192671b0007fae344b351820ca","target":"record","created_at":"2026-05-18T02:55:36Z","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":"1ffd87463a4d7d317980feba167c127dacaac788c124e10b5d31fc311e9113bf","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-11T15:29:17Z","title_canon_sha256":"7b047eba0070e58b2e21c6f4b093d6cd6b643b8487143ffa3a78c4258ef69e6d"},"schema_version":"1.0","source":{"id":"1306.2552","kind":"arxiv","version":2}},"canonical_sha256":"83ddecd9cad950087f1d49cff7c3474511b0fd16d52651d0d819db5c54540db9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83ddecd9cad950087f1d49cff7c3474511b0fd16d52651d0d819db5c54540db9","first_computed_at":"2026-05-18T02:55:36.399533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:36.399533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rw8gqlnFOSMVZdlDK96XghSteumGjefyo3fg5De456Scb9Yq84d8uPbBkf5RG8GNGYVew8sX/IURaZl2og1ADg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:36.400341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2552","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60b81c3e0143b117bb32c5b0c6558edc49cb94192671b0007fae344b351820ca","sha256:b3ccf9f06e94fa9cde2812871aa927503749ca67c5ca0de506b85a60aa3d6f71"],"state_sha256":"49199908ab3ce4faaa250a529588d5ee2b2d36be56a790207ffce387d85b4e67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMnjl4mXZGJkRxnNWKGBRJhDkkCVvPoz1Bpgzq6AG7qRF4H9gGhManNuHc52xl7DKI9TDxV49Up4sHlc95i/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:29:22.836871Z","bundle_sha256":"6660524f37865d250d8d1b7e03aee95ee03f96f77abc4ef956ff74f77eb96bdc"}}