{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ATUBFEYHTOPS74BWFMNMDPDZEV","short_pith_number":"pith:ATUBFEYH","canonical_record":{"source":{"id":"0801.1687","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-10T21:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"20aa583da2bfed04ee349f0d11e35389faf952cc5cb1e08ca31551c6b4743962","abstract_canon_sha256":"fb8f668832a01d449968757d11d98f7c6ecc79c338bb9c76a191877774a74423"},"schema_version":"1.0"},"canonical_sha256":"04e81293079b9f2ff0362b1ac1bc79256e7fc6a7af1c9e1f0ae3495f6e96e4cd","source":{"kind":"arxiv","id":"0801.1687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.1687","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"0801.1687v1","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.1687","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"ATUBFEYHTOPS","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"pith_short_16","alias_value":"ATUBFEYHTOPS74BW","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"pith_short_8","alias_value":"ATUBFEYH","created_at":"2026-07-04T15:06:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ATUBFEYHTOPS74BWFMNMDPDZEV","target":"record","payload":{"canonical_record":{"source":{"id":"0801.1687","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-10T21:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"20aa583da2bfed04ee349f0d11e35389faf952cc5cb1e08ca31551c6b4743962","abstract_canon_sha256":"fb8f668832a01d449968757d11d98f7c6ecc79c338bb9c76a191877774a74423"},"schema_version":"1.0"},"canonical_sha256":"04e81293079b9f2ff0362b1ac1bc79256e7fc6a7af1c9e1f0ae3495f6e96e4cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:46.133608Z","signature_b64":"P4dAA1NiQQyKI13Dvw0KCYz8Kw1ZAHEvTIPQrKPAU+evLMlASn65YBziqTD1tnR2wors1N8QijwP2FJvGlraBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04e81293079b9f2ff0362b1ac1bc79256e7fc6a7af1c9e1f0ae3495f6e96e4cd","last_reissued_at":"2026-07-04T15:06:46.133228Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:46.133228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0801.1687","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-07-04T15:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2a3wHxHkyi8gEif6q4H7Q2swVYbfaxP4gJQTofPRP7mzcv5iMBkMqWY5mHv2SMCI+qAebYpORKg8FuXF13KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:53:33.596518Z"},"content_sha256":"331279c3d4d10f7e8ba4a109af20460cb46888090b267d69c4470a1c82648a4f","schema_version":"1.0","event_id":"sha256:331279c3d4d10f7e8ba4a109af20460cb46888090b267d69c4470a1c82648a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ATUBFEYHTOPS74BWFMNMDPDZEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Paul C. Attie","submitted_at":"2008-01-10T21:27:42Z","abstract_excerpt":"We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The programs we synthesize are dynamic: new processes can be created and added at run-time, and so our programs are not finite-state, in general. Nevertheless, we successfully exploit automatic synthesis and model-checking methods based on propositional temporal logic. Our method is algorithmically efficient, with complexity polynomial in the number of component p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.1687","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0801.1687/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqoQ8NYJKi/NMC4y4vWcvK2Zk8yivxc15sC7WaWI1vefZyqD4kWG5AU1tyRfand4+JPHqArSepjs6eFU8df4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:53:33.596918Z"},"content_sha256":"3d80b75af52f150eebbea9afa5a3b184e7899bd1fccb22d6562a5f31bb0f2fd5","schema_version":"1.0","event_id":"sha256:3d80b75af52f150eebbea9afa5a3b184e7899bd1fccb22d6562a5f31bb0f2fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/bundle.json","state_url":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/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-07-05T06:53:33Z","links":{"resolver":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV","bundle":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/bundle.json","state":"https://pith.science/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATUBFEYHTOPS74BWFMNMDPDZEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ATUBFEYHTOPS74BWFMNMDPDZEV","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":"fb8f668832a01d449968757d11d98f7c6ecc79c338bb9c76a191877774a74423","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-10T21:27:42Z","title_canon_sha256":"20aa583da2bfed04ee349f0d11e35389faf952cc5cb1e08ca31551c6b4743962"},"schema_version":"1.0","source":{"id":"0801.1687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.1687","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"0801.1687v1","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.1687","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"ATUBFEYHTOPS","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"pith_short_16","alias_value":"ATUBFEYHTOPS74BW","created_at":"2026-07-04T15:06:46Z"},{"alias_kind":"pith_short_8","alias_value":"ATUBFEYH","created_at":"2026-07-04T15:06:46Z"}],"graph_snapshots":[{"event_id":"sha256:3d80b75af52f150eebbea9afa5a3b184e7899bd1fccb22d6562a5f31bb0f2fd5","target":"graph","created_at":"2026-07-04T15:06:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0801.1687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store conditional, etc. The programs we synthesize are dynamic: new processes can be created and added at run-time, and so our programs are not finite-state, in general. Nevertheless, we successfully exploit automatic synthesis and model-checking methods based on propositional temporal logic. Our method is algorithmically efficient, with complexity polynomial in the number of component p","authors_text":"Paul C. Attie","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2008-01-10T21:27:42Z","title":"Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.1687","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:331279c3d4d10f7e8ba4a109af20460cb46888090b267d69c4470a1c82648a4f","target":"record","created_at":"2026-07-04T15:06:46Z","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":"fb8f668832a01d449968757d11d98f7c6ecc79c338bb9c76a191877774a74423","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2008-01-10T21:27:42Z","title_canon_sha256":"20aa583da2bfed04ee349f0d11e35389faf952cc5cb1e08ca31551c6b4743962"},"schema_version":"1.0","source":{"id":"0801.1687","kind":"arxiv","version":1}},"canonical_sha256":"04e81293079b9f2ff0362b1ac1bc79256e7fc6a7af1c9e1f0ae3495f6e96e4cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04e81293079b9f2ff0362b1ac1bc79256e7fc6a7af1c9e1f0ae3495f6e96e4cd","first_computed_at":"2026-07-04T15:06:46.133228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:06:46.133228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4dAA1NiQQyKI13Dvw0KCYz8Kw1ZAHEvTIPQrKPAU+evLMlASn65YBziqTD1tnR2wors1N8QijwP2FJvGlraBA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:06:46.133608Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.1687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:331279c3d4d10f7e8ba4a109af20460cb46888090b267d69c4470a1c82648a4f","sha256:3d80b75af52f150eebbea9afa5a3b184e7899bd1fccb22d6562a5f31bb0f2fd5"],"state_sha256":"f01107ccd1465c3aa11bb5bf89f1f43431c2874f538490312b4059f0bfbb2578"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBv1QuAkzsnIT5YBq9Kj/QQBq80deVyvNHEnfk/vxfdusGjOG+4FUl+pRa1KAufvB5sE+eM1sN5EyekQIw02Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T06:53:33.599065Z","bundle_sha256":"22f2ac902c4a0ca3d026d8980d26afb0acac48ff583fdc988a42dccdcd709e9a"}}