{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7JKCK7ECLYFEEDARDNYGVP2CXA","short_pith_number":"pith:7JKCK7EC","canonical_record":{"source":{"id":"1312.7626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-30T04:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"382c214460af50e23d4b30b02a099a892ef2e0d6aaf21f1f42e78efde08d8166","abstract_canon_sha256":"9eb93e11334807403ba01a131cc7840896bbb070dddf28a95d081ea47175267b"},"schema_version":"1.0"},"canonical_sha256":"fa54257c825e0a420c111b706abf42b818285aef7c3d03e8ce01b756cfb80a59","source":{"kind":"arxiv","id":"1312.7626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7626","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7626v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7626","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"7JKCK7ECLYFE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7JKCK7ECLYFEEDAR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7JKCK7EC","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7JKCK7ECLYFEEDARDNYGVP2CXA","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-30T04:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"382c214460af50e23d4b30b02a099a892ef2e0d6aaf21f1f42e78efde08d8166","abstract_canon_sha256":"9eb93e11334807403ba01a131cc7840896bbb070dddf28a95d081ea47175267b"},"schema_version":"1.0"},"canonical_sha256":"fa54257c825e0a420c111b706abf42b818285aef7c3d03e8ce01b756cfb80a59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:34.189466Z","signature_b64":"WouAP/XoL/RJw2M6hMB4HkK1ygscylf3dIckj++jjppOG2OerrLJ+8Krisn6MMfTBpV0UbEBgXfzdE+GT5IBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa54257c825e0a420c111b706abf42b818285aef7c3d03e8ce01b756cfb80a59","last_reissued_at":"2026-05-18T03:03:34.188748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:34.188748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7626","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-18T03:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FGuUpF9HN/sNJ/J/8D+OZdX2wUQ9pNpIqr/oLQxgSb/1YFNLD2JY2wwrTw4mq9KWVYZQ2qqkbgTVXZVXuqLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:20:02.263952Z"},"content_sha256":"aebd8259fdd9322bd2acbe26e2886352013633ca185406a6a8f85158139919aa","schema_version":"1.0","event_id":"sha256:aebd8259fdd9322bd2acbe26e2886352013633ca185406a6a8f85158139919aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7JKCK7ECLYFEEDARDNYGVP2CXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Easy-to-use Scalable Framework for Parallel Recursive Backtracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amer E. Mouawad, Faisal N. Abu-Khzam, Khuzaima Daudjee, Naomi Nishimura","submitted_at":"2013-12-30T04:50:35Z","abstract_excerpt":"Supercomputers are equipped with an increasingly large number of cores to use computational power as a way of solving problems that are otherwise intractable. Unfortunately, getting serial algorithms to run in parallel to take advantage of these computational resources remains a challenge for several application domains. Many parallel algorithms can scale to only hundreds of cores. The limiting factors of such algorithms are usually communication overhead and poor load balancing. Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7626","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-18T03:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Wx3wl/LqAHOUvVEsURGGNz+QDoytnDQiGgpmqGEefOlfEeWPw5AYn9CT7nSNi4vyCyMJZxXxSKre00ztQB4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:20:02.264308Z"},"content_sha256":"8857792a36535f5f7b820a08b7e089cac859dcdf33fecec9514422276fafae7e","schema_version":"1.0","event_id":"sha256:8857792a36535f5f7b820a08b7e089cac859dcdf33fecec9514422276fafae7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JKCK7ECLYFEEDARDNYGVP2CXA/bundle.json","state_url":"https://pith.science/pith/7JKCK7ECLYFEEDARDNYGVP2CXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JKCK7ECLYFEEDARDNYGVP2CXA/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-05-27T12:20:02Z","links":{"resolver":"https://pith.science/pith/7JKCK7ECLYFEEDARDNYGVP2CXA","bundle":"https://pith.science/pith/7JKCK7ECLYFEEDARDNYGVP2CXA/bundle.json","state":"https://pith.science/pith/7JKCK7ECLYFEEDARDNYGVP2CXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JKCK7ECLYFEEDARDNYGVP2CXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7JKCK7ECLYFEEDARDNYGVP2CXA","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":"9eb93e11334807403ba01a131cc7840896bbb070dddf28a95d081ea47175267b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-30T04:50:35Z","title_canon_sha256":"382c214460af50e23d4b30b02a099a892ef2e0d6aaf21f1f42e78efde08d8166"},"schema_version":"1.0","source":{"id":"1312.7626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7626","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7626v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7626","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"7JKCK7ECLYFE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7JKCK7ECLYFEEDAR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7JKCK7EC","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:8857792a36535f5f7b820a08b7e089cac859dcdf33fecec9514422276fafae7e","target":"graph","created_at":"2026-05-18T03:03:34Z","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":"Supercomputers are equipped with an increasingly large number of cores to use computational power as a way of solving problems that are otherwise intractable. Unfortunately, getting serial algorithms to run in parallel to take advantage of these computational resources remains a challenge for several application domains. Many parallel algorithms can scale to only hundreds of cores. The limiting factors of such algorithms are usually communication overhead and poor load balancing. Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so ","authors_text":"Amer E. Mouawad, Faisal N. Abu-Khzam, Khuzaima Daudjee, Naomi Nishimura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-30T04:50:35Z","title":"An Easy-to-use Scalable Framework for Parallel Recursive Backtracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7626","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:aebd8259fdd9322bd2acbe26e2886352013633ca185406a6a8f85158139919aa","target":"record","created_at":"2026-05-18T03:03:34Z","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":"9eb93e11334807403ba01a131cc7840896bbb070dddf28a95d081ea47175267b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-30T04:50:35Z","title_canon_sha256":"382c214460af50e23d4b30b02a099a892ef2e0d6aaf21f1f42e78efde08d8166"},"schema_version":"1.0","source":{"id":"1312.7626","kind":"arxiv","version":1}},"canonical_sha256":"fa54257c825e0a420c111b706abf42b818285aef7c3d03e8ce01b756cfb80a59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa54257c825e0a420c111b706abf42b818285aef7c3d03e8ce01b756cfb80a59","first_computed_at":"2026-05-18T03:03:34.188748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:34.188748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WouAP/XoL/RJw2M6hMB4HkK1ygscylf3dIckj++jjppOG2OerrLJ+8Krisn6MMfTBpV0UbEBgXfzdE+GT5IBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:34.189466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aebd8259fdd9322bd2acbe26e2886352013633ca185406a6a8f85158139919aa","sha256:8857792a36535f5f7b820a08b7e089cac859dcdf33fecec9514422276fafae7e"],"state_sha256":"d185b8576c3721e1775bec4a98e23e233c5b023cd3bf14e0cb0dc68759fbda44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KAd9ZoALOdMO3ZzJhwzl6Yl734ib/QnTKAdIII9V8u+g7g4M88kXBXuo+KhdwxsqgMmD8U5UpECSwBwS3GEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:20:02.266677Z","bundle_sha256":"949563d9ab70621f1f004924e80b651ed510856a9ef3e90340766092e29c66bd"}}