{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7VSR7G55A544OIHOWQLDNLZIYZ","short_pith_number":"pith:7VSR7G55","schema_version":"1.0","canonical_sha256":"fd651f9bbd0779c720eeb41636af28c669ed597e282a059c3f04c9aca212d549","source":{"kind":"arxiv","id":"2605.19112","version":1},"attestation_state":"computed","paper":{"title":"Ordered Adjoint Logic (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Frank Pfenning, Sophia Roshal","submitted_at":"2026-05-18T20:58:25Z","abstract_excerpt":"Ordered logics and type systems have been used in a variety of applications\n  including computational linguistics, memory allocation, stream processing,\n  logical frameworks, parametricity, and enforcing security protocols. In most\n  formulations, ordered types are also linear, requiring each resource to be\n  used exactly once. Prior work by Kanovich et al. has investigated calculi\n  that relax this constraint through subexponentials within a linear ordered\n  logic. We generalize their work by using adjoint modalities to combine logics\n  with varying fine-grained structural properties, includi"},"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":"2605.19112","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-18T20:58:25Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"b071154159ce48de4d13095dfd1190c2f1938a5ba6813ff1bf139b6fd3b909f2","abstract_canon_sha256":"a04b1435b6936f52e56218e5a467e01643744825b1589c9ea7b1a38d036c93fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:27.715916Z","signature_b64":"v19Wf4NZIihHnDieiSzjbF8BG3q3xSRAt8gwVyO0eyjQsc+5Fp94e9ugdOeOqVXBoqGXnZdd/DHfM55NVCV3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd651f9bbd0779c720eeb41636af28c669ed597e282a059c3f04c9aca212d549","last_reissued_at":"2026-05-20T01:05:27.715174Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:27.715174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered Adjoint Logic (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Frank Pfenning, Sophia Roshal","submitted_at":"2026-05-18T20:58:25Z","abstract_excerpt":"Ordered logics and type systems have been used in a variety of applications\n  including computational linguistics, memory allocation, stream processing,\n  logical frameworks, parametricity, and enforcing security protocols. In most\n  formulations, ordered types are also linear, requiring each resource to be\n  used exactly once. Prior work by Kanovich et al. has investigated calculi\n  that relax this constraint through subexponentials within a linear ordered\n  logic. We generalize their work by using adjoint modalities to combine logics\n  with varying fine-grained structural properties, includi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19112","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19112/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.19112","created_at":"2026-05-20T01:05:27.715295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19112v1","created_at":"2026-05-20T01:05:27.715295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19112","created_at":"2026-05-20T01:05:27.715295+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VSR7G55A544","created_at":"2026-05-20T01:05:27.715295+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VSR7G55A544OIHO","created_at":"2026-05-20T01:05:27.715295+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VSR7G55","created_at":"2026-05-20T01:05:27.715295+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/7VSR7G55A544OIHOWQLDNLZIYZ","json":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ.json","graph_json":"https://pith.science/api/pith-number/7VSR7G55A544OIHOWQLDNLZIYZ/graph.json","events_json":"https://pith.science/api/pith-number/7VSR7G55A544OIHOWQLDNLZIYZ/events.json","paper":"https://pith.science/paper/7VSR7G55"},"agent_actions":{"view_html":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ","download_json":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ.json","view_paper":"https://pith.science/paper/7VSR7G55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19112&json=true","fetch_graph":"https://pith.science/api/pith-number/7VSR7G55A544OIHOWQLDNLZIYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7VSR7G55A544OIHOWQLDNLZIYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ/action/storage_attestation","attest_author":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ/action/author_attestation","sign_citation":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ/action/citation_signature","submit_replication":"https://pith.science/pith/7VSR7G55A544OIHOWQLDNLZIYZ/action/replication_record"}},"created_at":"2026-05-20T01:05:27.715295+00:00","updated_at":"2026-05-20T01:05:27.715295+00:00"}