{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GFKADYN5DZXXKV67GIHLA4T7BK","short_pith_number":"pith:GFKADYN5","canonical_record":{"source":{"id":"1707.07788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-25T01:56:59Z","cross_cats_sorted":[],"title_canon_sha256":"ad1adb8027971b14dec57dabaa0db98c7f9ee20a89afebd67a52dd606c8bca7e","abstract_canon_sha256":"5c92f682be858b706fcdd0a0c2fbc72589c9c870d3d02e81b07fb549e83ebeab"},"schema_version":"1.0"},"canonical_sha256":"315401e1bd1e6f7557df320eb0727f0aa2d36e3456aa303ceb1351d38f097b7f","source":{"kind":"arxiv","id":"1707.07788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07788","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07788v1","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07788","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"GFKADYN5DZXX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GFKADYN5DZXXKV67","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GFKADYN5","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GFKADYN5DZXXKV67GIHLA4T7BK","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-25T01:56:59Z","cross_cats_sorted":[],"title_canon_sha256":"ad1adb8027971b14dec57dabaa0db98c7f9ee20a89afebd67a52dd606c8bca7e","abstract_canon_sha256":"5c92f682be858b706fcdd0a0c2fbc72589c9c870d3d02e81b07fb549e83ebeab"},"schema_version":"1.0"},"canonical_sha256":"315401e1bd1e6f7557df320eb0727f0aa2d36e3456aa303ceb1351d38f097b7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:30.357463Z","signature_b64":"WRjEzaqi+bfUMtZXZuZgngrt8uaSQJFsqhidduM3TyNVQVWaJMm1kRzbK7M2hnMffozVtWy35IDxESx3WnV/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"315401e1bd1e6f7557df320eb0727f0aa2d36e3456aa303ceb1351d38f097b7f","last_reissued_at":"2026-05-18T00:39:30.356766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:30.356766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07788","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:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0O8xA/DqcAo3aPQoywj1RPFlNZnFXp6jV+r9buHn4QB+OuXlrP/Fdej4yqwKOqfe4iaYDF8ZTG6+YYFmgzYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:19:57.797127Z"},"content_sha256":"a98abd84d4b55860b664455dc6d2c22c2112ac837bfe0ae89ff49f46764f227e","schema_version":"1.0","event_id":"sha256:a98abd84d4b55860b664455dc6d2c22c2112ac837bfe0ae89ff49f46764f227e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GFKADYN5DZXXKV67GIHLA4T7BK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Himanshu Chauhan, Vijay Garg","submitted_at":"2017-07-25T01:56:59Z","abstract_excerpt":"Enumerating consistent global states of a computation is a fundamental problem in parallel computing with applications to debug- ging, testing and runtime verification of parallel programs. Breadth-first search (BFS) enumeration is especially useful for these applications as it finds an erroneous consistent global state with the least number of events possible. The total number of executed events in a global state is called its rank. BFS also allows enumeration of all global states of a given rank or within a range of ranks. If a computation on n processes has m events per process on average, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07788","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:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wde/IL5OF0rU+iDW6MpL3t7L+KS4WtUzAvKA7/ccG+IEN0AKc/bf9Uxt901QFBPLe1Fi7jt//a5CSEOhgs24Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:19:57.797789Z"},"content_sha256":"5868b9095d00d9206fcb41bf1d2c8a76cb046403f16d536ec0d4ad8fa23487a2","schema_version":"1.0","event_id":"sha256:5868b9095d00d9206fcb41bf1d2c8a76cb046403f16d536ec0d4ad8fa23487a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFKADYN5DZXXKV67GIHLA4T7BK/bundle.json","state_url":"https://pith.science/pith/GFKADYN5DZXXKV67GIHLA4T7BK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFKADYN5DZXXKV67GIHLA4T7BK/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-03T12:19:57Z","links":{"resolver":"https://pith.science/pith/GFKADYN5DZXXKV67GIHLA4T7BK","bundle":"https://pith.science/pith/GFKADYN5DZXXKV67GIHLA4T7BK/bundle.json","state":"https://pith.science/pith/GFKADYN5DZXXKV67GIHLA4T7BK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFKADYN5DZXXKV67GIHLA4T7BK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GFKADYN5DZXXKV67GIHLA4T7BK","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":"5c92f682be858b706fcdd0a0c2fbc72589c9c870d3d02e81b07fb549e83ebeab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-25T01:56:59Z","title_canon_sha256":"ad1adb8027971b14dec57dabaa0db98c7f9ee20a89afebd67a52dd606c8bca7e"},"schema_version":"1.0","source":{"id":"1707.07788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07788","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07788v1","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07788","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"GFKADYN5DZXX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GFKADYN5DZXXKV67","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GFKADYN5","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:5868b9095d00d9206fcb41bf1d2c8a76cb046403f16d536ec0d4ad8fa23487a2","target":"graph","created_at":"2026-05-18T00:39:30Z","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":"Enumerating consistent global states of a computation is a fundamental problem in parallel computing with applications to debug- ging, testing and runtime verification of parallel programs. Breadth-first search (BFS) enumeration is especially useful for these applications as it finds an erroneous consistent global state with the least number of events possible. The total number of executed events in a global state is called its rank. BFS also allows enumeration of all global states of a given rank or within a range of ranks. If a computation on n processes has m events per process on average, ","authors_text":"Himanshu Chauhan, Vijay Garg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-25T01:56:59Z","title":"Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07788","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:a98abd84d4b55860b664455dc6d2c22c2112ac837bfe0ae89ff49f46764f227e","target":"record","created_at":"2026-05-18T00:39:30Z","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":"5c92f682be858b706fcdd0a0c2fbc72589c9c870d3d02e81b07fb549e83ebeab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-25T01:56:59Z","title_canon_sha256":"ad1adb8027971b14dec57dabaa0db98c7f9ee20a89afebd67a52dd606c8bca7e"},"schema_version":"1.0","source":{"id":"1707.07788","kind":"arxiv","version":1}},"canonical_sha256":"315401e1bd1e6f7557df320eb0727f0aa2d36e3456aa303ceb1351d38f097b7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"315401e1bd1e6f7557df320eb0727f0aa2d36e3456aa303ceb1351d38f097b7f","first_computed_at":"2026-05-18T00:39:30.356766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:30.356766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WRjEzaqi+bfUMtZXZuZgngrt8uaSQJFsqhidduM3TyNVQVWaJMm1kRzbK7M2hnMffozVtWy35IDxESx3WnV/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:30.357463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a98abd84d4b55860b664455dc6d2c22c2112ac837bfe0ae89ff49f46764f227e","sha256:5868b9095d00d9206fcb41bf1d2c8a76cb046403f16d536ec0d4ad8fa23487a2"],"state_sha256":"25f945ac9b832f406cd195695eb12d69b511d3857239ebd987b904097ef77bfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7ntfYJQl1z1m4HP26ZHbtwDsnb9VdRy/7apJpHMKqbXhxroJy0HHbpbVTPceOT4gtS7UeZASYN2oFE7eny7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:19:57.801025Z","bundle_sha256":"c15628a9333f355919b8d63427ba65700d06b982b2fa479411f302753889fc55"}}