{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AJZ4T4X6ZETVGBGVHLKRQQ3PEJ","short_pith_number":"pith:AJZ4T4X6","canonical_record":{"source":{"id":"1611.09318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-28T20:11:49Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"7dd016905c7108e9e5aac26cc2b7dbe04d7354aa87397d9e156743b72f0c3d86","abstract_canon_sha256":"6f2e70e194f554be2e9bd9fcf3ca81e10513cb7eeb5b7a5a9ba26298862415da"},"schema_version":"1.0"},"canonical_sha256":"0273c9f2fec9275304d53ad518436f227437bdbf3508132e1b2a4157290d29a0","source":{"kind":"arxiv","id":"1611.09318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09318","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09318v1","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09318","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"pith_short_12","alias_value":"AJZ4T4X6ZETV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AJZ4T4X6ZETVGBGV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AJZ4T4X6","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AJZ4T4X6ZETVGBGVHLKRQQ3PEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-28T20:11:49Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"7dd016905c7108e9e5aac26cc2b7dbe04d7354aa87397d9e156743b72f0c3d86","abstract_canon_sha256":"6f2e70e194f554be2e9bd9fcf3ca81e10513cb7eeb5b7a5a9ba26298862415da"},"schema_version":"1.0"},"canonical_sha256":"0273c9f2fec9275304d53ad518436f227437bdbf3508132e1b2a4157290d29a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:28.518019Z","signature_b64":"+31nc1970JDwp6olBOGGxHk6fB1aF69nQPFVq1MXR5G5taeeImnuy+0VkuaGyCM0MOunHOVHZjqrt8eEXvOoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0273c9f2fec9275304d53ad518436f227437bdbf3508132e1b2a4157290d29a0","last_reissued_at":"2026-05-18T00:56:28.517338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:28.517338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09318","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:56:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZTyw46WmMxkh4Lnn7fz4/pM/iX63nGjabmRQ8oU0cWIvT58QekAtylOazpKbPeSBrIJYYZKrUbJD9tFASmHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:05:02.257941Z"},"content_sha256":"4733277e668584f2fd6362cb5e629d43b309d97adf874e3d13c60382b60975a0","schema_version":"1.0","event_id":"sha256:4733277e668584f2fd6362cb5e629d43b309d97adf874e3d13c60382b60975a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AJZ4T4X6ZETVGBGVHLKRQQ3PEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Reductions for Model Checking Concurrent Software","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Alfons Laarman, Ana Sokolova, Georg Weissenbacher, Henning G\\\"unther","submitted_at":"2016-11-28T20:11:49Z","abstract_excerpt":"Symbolic model checking of parallel programs stands and falls with effective methods of dealing with the explosion of interleavings. We propose a dynamic reduction technique to avoid unnecessary interleavings. By extending Lipton's original work with a notion of bisimilarity, we accommodate dynamic transactions, and thereby reduce dependence on the accuracy of static analysis, which is a severe bottleneck in other reduction techniques.\n  The combination of symbolic model checking and dynamic reduction techniques has proven to be challenging in the past. Our generic reduction theorem nonetheles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09318","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:56:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqTz6oX/0x+UOnMYDGfhVDnw7lRpN0w5FPQ8qZw/rBdzqTtf2NHHiOic1uDF/bHz4XxLsyRIUWqnJsalR1CSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:05:02.258282Z"},"content_sha256":"f9db3d50890db990f1d3d46bbb9f54319f55ff3c341ad754a9cd3cf1cd709d14","schema_version":"1.0","event_id":"sha256:f9db3d50890db990f1d3d46bbb9f54319f55ff3c341ad754a9cd3cf1cd709d14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJZ4T4X6ZETVGBGVHLKRQQ3PEJ/bundle.json","state_url":"https://pith.science/pith/AJZ4T4X6ZETVGBGVHLKRQQ3PEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJZ4T4X6ZETVGBGVHLKRQQ3PEJ/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-30T09:05:02Z","links":{"resolver":"https://pith.science/pith/AJZ4T4X6ZETVGBGVHLKRQQ3PEJ","bundle":"https://pith.science/pith/AJZ4T4X6ZETVGBGVHLKRQQ3PEJ/bundle.json","state":"https://pith.science/pith/AJZ4T4X6ZETVGBGVHLKRQQ3PEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJZ4T4X6ZETVGBGVHLKRQQ3PEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AJZ4T4X6ZETVGBGVHLKRQQ3PEJ","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":"6f2e70e194f554be2e9bd9fcf3ca81e10513cb7eeb5b7a5a9ba26298862415da","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-28T20:11:49Z","title_canon_sha256":"7dd016905c7108e9e5aac26cc2b7dbe04d7354aa87397d9e156743b72f0c3d86"},"schema_version":"1.0","source":{"id":"1611.09318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09318","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09318v1","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09318","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"pith_short_12","alias_value":"AJZ4T4X6ZETV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AJZ4T4X6ZETVGBGV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AJZ4T4X6","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:f9db3d50890db990f1d3d46bbb9f54319f55ff3c341ad754a9cd3cf1cd709d14","target":"graph","created_at":"2026-05-18T00:56:28Z","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":"Symbolic model checking of parallel programs stands and falls with effective methods of dealing with the explosion of interleavings. We propose a dynamic reduction technique to avoid unnecessary interleavings. By extending Lipton's original work with a notion of bisimilarity, we accommodate dynamic transactions, and thereby reduce dependence on the accuracy of static analysis, which is a severe bottleneck in other reduction techniques.\n  The combination of symbolic model checking and dynamic reduction techniques has proven to be challenging in the past. Our generic reduction theorem nonetheles","authors_text":"Alfons Laarman, Ana Sokolova, Georg Weissenbacher, Henning G\\\"unther","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-28T20:11:49Z","title":"Dynamic Reductions for Model Checking Concurrent Software"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09318","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:4733277e668584f2fd6362cb5e629d43b309d97adf874e3d13c60382b60975a0","target":"record","created_at":"2026-05-18T00:56:28Z","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":"6f2e70e194f554be2e9bd9fcf3ca81e10513cb7eeb5b7a5a9ba26298862415da","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-28T20:11:49Z","title_canon_sha256":"7dd016905c7108e9e5aac26cc2b7dbe04d7354aa87397d9e156743b72f0c3d86"},"schema_version":"1.0","source":{"id":"1611.09318","kind":"arxiv","version":1}},"canonical_sha256":"0273c9f2fec9275304d53ad518436f227437bdbf3508132e1b2a4157290d29a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0273c9f2fec9275304d53ad518436f227437bdbf3508132e1b2a4157290d29a0","first_computed_at":"2026-05-18T00:56:28.517338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:28.517338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+31nc1970JDwp6olBOGGxHk6fB1aF69nQPFVq1MXR5G5taeeImnuy+0VkuaGyCM0MOunHOVHZjqrt8eEXvOoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:28.518019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4733277e668584f2fd6362cb5e629d43b309d97adf874e3d13c60382b60975a0","sha256:f9db3d50890db990f1d3d46bbb9f54319f55ff3c341ad754a9cd3cf1cd709d14"],"state_sha256":"805b5ccb91d350c431981c86dd4a10f243cfda7da1d5b072561c6cc75fd1007b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x47PeDciF0RpvxY9HmRoBeiRnIXUgN/8ly/QIxbuGoFGIWkUkY+SJ1uuOuCJkPMRdiXRojaTLbKAdAEhIdT2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T09:05:02.260263Z","bundle_sha256":"03551840aabb98a7e0933b479367d4d6ae4441dbd8ec7be6f300458572919292"}}