{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QBJEUUQZYUEV5HHRWGQ3CE72QF","short_pith_number":"pith:QBJEUUQZ","schema_version":"1.0","canonical_sha256":"80524a5219c5095e9cf1b1a1b113fa817199111a492e93b7bf97ba0c204aa477","source":{"kind":"arxiv","id":"1906.01838","version":3},"attestation_state":"computed","paper":{"title":"Practical Byte-Granular Memory Blacklisting using Califorms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Hiroshi Sasaki, Kanad Sinha, Koustubha Bhat, Miguel A. Arroyo, M. Tarek Ibn Ziad, Simha Sethumadhavan","submitted_at":"2019-06-05T05:52:23Z","abstract_excerpt":"Recent rapid strides in memory safety tools and hardware have improved software quality and security. While coarse-grained memory safety has improved, achieving memory safety at the granularity of individual objects remains a challenge due to high performance overheads which can be between ~1.7x-2.2x. In this paper, we present a novel idea called Califorms, and associated program observations, to obtain a low overhead security solution for practical, byte-granular memory safety.\n  The idea we build on is called memory blacklisting, which prohibits a program from accessing certain memory region"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.01838","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-06-05T05:52:23Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"e25a7f4cc194c0e59a78cc574841c5232496e3e5f86dabef99b61379c2538fb1","abstract_canon_sha256":"3feb38925da6f0619ef6ac72b61c39d08709edc101ee3198cc314d97f1d48e0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:49.051274Z","signature_b64":"IBgDopWS62idIXhsbKriNd0mSc3JpQL+JaMjM6Rhglp+l02p5GKDwfaC8smBPYLNAhd1/+eyATfFrlDVIH4EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80524a5219c5095e9cf1b1a1b113fa817199111a492e93b7bf97ba0c204aa477","last_reissued_at":"2026-05-17T23:43:49.050624Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:49.050624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Byte-Granular Memory Blacklisting using Califorms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Hiroshi Sasaki, Kanad Sinha, Koustubha Bhat, Miguel A. Arroyo, M. Tarek Ibn Ziad, Simha Sethumadhavan","submitted_at":"2019-06-05T05:52:23Z","abstract_excerpt":"Recent rapid strides in memory safety tools and hardware have improved software quality and security. While coarse-grained memory safety has improved, achieving memory safety at the granularity of individual objects remains a challenge due to high performance overheads which can be between ~1.7x-2.2x. In this paper, we present a novel idea called Califorms, and associated program observations, to obtain a low overhead security solution for practical, byte-granular memory safety.\n  The idea we build on is called memory blacklisting, which prohibits a program from accessing certain memory region"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01838","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.01838","created_at":"2026-05-17T23:43:49.050723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01838v3","created_at":"2026-05-17T23:43:49.050723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01838","created_at":"2026-05-17T23:43:49.050723+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBJEUUQZYUEV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBJEUUQZYUEV5HHR","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBJEUUQZ","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13210","citing_title":"PoisonCap: Efficient Hierarchical Temporal Safety for CHERI","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF","json":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF.json","graph_json":"https://pith.science/api/pith-number/QBJEUUQZYUEV5HHRWGQ3CE72QF/graph.json","events_json":"https://pith.science/api/pith-number/QBJEUUQZYUEV5HHRWGQ3CE72QF/events.json","paper":"https://pith.science/paper/QBJEUUQZ"},"agent_actions":{"view_html":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF","download_json":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF.json","view_paper":"https://pith.science/paper/QBJEUUQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01838&json=true","fetch_graph":"https://pith.science/api/pith-number/QBJEUUQZYUEV5HHRWGQ3CE72QF/graph.json","fetch_events":"https://pith.science/api/pith-number/QBJEUUQZYUEV5HHRWGQ3CE72QF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF/action/storage_attestation","attest_author":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF/action/author_attestation","sign_citation":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF/action/citation_signature","submit_replication":"https://pith.science/pith/QBJEUUQZYUEV5HHRWGQ3CE72QF/action/replication_record"}},"created_at":"2026-05-17T23:43:49.050723+00:00","updated_at":"2026-05-17T23:43:49.050723+00:00"}