{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XR2JX7W5OAX22IW44Q6VFWPJG3","short_pith_number":"pith:XR2JX7W5","canonical_record":{"source":{"id":"1306.6856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-06-28T14:38:13Z","cross_cats_sorted":[],"title_canon_sha256":"97b67d48a8dc5f28fd9742fed76493fa6b5e825e1e0b14863edc689b2681b838","abstract_canon_sha256":"6e63d414f202115ce7db1558764811b781617fedb371f6ed917576ce3d1ebe0e"},"schema_version":"1.0"},"canonical_sha256":"bc749bfedd702fad22dce43d52d9e936ea60e71207fbe91a9c57ec88a4e58bc8","source":{"kind":"arxiv","id":"1306.6856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6856","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6856v1","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6856","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"XR2JX7W5OAX2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XR2JX7W5OAX22IW4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XR2JX7W5","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XR2JX7W5OAX22IW44Q6VFWPJG3","target":"record","payload":{"canonical_record":{"source":{"id":"1306.6856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-06-28T14:38:13Z","cross_cats_sorted":[],"title_canon_sha256":"97b67d48a8dc5f28fd9742fed76493fa6b5e825e1e0b14863edc689b2681b838","abstract_canon_sha256":"6e63d414f202115ce7db1558764811b781617fedb371f6ed917576ce3d1ebe0e"},"schema_version":"1.0"},"canonical_sha256":"bc749bfedd702fad22dce43d52d9e936ea60e71207fbe91a9c57ec88a4e58bc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:42.727295Z","signature_b64":"1vnLYL3PuZntywe2pOKlg2WJ3SCs/VpT0FO1IyBRamSjIbfSwJsqNs2xF3nbu4xCNh6Z9ec2a6Bt8ZandyHxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc749bfedd702fad22dce43d52d9e936ea60e71207fbe91a9c57ec88a4e58bc8","last_reissued_at":"2026-05-18T03:19:42.726496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:42.726496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.6856","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-18T03:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRlDoNHQneSZFUYeoX8y8MIBBdcHx/rOldB5SdRBAuka44vAqXeaAeNJDG71xoxAKr6LB1iI6sYWxIcNktijCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:14:59.150365Z"},"content_sha256":"42b05ee6c7252c9a1712aebf9dc47dc22c536085f275164fe5f35c47cb0ad9ef","schema_version":"1.0","event_id":"sha256:42b05ee6c7252c9a1712aebf9dc47dc22c536085f275164fe5f35c47cb0ad9ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XR2JX7W5OAX22IW44Q6VFWPJG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Dependent Types for Domain Specific Program Analysis (Extended Abstract)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Marco Gaboardi","submitted_at":"2013-06-28T14:38:13Z","abstract_excerpt":"In this tutorial I will present how a combination of linear and dependent type can be useful to describe different properties about higher order programs. Linear types have been proved particularly useful to express properties of functions; dependent types are useful to describe the behavior of the program in terms of its control flow. This two ideas fits together well when one is interested in analyze properties of functions depending on the control flow of the program. I will present these ideas with example taken by complexity analysis and sensitivity analysis. I will conclude the tutorial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6856","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-18T03:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiOU6a1VfVSgtYaaQwMhUt2Myuo4SG9nLgB9cFtp52IvfS0tag0rm3G+anC0hhz+dEx3/I6Q66rr8wvH86XZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:14:59.151063Z"},"content_sha256":"3e426159fa9fa3caa97adcd9a6dd8ce7f7bc0ca801ccecb3a4f65f249e0d7c8a","schema_version":"1.0","event_id":"sha256:3e426159fa9fa3caa97adcd9a6dd8ce7f7bc0ca801ccecb3a4f65f249e0d7c8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XR2JX7W5OAX22IW44Q6VFWPJG3/bundle.json","state_url":"https://pith.science/pith/XR2JX7W5OAX22IW44Q6VFWPJG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XR2JX7W5OAX22IW44Q6VFWPJG3/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-05-31T16:14:59Z","links":{"resolver":"https://pith.science/pith/XR2JX7W5OAX22IW44Q6VFWPJG3","bundle":"https://pith.science/pith/XR2JX7W5OAX22IW44Q6VFWPJG3/bundle.json","state":"https://pith.science/pith/XR2JX7W5OAX22IW44Q6VFWPJG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XR2JX7W5OAX22IW44Q6VFWPJG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XR2JX7W5OAX22IW44Q6VFWPJG3","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":"6e63d414f202115ce7db1558764811b781617fedb371f6ed917576ce3d1ebe0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-06-28T14:38:13Z","title_canon_sha256":"97b67d48a8dc5f28fd9742fed76493fa6b5e825e1e0b14863edc689b2681b838"},"schema_version":"1.0","source":{"id":"1306.6856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6856","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6856v1","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6856","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"XR2JX7W5OAX2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XR2JX7W5OAX22IW4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XR2JX7W5","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:3e426159fa9fa3caa97adcd9a6dd8ce7f7bc0ca801ccecb3a4f65f249e0d7c8a","target":"graph","created_at":"2026-05-18T03:19:42Z","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":"In this tutorial I will present how a combination of linear and dependent type can be useful to describe different properties about higher order programs. Linear types have been proved particularly useful to express properties of functions; dependent types are useful to describe the behavior of the program in terms of its control flow. This two ideas fits together well when one is interested in analyze properties of functions depending on the control flow of the program. I will present these ideas with example taken by complexity analysis and sensitivity analysis. I will conclude the tutorial ","authors_text":"Marco Gaboardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-06-28T14:38:13Z","title":"Linear Dependent Types for Domain Specific Program Analysis (Extended Abstract)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6856","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:42b05ee6c7252c9a1712aebf9dc47dc22c536085f275164fe5f35c47cb0ad9ef","target":"record","created_at":"2026-05-18T03:19:42Z","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":"6e63d414f202115ce7db1558764811b781617fedb371f6ed917576ce3d1ebe0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-06-28T14:38:13Z","title_canon_sha256":"97b67d48a8dc5f28fd9742fed76493fa6b5e825e1e0b14863edc689b2681b838"},"schema_version":"1.0","source":{"id":"1306.6856","kind":"arxiv","version":1}},"canonical_sha256":"bc749bfedd702fad22dce43d52d9e936ea60e71207fbe91a9c57ec88a4e58bc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc749bfedd702fad22dce43d52d9e936ea60e71207fbe91a9c57ec88a4e58bc8","first_computed_at":"2026-05-18T03:19:42.726496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:42.726496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1vnLYL3PuZntywe2pOKlg2WJ3SCs/VpT0FO1IyBRamSjIbfSwJsqNs2xF3nbu4xCNh6Z9ec2a6Bt8ZandyHxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:42.727295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42b05ee6c7252c9a1712aebf9dc47dc22c536085f275164fe5f35c47cb0ad9ef","sha256:3e426159fa9fa3caa97adcd9a6dd8ce7f7bc0ca801ccecb3a4f65f249e0d7c8a"],"state_sha256":"b303b232e054ede3def8d238361db4399901879d9f79643a1d4ec149704c1d81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNcbS+i9YIYHtoZz/ctWF+7Z8Q1GJDdwQlKRjTikrDYGs7jc72AtNUyHTQ0HAS9kEdhi4M+mFzvMWLe0qcmTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:14:59.154830Z","bundle_sha256":"c92d45bd9088a4ccf47e41f4ffe670bf4056e839ba1880d30c5878626694acae"}}