{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2MZ2MKMI7NS3YLU2LY5JF2GWFT","short_pith_number":"pith:2MZ2MKMI","canonical_record":{"source":{"id":"1606.05473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-17T10:54:45Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"c21015e99adb09151371953dadfeaeb4970d03d657bc466e43dc998d52bce809","abstract_canon_sha256":"3e9af44e680c985bca5bdcfbd1a1de10c93c099c2330ec8a7c4dc6bfbd2ffc8a"},"schema_version":"1.0"},"canonical_sha256":"d333a62988fb65bc2e9a5e3a92e8d62cda74fc4d36fd6fbf185e301ad15100c9","source":{"kind":"arxiv","id":"1606.05473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05473","created_at":"2026-05-18T00:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05473v1","created_at":"2026-05-18T00:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05473","created_at":"2026-05-18T00:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"2MZ2MKMI7NS3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2MZ2MKMI7NS3YLU2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2MZ2MKMI","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2MZ2MKMI7NS3YLU2LY5JF2GWFT","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-17T10:54:45Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"c21015e99adb09151371953dadfeaeb4970d03d657bc466e43dc998d52bce809","abstract_canon_sha256":"3e9af44e680c985bca5bdcfbd1a1de10c93c099c2330ec8a7c4dc6bfbd2ffc8a"},"schema_version":"1.0"},"canonical_sha256":"d333a62988fb65bc2e9a5e3a92e8d62cda74fc4d36fd6fbf185e301ad15100c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:04.486938Z","signature_b64":"GxEJpKGs69ge+KOmki/YS1vLYCr+bC52LhndvUnAD/bIJJHSCRI2aV53VPoicqSnKg1dytkykSK7sHjfDLtkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d333a62988fb65bc2e9a5e3a92e8d62cda74fc4d36fd6fbf185e301ad15100c9","last_reissued_at":"2026-05-18T00:50:04.486277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:04.486277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05473","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:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AwabLdolvv4ERHXO5BMCHjp1oFcZVNiyb1Fk3yMtmjtl0XGraXnGpTXzlFZk7NlYZT9r5Z7DgMdyYJUztlJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:35:09.498282Z"},"content_sha256":"2f8611e7a0b83306af74a9d114f1c62c631a1f89dc4e559cfe9017e2a11090bf","schema_version":"1.0","event_id":"sha256:2f8611e7a0b83306af74a9d114f1c62c631a1f89dc4e559cfe9017e2a11090bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2MZ2MKMI7NS3YLU2LY5JF2GWFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Reachability Analysis for Hybrid Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.DC","authors_text":"Amit Gurung, Arup Deka, Ezio Bartocci, Radu Grosu, Rajarshi Ray, Sergiy Bogomolov","submitted_at":"2016-06-17T10:54:45Z","abstract_excerpt":"We propose two parallel state-space exploration algorithms for hybrid systems with the goal of enhancing performance on multi-core shared memory systems. The first is an adaption of the parallel breadth first search in the SPIN model checker. We show that the adapted algorithm does not provide the desired load balancing for many hybrid systems benchmarks. The second is a task parallel algorithm based on cheaply precomputing cost of post (continuous and discrete) operations for effective load balancing. We illustrate the task parallel algorithm and the cost precomputation of post operators on a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05473","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:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTVyipDAo/Oj4w3MAYmgbNgNHCLdMQJyhYQheqSZvEKNNvcZrTiTBSzuKT4QMKbMZVjotvw64TwrDpzKHOw8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:35:09.498941Z"},"content_sha256":"8b2f7461333c5e894fce2de4961372ed812b3cbf85b8d9afea43d3d1d2169931","schema_version":"1.0","event_id":"sha256:8b2f7461333c5e894fce2de4961372ed812b3cbf85b8d9afea43d3d1d2169931"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MZ2MKMI7NS3YLU2LY5JF2GWFT/bundle.json","state_url":"https://pith.science/pith/2MZ2MKMI7NS3YLU2LY5JF2GWFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MZ2MKMI7NS3YLU2LY5JF2GWFT/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-27T17:35:09Z","links":{"resolver":"https://pith.science/pith/2MZ2MKMI7NS3YLU2LY5JF2GWFT","bundle":"https://pith.science/pith/2MZ2MKMI7NS3YLU2LY5JF2GWFT/bundle.json","state":"https://pith.science/pith/2MZ2MKMI7NS3YLU2LY5JF2GWFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MZ2MKMI7NS3YLU2LY5JF2GWFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2MZ2MKMI7NS3YLU2LY5JF2GWFT","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":"3e9af44e680c985bca5bdcfbd1a1de10c93c099c2330ec8a7c4dc6bfbd2ffc8a","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-17T10:54:45Z","title_canon_sha256":"c21015e99adb09151371953dadfeaeb4970d03d657bc466e43dc998d52bce809"},"schema_version":"1.0","source":{"id":"1606.05473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05473","created_at":"2026-05-18T00:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05473v1","created_at":"2026-05-18T00:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05473","created_at":"2026-05-18T00:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"2MZ2MKMI7NS3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2MZ2MKMI7NS3YLU2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2MZ2MKMI","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:8b2f7461333c5e894fce2de4961372ed812b3cbf85b8d9afea43d3d1d2169931","target":"graph","created_at":"2026-05-18T00:50:04Z","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 propose two parallel state-space exploration algorithms for hybrid systems with the goal of enhancing performance on multi-core shared memory systems. The first is an adaption of the parallel breadth first search in the SPIN model checker. We show that the adapted algorithm does not provide the desired load balancing for many hybrid systems benchmarks. The second is a task parallel algorithm based on cheaply precomputing cost of post (continuous and discrete) operations for effective load balancing. We illustrate the task parallel algorithm and the cost precomputation of post operators on a","authors_text":"Amit Gurung, Arup Deka, Ezio Bartocci, Radu Grosu, Rajarshi Ray, Sergiy Bogomolov","cross_cats":["cs.LO","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-17T10:54:45Z","title":"Parallel Reachability Analysis for Hybrid Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05473","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:2f8611e7a0b83306af74a9d114f1c62c631a1f89dc4e559cfe9017e2a11090bf","target":"record","created_at":"2026-05-18T00:50:04Z","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":"3e9af44e680c985bca5bdcfbd1a1de10c93c099c2330ec8a7c4dc6bfbd2ffc8a","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-17T10:54:45Z","title_canon_sha256":"c21015e99adb09151371953dadfeaeb4970d03d657bc466e43dc998d52bce809"},"schema_version":"1.0","source":{"id":"1606.05473","kind":"arxiv","version":1}},"canonical_sha256":"d333a62988fb65bc2e9a5e3a92e8d62cda74fc4d36fd6fbf185e301ad15100c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d333a62988fb65bc2e9a5e3a92e8d62cda74fc4d36fd6fbf185e301ad15100c9","first_computed_at":"2026-05-18T00:50:04.486277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:04.486277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GxEJpKGs69ge+KOmki/YS1vLYCr+bC52LhndvUnAD/bIJJHSCRI2aV53VPoicqSnKg1dytkykSK7sHjfDLtkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:04.486938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f8611e7a0b83306af74a9d114f1c62c631a1f89dc4e559cfe9017e2a11090bf","sha256:8b2f7461333c5e894fce2de4961372ed812b3cbf85b8d9afea43d3d1d2169931"],"state_sha256":"2d698f52900f373ff81c99198989a6139492e5b5916e980cc8015bbb1c10f13e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLpmXnpOFnb0pWltBeuZdjK13FCEavjBmMjZfxhXXCnJYzbdC7R2BbKmXghvFfUkxv6fHRlQLoSinSOk5V7bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:35:09.502414Z","bundle_sha256":"5dc77e2b0cf0cabb0a8f2070b7cdec57470aa217faa7280f8a320fa7a806f69d"}}