{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:27BLY36XARMXQKQFFSLX36RQVN","short_pith_number":"pith:27BLY36X","canonical_record":{"source":{"id":"0710.4799","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.OH","submitted_at":"2007-10-25T11:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"081a3dc85de8250193d82bfe4dce902067fa62a01fdbfebb0ee076d963c9dc8d","abstract_canon_sha256":"872f932f0f1ec8b83076edb05279887c465218eb1e9dad54ce14cde44f7f32a1"},"schema_version":"1.0"},"canonical_sha256":"d7c2bc6fd70459782a052c977dfa30ab6e935b033fe22f03db858bfa18e9fc3e","source":{"kind":"arxiv","id":"0710.4799","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.4799","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"0710.4799v1","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4799","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"27BLY36XARMX","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"27BLY36XARMXQKQF","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"27BLY36X","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:27BLY36XARMXQKQFFSLX36RQVN","target":"record","payload":{"canonical_record":{"source":{"id":"0710.4799","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.OH","submitted_at":"2007-10-25T11:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"081a3dc85de8250193d82bfe4dce902067fa62a01fdbfebb0ee076d963c9dc8d","abstract_canon_sha256":"872f932f0f1ec8b83076edb05279887c465218eb1e9dad54ce14cde44f7f32a1"},"schema_version":"1.0"},"canonical_sha256":"d7c2bc6fd70459782a052c977dfa30ab6e935b033fe22f03db858bfa18e9fc3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:05.255524Z","signature_b64":"yoQYeg5SUEmk1DwrJcuogEhlUz/FlEecxkd2QnsLeJx7SH/jkx9obb4byNmV1wptHJ0vY1/ol3PDy/8JUZiHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7c2bc6fd70459782a052c977dfa30ab6e935b033fe22f03db858bfa18e9fc3e","last_reissued_at":"2026-05-18T04:09:05.254804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:05.254804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0710.4799","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-18T04:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvDxkaA7hn49wl85SQu7wrlxcf+hBXz4VGwo1e/p03QzBVEpgMdvZGasjFkWxrbJ0VE9qRj7Vw+ouT3H32GmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:07:34.793099Z"},"content_sha256":"7d325f9c48dc61a8120895dc2fd42e6d4363eb62dfa066cc9bce28a56831ba61","schema_version":"1.0","event_id":"sha256:7d325f9c48dc61a8120895dc2fd42e6d4363eb62dfa066cc9bce28a56831ba61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:27BLY36XARMXQKQFFSLX36RQVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Access Pattern-Based Code Compression for Memory-Constrained Embedded Systems","license":"","headline":"","cross_cats":[],"primary_cat":"cs.OH","authors_text":"H. Saputra, I. Kolcu, M. Kandemir, O. Ozturk","submitted_at":"2007-10-25T11:54:46Z","abstract_excerpt":"As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of satisfying these constraints is to compress executable code and data as much as possible. While research on code compression have studied efficient hardware and software based code strategies, many of these techniques do not take application behavior into a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4799","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-18T04:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIoIipLS+QEQ0sajW1w02z+CWueyJhhIedUBLs00G0T93otVR4pmwcKQ+li5gjNsqqFjNebjrHecCpQalGYtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:07:34.793465Z"},"content_sha256":"184ff35d2886f31a68dba93d58d7b4d9dbc0271b7db512c4ce7f3064f700b159","schema_version":"1.0","event_id":"sha256:184ff35d2886f31a68dba93d58d7b4d9dbc0271b7db512c4ce7f3064f700b159"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27BLY36XARMXQKQFFSLX36RQVN/bundle.json","state_url":"https://pith.science/pith/27BLY36XARMXQKQFFSLX36RQVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27BLY36XARMXQKQFFSLX36RQVN/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-02T11:07:34Z","links":{"resolver":"https://pith.science/pith/27BLY36XARMXQKQFFSLX36RQVN","bundle":"https://pith.science/pith/27BLY36XARMXQKQFFSLX36RQVN/bundle.json","state":"https://pith.science/pith/27BLY36XARMXQKQFFSLX36RQVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27BLY36XARMXQKQFFSLX36RQVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:27BLY36XARMXQKQFFSLX36RQVN","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":"872f932f0f1ec8b83076edb05279887c465218eb1e9dad54ce14cde44f7f32a1","cross_cats_sorted":[],"license":"","primary_cat":"cs.OH","submitted_at":"2007-10-25T11:54:46Z","title_canon_sha256":"081a3dc85de8250193d82bfe4dce902067fa62a01fdbfebb0ee076d963c9dc8d"},"schema_version":"1.0","source":{"id":"0710.4799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.4799","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"0710.4799v1","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4799","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"27BLY36XARMX","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"27BLY36XARMXQKQF","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"27BLY36X","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:184ff35d2886f31a68dba93d58d7b4d9dbc0271b7db512c4ce7f3064f700b159","target":"graph","created_at":"2026-05-18T04:09:05Z","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":"As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of satisfying these constraints is to compress executable code and data as much as possible. While research on code compression have studied efficient hardware and software based code strategies, many of these techniques do not take application behavior into a","authors_text":"H. Saputra, I. Kolcu, M. Kandemir, O. Ozturk","cross_cats":[],"headline":"","license":"","primary_cat":"cs.OH","submitted_at":"2007-10-25T11:54:46Z","title":"Access Pattern-Based Code Compression for Memory-Constrained Embedded Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4799","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:7d325f9c48dc61a8120895dc2fd42e6d4363eb62dfa066cc9bce28a56831ba61","target":"record","created_at":"2026-05-18T04:09:05Z","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":"872f932f0f1ec8b83076edb05279887c465218eb1e9dad54ce14cde44f7f32a1","cross_cats_sorted":[],"license":"","primary_cat":"cs.OH","submitted_at":"2007-10-25T11:54:46Z","title_canon_sha256":"081a3dc85de8250193d82bfe4dce902067fa62a01fdbfebb0ee076d963c9dc8d"},"schema_version":"1.0","source":{"id":"0710.4799","kind":"arxiv","version":1}},"canonical_sha256":"d7c2bc6fd70459782a052c977dfa30ab6e935b033fe22f03db858bfa18e9fc3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7c2bc6fd70459782a052c977dfa30ab6e935b033fe22f03db858bfa18e9fc3e","first_computed_at":"2026-05-18T04:09:05.254804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:05.254804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yoQYeg5SUEmk1DwrJcuogEhlUz/FlEecxkd2QnsLeJx7SH/jkx9obb4byNmV1wptHJ0vY1/ol3PDy/8JUZiHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:05.255524Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.4799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d325f9c48dc61a8120895dc2fd42e6d4363eb62dfa066cc9bce28a56831ba61","sha256:184ff35d2886f31a68dba93d58d7b4d9dbc0271b7db512c4ce7f3064f700b159"],"state_sha256":"afe69fe191dad98ba8fa04075b4c468104475be92a19912b6bfd0db3ce54b2ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/FdCgcOjCD4axOKORSYPfBxay+9tUbRG7230r6M6zYOMPPLJrFGFLcH9sAGArRC2KQXBQ1cPk6IXorAtJTmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:07:34.795595Z","bundle_sha256":"9e8371268b5e57cc265e04920e5a5bea5c51efc9d3f03284f4c70033f3541f1a"}}