{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IN4MJZSKIJZJ2FAJ3AY3G4HJ6W","short_pith_number":"pith:IN4MJZSK","canonical_record":{"source":{"id":"1509.04153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-14T15:33:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"21781a5f72b5b0b6018238dd7d39c873ac25a9d024ff93d632ec3c39dc86d899","abstract_canon_sha256":"603f689dbabe51c8ddf6e5ce3c614591f4c5740916be3657e768c09f9d77af92"},"schema_version":"1.0"},"canonical_sha256":"4378c4e64a42729d1409d831b370e9f5a8cb171990983e96a057209321ce4b16","source":{"kind":"arxiv","id":"1509.04153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04153","created_at":"2026-05-18T01:33:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04153v1","created_at":"2026-05-18T01:33:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04153","created_at":"2026-05-18T01:33:08Z"},{"alias_kind":"pith_short_12","alias_value":"IN4MJZSKIJZJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IN4MJZSKIJZJ2FAJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IN4MJZSK","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IN4MJZSKIJZJ2FAJ3AY3G4HJ6W","target":"record","payload":{"canonical_record":{"source":{"id":"1509.04153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-14T15:33:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"21781a5f72b5b0b6018238dd7d39c873ac25a9d024ff93d632ec3c39dc86d899","abstract_canon_sha256":"603f689dbabe51c8ddf6e5ce3c614591f4c5740916be3657e768c09f9d77af92"},"schema_version":"1.0"},"canonical_sha256":"4378c4e64a42729d1409d831b370e9f5a8cb171990983e96a057209321ce4b16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:08.226133Z","signature_b64":"6L+GBWIIEA4cbl27qTlYNZnmKPrRvHuRmTmfYK3Dk+fdpfOlhngDbLX5WiA5t8AL0XfA0QB6NEK/x6r6E8YDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4378c4e64a42729d1409d831b370e9f5a8cb171990983e96a057209321ce4b16","last_reissued_at":"2026-05-18T01:33:08.225577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:08.225577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.04153","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-18T01:33:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIcO5mat7o9y4DJHhT30tOr+jafKBvbxxLzWhuZYKxJaeXdpngchjrxnx+fpmQbARgQPQ2gTCfkadSeLIQzkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:57:03.358673Z"},"content_sha256":"f8bb403cd4b24d4c3bb7dde21d31b2edf9e9a1c76922b5cdff3effd580d837a1","schema_version":"1.0","event_id":"sha256:f8bb403cd4b24d4c3bb7dde21d31b2edf9e9a1c76922b5cdff3effd580d837a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IN4MJZSKIJZJ2FAJ3AY3G4HJ6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dependency-Based Information Flow Analysis with Declassification in a Program Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Bart van Delft, Richard Bubel","submitted_at":"2015-09-14T15:33:04Z","abstract_excerpt":"We present a deductive approach for the analysis of secure information flows with support for fine-grained policies that include declassifications in the form of delimited information release. By explicitly tracking the dependencies of program locations as a computation history, we maintain high precision, while avoiding the need for comparing independent program runs. By considering an explicit heap model, we argue that the proposed analysis can straightforwardly be applied on object-oriented programs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04153","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-18T01:33:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7xtMsFEGQehF1EGildHFjjIj9SM5l9deeqrFojs/48ihMMe5z+yCVMNeV7WeYwZJfkNpVXaVoHwoA+AbN6wAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:57:03.359006Z"},"content_sha256":"4527ea1600fbe6a404a533096918e6716a2e568a131183af0a2017b524a8a8ca","schema_version":"1.0","event_id":"sha256:4527ea1600fbe6a404a533096918e6716a2e568a131183af0a2017b524a8a8ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IN4MJZSKIJZJ2FAJ3AY3G4HJ6W/bundle.json","state_url":"https://pith.science/pith/IN4MJZSKIJZJ2FAJ3AY3G4HJ6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IN4MJZSKIJZJ2FAJ3AY3G4HJ6W/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-28T03:57:03Z","links":{"resolver":"https://pith.science/pith/IN4MJZSKIJZJ2FAJ3AY3G4HJ6W","bundle":"https://pith.science/pith/IN4MJZSKIJZJ2FAJ3AY3G4HJ6W/bundle.json","state":"https://pith.science/pith/IN4MJZSKIJZJ2FAJ3AY3G4HJ6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IN4MJZSKIJZJ2FAJ3AY3G4HJ6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IN4MJZSKIJZJ2FAJ3AY3G4HJ6W","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":"603f689dbabe51c8ddf6e5ce3c614591f4c5740916be3657e768c09f9d77af92","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-14T15:33:04Z","title_canon_sha256":"21781a5f72b5b0b6018238dd7d39c873ac25a9d024ff93d632ec3c39dc86d899"},"schema_version":"1.0","source":{"id":"1509.04153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04153","created_at":"2026-05-18T01:33:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04153v1","created_at":"2026-05-18T01:33:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04153","created_at":"2026-05-18T01:33:08Z"},{"alias_kind":"pith_short_12","alias_value":"IN4MJZSKIJZJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IN4MJZSKIJZJ2FAJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IN4MJZSK","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:4527ea1600fbe6a404a533096918e6716a2e568a131183af0a2017b524a8a8ca","target":"graph","created_at":"2026-05-18T01:33:08Z","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":"We present a deductive approach for the analysis of secure information flows with support for fine-grained policies that include declassifications in the form of delimited information release. By explicitly tracking the dependencies of program locations as a computation history, we maintain high precision, while avoiding the need for comparing independent program runs. By considering an explicit heap model, we argue that the proposed analysis can straightforwardly be applied on object-oriented programs.","authors_text":"Bart van Delft, Richard Bubel","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-14T15:33:04Z","title":"Dependency-Based Information Flow Analysis with Declassification in a Program Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04153","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:f8bb403cd4b24d4c3bb7dde21d31b2edf9e9a1c76922b5cdff3effd580d837a1","target":"record","created_at":"2026-05-18T01:33:08Z","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":"603f689dbabe51c8ddf6e5ce3c614591f4c5740916be3657e768c09f9d77af92","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-09-14T15:33:04Z","title_canon_sha256":"21781a5f72b5b0b6018238dd7d39c873ac25a9d024ff93d632ec3c39dc86d899"},"schema_version":"1.0","source":{"id":"1509.04153","kind":"arxiv","version":1}},"canonical_sha256":"4378c4e64a42729d1409d831b370e9f5a8cb171990983e96a057209321ce4b16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4378c4e64a42729d1409d831b370e9f5a8cb171990983e96a057209321ce4b16","first_computed_at":"2026-05-18T01:33:08.225577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:08.225577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6L+GBWIIEA4cbl27qTlYNZnmKPrRvHuRmTmfYK3Dk+fdpfOlhngDbLX5WiA5t8AL0XfA0QB6NEK/x6r6E8YDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:08.226133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8bb403cd4b24d4c3bb7dde21d31b2edf9e9a1c76922b5cdff3effd580d837a1","sha256:4527ea1600fbe6a404a533096918e6716a2e568a131183af0a2017b524a8a8ca"],"state_sha256":"d9cc3909627d9133175c684f2a14c420f2edc5e7614213dbbebbb890a39e2fb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0v3hlXj7svXFsm01LJKBwHpJOj/W6k9pzkj0MXU1+MKhCrXYlGSw9tU5btAP7Wet5oNBZR/Dvo78ZolOscXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T03:57:03.360813Z","bundle_sha256":"eea85c150f6802b14c5d86e3be9bf04eb1d382935d526a7be13400f278ad2853"}}