{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WVBC2FTTV7NWYVFVP76UE65ILB","short_pith_number":"pith:WVBC2FTT","canonical_record":{"source":{"id":"1407.4075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-07-14T17:55:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"97330ef7213fb0897ffbeb3c4deae4d70a530d2e805c4bab7417cd6afd3956fe","abstract_canon_sha256":"5c904b9cb010e7adec4f3225b36c6660a31f1ef71a0422d9f58d2047461a0681"},"schema_version":"1.0"},"canonical_sha256":"b5422d1673afdb6c54b57ffd427ba858768fb5f7a1fcf51a92630024f45d8d93","source":{"kind":"arxiv","id":"1407.4075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4075","created_at":"2026-05-18T02:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4075v1","created_at":"2026-05-18T02:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4075","created_at":"2026-05-18T02:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"WVBC2FTTV7NW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WVBC2FTTV7NWYVFV","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WVBC2FTT","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WVBC2FTTV7NWYVFVP76UE65ILB","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-07-14T17:55:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"97330ef7213fb0897ffbeb3c4deae4d70a530d2e805c4bab7417cd6afd3956fe","abstract_canon_sha256":"5c904b9cb010e7adec4f3225b36c6660a31f1ef71a0422d9f58d2047461a0681"},"schema_version":"1.0"},"canonical_sha256":"b5422d1673afdb6c54b57ffd427ba858768fb5f7a1fcf51a92630024f45d8d93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:32.003360Z","signature_b64":"hOeZUXwa0IY/hHXb4MqR9cExA/1hU8XAPJvBrQUj5715yr49+sEWMCo9lwYdHCwKVVsndTZJjLBfoweD8PjDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5422d1673afdb6c54b57ffd427ba858768fb5f7a1fcf51a92630024f45d8d93","last_reissued_at":"2026-05-18T02:47:32.002839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:32.002839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4075","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-18T02:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRjd+ty+PJtwa6MbyduoW8/To7rCDicEmoIYtvAP+wgXL5W24RIPjO2rCAmEXrbAeWksPAKi7DTbJ1lz9C05Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:51:30.647954Z"},"content_sha256":"96268bf592e261ba09f3ea6fa14be60217213d4428b28d5ba8e86c06cfb78a9f","schema_version":"1.0","event_id":"sha256:96268bf592e261ba09f3ea6fa14be60217213d4428b28d5ba8e86c06cfb78a9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WVBC2FTTV7NWYVFVP76UE65ILB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding representative sets of optimizations for adaptive multiversioning applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Chengyong Wu, Grigori Fursin, Lianjie Luo, Shun Long, Yang Chen","submitted_at":"2014-07-14T17:55:07Z","abstract_excerpt":"Iterative compilation is a widely adopted technique to optimize programs for different constraints such as performance, code size and power consumption in rapidly evolving hardware and software environments. However, in case of statically compiled programs, it is often restricted to optimizations for a specific dataset and may not be applicable to applications that exhibit different run-time behavior across program phases, multiple datasets or when executed in heterogeneous, reconfigurable and virtual environments. Several frameworks have been recently introduced to tackle these problems and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4075","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-18T02:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1RfuFH62QjMXqlTUc6eA+u/DK7HCRSPItUoUfaUD90Y8JuRT9fN+hZMJfeeYjjyyUJ5pBDH6aZWmqp2iF+vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:51:30.648301Z"},"content_sha256":"43ada9e4f3771913fd9d38820bbeec97ca0fd7e58ede4910b7962e220f845a85","schema_version":"1.0","event_id":"sha256:43ada9e4f3771913fd9d38820bbeec97ca0fd7e58ede4910b7962e220f845a85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVBC2FTTV7NWYVFVP76UE65ILB/bundle.json","state_url":"https://pith.science/pith/WVBC2FTTV7NWYVFVP76UE65ILB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVBC2FTTV7NWYVFVP76UE65ILB/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-23T14:51:30Z","links":{"resolver":"https://pith.science/pith/WVBC2FTTV7NWYVFVP76UE65ILB","bundle":"https://pith.science/pith/WVBC2FTTV7NWYVFVP76UE65ILB/bundle.json","state":"https://pith.science/pith/WVBC2FTTV7NWYVFVP76UE65ILB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVBC2FTTV7NWYVFVP76UE65ILB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WVBC2FTTV7NWYVFVP76UE65ILB","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":"5c904b9cb010e7adec4f3225b36c6660a31f1ef71a0422d9f58d2047461a0681","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-07-14T17:55:07Z","title_canon_sha256":"97330ef7213fb0897ffbeb3c4deae4d70a530d2e805c4bab7417cd6afd3956fe"},"schema_version":"1.0","source":{"id":"1407.4075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4075","created_at":"2026-05-18T02:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4075v1","created_at":"2026-05-18T02:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4075","created_at":"2026-05-18T02:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"WVBC2FTTV7NW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WVBC2FTTV7NWYVFV","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WVBC2FTT","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:43ada9e4f3771913fd9d38820bbeec97ca0fd7e58ede4910b7962e220f845a85","target":"graph","created_at":"2026-05-18T02:47:32Z","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":"Iterative compilation is a widely adopted technique to optimize programs for different constraints such as performance, code size and power consumption in rapidly evolving hardware and software environments. However, in case of statically compiled programs, it is often restricted to optimizations for a specific dataset and may not be applicable to applications that exhibit different run-time behavior across program phases, multiple datasets or when executed in heterogeneous, reconfigurable and virtual environments. Several frameworks have been recently introduced to tackle these problems and e","authors_text":"Chengyong Wu, Grigori Fursin, Lianjie Luo, Shun Long, Yang Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-07-14T17:55:07Z","title":"Finding representative sets of optimizations for adaptive multiversioning applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4075","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:96268bf592e261ba09f3ea6fa14be60217213d4428b28d5ba8e86c06cfb78a9f","target":"record","created_at":"2026-05-18T02:47:32Z","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":"5c904b9cb010e7adec4f3225b36c6660a31f1ef71a0422d9f58d2047461a0681","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-07-14T17:55:07Z","title_canon_sha256":"97330ef7213fb0897ffbeb3c4deae4d70a530d2e805c4bab7417cd6afd3956fe"},"schema_version":"1.0","source":{"id":"1407.4075","kind":"arxiv","version":1}},"canonical_sha256":"b5422d1673afdb6c54b57ffd427ba858768fb5f7a1fcf51a92630024f45d8d93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5422d1673afdb6c54b57ffd427ba858768fb5f7a1fcf51a92630024f45d8d93","first_computed_at":"2026-05-18T02:47:32.002839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:32.002839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hOeZUXwa0IY/hHXb4MqR9cExA/1hU8XAPJvBrQUj5715yr49+sEWMCo9lwYdHCwKVVsndTZJjLBfoweD8PjDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:32.003360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96268bf592e261ba09f3ea6fa14be60217213d4428b28d5ba8e86c06cfb78a9f","sha256:43ada9e4f3771913fd9d38820bbeec97ca0fd7e58ede4910b7962e220f845a85"],"state_sha256":"cac63097a65e60d8fc055e22040d539cb7b0d0f0f355fb32369980b4b4231a1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXlpX9om4RPCpA5zYI2tdnFezWkEjOIYfKO2UHERBJGujnkCBT4g4xiadFvHBugIV1MK9ecB39kZBX12Kbj2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:51:30.650210Z","bundle_sha256":"6227d86861a0d67f30156bd60916cce2e70b8d62f30ccc75b5e738f7a9f03545"}}