{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VU62QB7CWHMQNVO6MJAV4Z26QF","short_pith_number":"pith:VU62QB7C","canonical_record":{"source":{"id":"1701.08114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-27T16:55:51Z","cross_cats_sorted":[],"title_canon_sha256":"0efa9af0d7ee289925416d623442496e16c68f0ac597a06039676eeff16ca000","abstract_canon_sha256":"54cee93de7c16ab264ae582fdc188dbf374650b3ad2a56e6c0749804d2b61060"},"schema_version":"1.0"},"canonical_sha256":"ad3da807e2b1d906d5de62415e675e816948a8ab59e59d7263f9a77a939d5c79","source":{"kind":"arxiv","id":"1701.08114","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08114","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08114v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08114","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"VU62QB7CWHMQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VU62QB7CWHMQNVO6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VU62QB7C","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VU62QB7CWHMQNVO6MJAV4Z26QF","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-27T16:55:51Z","cross_cats_sorted":[],"title_canon_sha256":"0efa9af0d7ee289925416d623442496e16c68f0ac597a06039676eeff16ca000","abstract_canon_sha256":"54cee93de7c16ab264ae582fdc188dbf374650b3ad2a56e6c0749804d2b61060"},"schema_version":"1.0"},"canonical_sha256":"ad3da807e2b1d906d5de62415e675e816948a8ab59e59d7263f9a77a939d5c79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:39.282927Z","signature_b64":"nRH2YrSiCsNsq8wm2sTDDx9TTdAibopb19Us6gjyh1t5LuBBXey2fW9q79RI4mbwxDy/gseOE2+m+oqrNZX1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad3da807e2b1d906d5de62415e675e816948a8ab59e59d7263f9a77a939d5c79","last_reissued_at":"2026-05-18T00:51:39.282561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:39.282561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08114","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:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A67JYU3hD6amMefBXaWJXJlJCklu1OnMocHc6ZLFw03xO/N79G8eAKfFQGWOSMB5EXBeh+ar5+6/ydX6D51pDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:54:12.022923Z"},"content_sha256":"e0bcc94b0531330cae514c06d300e5df7e327a63cb7a4e186f3f4f8c5526bb41","schema_version":"1.0","event_id":"sha256:e0bcc94b0531330cae514c06d300e5df7e327a63cb7a4e186f3f4f8c5526bb41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VU62QB7CWHMQNVO6MJAV4Z26QF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Analysis of C Programs by Rewriting Variability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aleksandar S. Dimovski (IT University of Copenhagen, Alexandru Florin Iosif-Lazar (IT University of Copenhagen, Andrzej Wasowski (IT University of Copenhagen, Claus Brabrand (IT University of Copenhagen, Denmark), Jean Melo (IT University of Copenhagen","submitted_at":"2017-01-27T16:55:51Z","abstract_excerpt":"Context. Variability-intensive programs (program families) appear in many application areas and for many reasons today. Different family members, called variants, are derived by switching statically configurable options (features) on and off, while reuse of the common code is maximized. \n\nInquiry. Verification of program families is challenging since the number of variants is exponential in the number of features. Existing single-program analysis and verification tools cannot be applied directly to program families, and designing and implementing the corresponding variability-aware versions is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08114","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:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9kkygrLtPde17RBMgyffltML2DLKMfHXgEjjznoweQiDWq4kmdk7ehfQKLbdNpJTPOct3K3505YF5saKPaFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:54:12.023622Z"},"content_sha256":"6d54e2f2698f44958f7a9b50e2b298b9cac677af0c2783b69a0f7ecbe167d92d","schema_version":"1.0","event_id":"sha256:6d54e2f2698f44958f7a9b50e2b298b9cac677af0c2783b69a0f7ecbe167d92d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VU62QB7CWHMQNVO6MJAV4Z26QF/bundle.json","state_url":"https://pith.science/pith/VU62QB7CWHMQNVO6MJAV4Z26QF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VU62QB7CWHMQNVO6MJAV4Z26QF/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-06T12:54:12Z","links":{"resolver":"https://pith.science/pith/VU62QB7CWHMQNVO6MJAV4Z26QF","bundle":"https://pith.science/pith/VU62QB7CWHMQNVO6MJAV4Z26QF/bundle.json","state":"https://pith.science/pith/VU62QB7CWHMQNVO6MJAV4Z26QF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VU62QB7CWHMQNVO6MJAV4Z26QF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VU62QB7CWHMQNVO6MJAV4Z26QF","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":"54cee93de7c16ab264ae582fdc188dbf374650b3ad2a56e6c0749804d2b61060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-27T16:55:51Z","title_canon_sha256":"0efa9af0d7ee289925416d623442496e16c68f0ac597a06039676eeff16ca000"},"schema_version":"1.0","source":{"id":"1701.08114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08114","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08114v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08114","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"VU62QB7CWHMQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VU62QB7CWHMQNVO6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VU62QB7C","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:6d54e2f2698f44958f7a9b50e2b298b9cac677af0c2783b69a0f7ecbe167d92d","target":"graph","created_at":"2026-05-18T00:51:39Z","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":"Context. Variability-intensive programs (program families) appear in many application areas and for many reasons today. Different family members, called variants, are derived by switching statically configurable options (features) on and off, while reuse of the common code is maximized. \n\nInquiry. Verification of program families is challenging since the number of variants is exponential in the number of features. Existing single-program analysis and verification tools cannot be applied directly to program families, and designing and implementing the corresponding variability-aware versions is","authors_text":"Aleksandar S. Dimovski (IT University of Copenhagen, Alexandru Florin Iosif-Lazar (IT University of Copenhagen, Andrzej Wasowski (IT University of Copenhagen, Claus Brabrand (IT University of Copenhagen, Denmark), Jean Melo (IT University of Copenhagen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-27T16:55:51Z","title":"Effective Analysis of C Programs by Rewriting Variability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08114","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:e0bcc94b0531330cae514c06d300e5df7e327a63cb7a4e186f3f4f8c5526bb41","target":"record","created_at":"2026-05-18T00:51:39Z","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":"54cee93de7c16ab264ae582fdc188dbf374650b3ad2a56e6c0749804d2b61060","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-27T16:55:51Z","title_canon_sha256":"0efa9af0d7ee289925416d623442496e16c68f0ac597a06039676eeff16ca000"},"schema_version":"1.0","source":{"id":"1701.08114","kind":"arxiv","version":1}},"canonical_sha256":"ad3da807e2b1d906d5de62415e675e816948a8ab59e59d7263f9a77a939d5c79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad3da807e2b1d906d5de62415e675e816948a8ab59e59d7263f9a77a939d5c79","first_computed_at":"2026-05-18T00:51:39.282561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:39.282561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nRH2YrSiCsNsq8wm2sTDDx9TTdAibopb19Us6gjyh1t5LuBBXey2fW9q79RI4mbwxDy/gseOE2+m+oqrNZX1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:39.282927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0bcc94b0531330cae514c06d300e5df7e327a63cb7a4e186f3f4f8c5526bb41","sha256:6d54e2f2698f44958f7a9b50e2b298b9cac677af0c2783b69a0f7ecbe167d92d"],"state_sha256":"1098cf461b1172a28f4ff34d01a59b87e61a184231c699638e97d9bae5c472ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qE34dnvTbsGEmrF2MtvgMfjBFc+w2rjH0vz6SRyioGcDKYN60k1Qak7vxmC42mz11U/Oyf7XBx/qlMXHaxS8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:54:12.026223Z","bundle_sha256":"d9de6417bc7e163c3430ad4917bd0fc1c1651cf3403a20847a5d20e6f1be8104"}}