{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:63QRUFT6JQYFY4XUC3VZLC6XZV","short_pith_number":"pith:63QRUFT6","canonical_record":{"source":{"id":"1611.05672","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-17T13:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"fd27bf3de2fd765b8d264083408ef2da9217f2afd202ee986a055c7daf036953","abstract_canon_sha256":"290ef15539b9cca0fc04a2a8b1cbacd8d73e8a2f3f329a149a97fc6ee34aee92"},"schema_version":"1.0"},"canonical_sha256":"f6e11a167e4c305c72f416eb958bd7cd426c84e1df1935940a48237096a1d553","source":{"kind":"arxiv","id":"1611.05672","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05672","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05672v5","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05672","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"63QRUFT6JQYF","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"63QRUFT6JQYFY4XU","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"63QRUFT6","created_at":"2026-07-05T06:23:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:63QRUFT6JQYFY4XUC3VZLC6XZV","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05672","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-17T13:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"fd27bf3de2fd765b8d264083408ef2da9217f2afd202ee986a055c7daf036953","abstract_canon_sha256":"290ef15539b9cca0fc04a2a8b1cbacd8d73e8a2f3f329a149a97fc6ee34aee92"},"schema_version":"1.0"},"canonical_sha256":"f6e11a167e4c305c72f416eb958bd7cd426c84e1df1935940a48237096a1d553","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:18.223886Z","signature_b64":"hB4wY3ykKk/BaEZb5gOEmrJISEfIppILiExgozf2WJ1+BSl1+uYeG9WV1Q8GX9wfyz5W1IMttqzT2m2sn4BvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6e11a167e4c305c72f416eb958bd7cd426c84e1df1935940a48237096a1d553","last_reissued_at":"2026-07-05T06:23:18.223532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:18.223532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05672","source_version":5,"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-07-05T06:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyuP4FkO0xbRzsLbarr1iyxjlPdXu3g0xy7pSXneFawtsYwe8jZYFku2uElMFLAPgc92xnt06OUHJ/JfoJiUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:30:02.381881Z"},"content_sha256":"650e5d06c313e0538d225c7b30af9e5d47a9ba9d90e2346558d2a843883aef80","schema_version":"1.0","event_id":"sha256:650e5d06c313e0538d225c7b30af9e5d47a9ba9d90e2346558d2a843883aef80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:63QRUFT6JQYFY4XUC3VZLC6XZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Algebraic Intersection Type Unification Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrej Dudenhefner, Jakob Rehof, Moritz Martens","submitted_at":"2016-11-17T13:13:18Z","abstract_excerpt":"The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type unification problem is decidable. We give the first nontrivial lower bound for the problem by showing (our main result) that it is exponential time hard. Furthermore, we show that this holds even under rank 1 solutions (substitutions whose codomains are restricted to contain rank 1 types). In addition, we provide a fixed-parameter intractability result for i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05672","kind":"arxiv","version":5},"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/1611.05672/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"},"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-07-05T06:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBcxGf4b7LDTne6h2Sg4pbJNQt+7ns8DXyZMb6wc7pGsrrDmMM1v6UrNb9bx5YT6tsNwutSVE3ablABkmLMbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:30:02.382369Z"},"content_sha256":"5fae05be7f90bad9d5b199d2a9920f0209332b4c0593a4f27326867e1f32cfbd","schema_version":"1.0","event_id":"sha256:5fae05be7f90bad9d5b199d2a9920f0209332b4c0593a4f27326867e1f32cfbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63QRUFT6JQYFY4XUC3VZLC6XZV/bundle.json","state_url":"https://pith.science/pith/63QRUFT6JQYFY4XUC3VZLC6XZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63QRUFT6JQYFY4XUC3VZLC6XZV/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-08-24T00:30:02Z","links":{"resolver":"https://pith.science/pith/63QRUFT6JQYFY4XUC3VZLC6XZV","bundle":"https://pith.science/pith/63QRUFT6JQYFY4XUC3VZLC6XZV/bundle.json","state":"https://pith.science/pith/63QRUFT6JQYFY4XUC3VZLC6XZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63QRUFT6JQYFY4XUC3VZLC6XZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:63QRUFT6JQYFY4XUC3VZLC6XZV","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":"290ef15539b9cca0fc04a2a8b1cbacd8d73e8a2f3f329a149a97fc6ee34aee92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-17T13:13:18Z","title_canon_sha256":"fd27bf3de2fd765b8d264083408ef2da9217f2afd202ee986a055c7daf036953"},"schema_version":"1.0","source":{"id":"1611.05672","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05672","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05672v5","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05672","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"63QRUFT6JQYF","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"63QRUFT6JQYFY4XU","created_at":"2026-07-05T06:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"63QRUFT6","created_at":"2026-07-05T06:23:18Z"}],"graph_snapshots":[{"event_id":"sha256:5fae05be7f90bad9d5b199d2a9920f0209332b4c0593a4f27326867e1f32cfbd","target":"graph","created_at":"2026-07-05T06:23:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1611.05672/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type unification problem is decidable. We give the first nontrivial lower bound for the problem by showing (our main result) that it is exponential time hard. Furthermore, we show that this holds even under rank 1 solutions (substitutions whose codomains are restricted to contain rank 1 types). In addition, we provide a fixed-parameter intractability result for i","authors_text":"Andrej Dudenhefner, Jakob Rehof, Moritz Martens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-17T13:13:18Z","title":"The Algebraic Intersection Type Unification Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05672","kind":"arxiv","version":5},"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:650e5d06c313e0538d225c7b30af9e5d47a9ba9d90e2346558d2a843883aef80","target":"record","created_at":"2026-07-05T06:23:18Z","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":"290ef15539b9cca0fc04a2a8b1cbacd8d73e8a2f3f329a149a97fc6ee34aee92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-17T13:13:18Z","title_canon_sha256":"fd27bf3de2fd765b8d264083408ef2da9217f2afd202ee986a055c7daf036953"},"schema_version":"1.0","source":{"id":"1611.05672","kind":"arxiv","version":5}},"canonical_sha256":"f6e11a167e4c305c72f416eb958bd7cd426c84e1df1935940a48237096a1d553","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6e11a167e4c305c72f416eb958bd7cd426c84e1df1935940a48237096a1d553","first_computed_at":"2026-07-05T06:23:18.223532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:18.223532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hB4wY3ykKk/BaEZb5gOEmrJISEfIppILiExgozf2WJ1+BSl1+uYeG9WV1Q8GX9wfyz5W1IMttqzT2m2sn4BvAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:18.223886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05672","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:650e5d06c313e0538d225c7b30af9e5d47a9ba9d90e2346558d2a843883aef80","sha256:5fae05be7f90bad9d5b199d2a9920f0209332b4c0593a4f27326867e1f32cfbd"],"state_sha256":"a7f8a537d100049a51dca9b685ecf8a37fe7726702b27d6e8af3106b662c5b12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWo6g/sg5ZKpZbkHIzqggalX+kCE76usL9RZ4t4fNZGdm4ZxxDztflojogCNwXBoK4zZEbAwJTkp23xURBtvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T00:30:02.387431Z","bundle_sha256":"2335ef1f8e09fd1628a51be618b4a8c32c116da140630f975d5e571d22942821"}}