{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JYY3KTHLFEOJZI2I53ZWIS5F7V","short_pith_number":"pith:JYY3KTHL","schema_version":"1.0","canonical_sha256":"4e31b54ceb291c9ca348eef3644ba5fd4a38fa163bd9f75c043a8cee9c836fcd","source":{"kind":"arxiv","id":"1607.02225","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Information Flow Analysis for Programs with Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Gerg\\\"o Barany (CEA, LIST, Software Reliability Laboratory)","submitted_at":"2016-07-08T05:30:24Z","abstract_excerpt":"Information flow analysis checks whether certain pieces of (confidential) data may affect the results of computations in unwanted ways and thus leak information. Dynamic information flow analysis adds instrumentation code to the target software to track flows at run time and raise alarms if a flow policy is violated; hybrid analyses combine this with preliminary static analysis.\n  Using a subset of C as the target language, we extend previous work on hybrid information flow analysis that handled pointers to scalars. Our extended formulation handles arrays, pointers to array elements, and point"},"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":"1607.02225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-08T05:30:24Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"7e6b01836260e842082dcd9d90adf534c2f938db3bddfd9d32b128312876f9a0","abstract_canon_sha256":"45d3e36ea3d60dc4e06ad121accf43f4ab10bd226ba8b5e21aa152833b60f7ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.984242Z","signature_b64":"o5H+dUna40ei5PFjB7qTJxg+MgV9oAZJpeL3iRseJHZNhO0Yf/7lVFDbOCpAwgNIgEyxuktg3tALue+Uw64lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e31b54ceb291c9ca348eef3644ba5fd4a38fa163bd9f75c043a8cee9c836fcd","last_reissued_at":"2026-05-18T01:11:20.983787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.983787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Information Flow Analysis for Programs with Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Gerg\\\"o Barany (CEA, LIST, Software Reliability Laboratory)","submitted_at":"2016-07-08T05:30:24Z","abstract_excerpt":"Information flow analysis checks whether certain pieces of (confidential) data may affect the results of computations in unwanted ways and thus leak information. Dynamic information flow analysis adds instrumentation code to the target software to track flows at run time and raise alarms if a flow policy is violated; hybrid analyses combine this with preliminary static analysis.\n  Using a subset of C as the target language, we extend previous work on hybrid information flow analysis that handled pointers to scalars. Our extended formulation handles arrays, pointers to array elements, and point"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02225","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.02225","created_at":"2026-05-18T01:11:20.983860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02225v1","created_at":"2026-05-18T01:11:20.983860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02225","created_at":"2026-05-18T01:11:20.983860+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYY3KTHLFEOJ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYY3KTHLFEOJZI2I","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYY3KTHL","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V","json":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V.json","graph_json":"https://pith.science/api/pith-number/JYY3KTHLFEOJZI2I53ZWIS5F7V/graph.json","events_json":"https://pith.science/api/pith-number/JYY3KTHLFEOJZI2I53ZWIS5F7V/events.json","paper":"https://pith.science/paper/JYY3KTHL"},"agent_actions":{"view_html":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V","download_json":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V.json","view_paper":"https://pith.science/paper/JYY3KTHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02225&json=true","fetch_graph":"https://pith.science/api/pith-number/JYY3KTHLFEOJZI2I53ZWIS5F7V/graph.json","fetch_events":"https://pith.science/api/pith-number/JYY3KTHLFEOJZI2I53ZWIS5F7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V/action/storage_attestation","attest_author":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V/action/author_attestation","sign_citation":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V/action/citation_signature","submit_replication":"https://pith.science/pith/JYY3KTHLFEOJZI2I53ZWIS5F7V/action/replication_record"}},"created_at":"2026-05-18T01:11:20.983860+00:00","updated_at":"2026-05-18T01:11:20.983860+00:00"}