{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:43OUQYTKSPL4VBTFVAZWTIZORX","short_pith_number":"pith:43OUQYTK","canonical_record":{"source":{"id":"2604.22445","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-04-24T11:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"17872c485bfbc75ebd9a43845edee3bffc650b6443a2f4463806c373345b0768","abstract_canon_sha256":"0e6f56ff01252bc64c7fcb6fdce8d0c81dce04015aa311e7ca57c95c345b7381"},"schema_version":"1.0"},"canonical_sha256":"e6dd48626a93d7ca8665a83369a32e8de90e186e1f4526551da30a546eeee992","source":{"kind":"arxiv","id":"2604.22445","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22445","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22445v2","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22445","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"43OUQYTKSPL4","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"43OUQYTKSPL4VBTF","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"43OUQYTK","created_at":"2026-05-22T01:04:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:43OUQYTKSPL4VBTFVAZWTIZORX","target":"record","payload":{"canonical_record":{"source":{"id":"2604.22445","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-04-24T11:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"17872c485bfbc75ebd9a43845edee3bffc650b6443a2f4463806c373345b0768","abstract_canon_sha256":"0e6f56ff01252bc64c7fcb6fdce8d0c81dce04015aa311e7ca57c95c345b7381"},"schema_version":"1.0"},"canonical_sha256":"e6dd48626a93d7ca8665a83369a32e8de90e186e1f4526551da30a546eeee992","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:03.048069Z","signature_b64":"DgGAL0zQIE+iBgq2rDUrgplIbQzmIgHyb17SDNwJ1Q7ODTRb/IeYKImsHJcLZtcb8Kj67oevu3OfJK8A2MksBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6dd48626a93d7ca8665a83369a32e8de90e186e1f4526551da30a546eeee992","last_reissued_at":"2026-05-22T01:04:03.047523Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:03.047523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.22445","source_version":2,"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-22T01:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMIu5Km8R0zmxaUFQHw+3bq3MID2UiyFG+K34lMdAGvrLv0oURaq5Gc6G4RU3MO3rv4Sih7lLIby8/KB8l91Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:43.214448Z"},"content_sha256":"731ccd2e44fe59b5b7bf7babd381b541c59284746cb35c6b53eb04d0110dc42d","schema_version":"1.0","event_id":"sha256:731ccd2e44fe59b5b7bf7babd381b541c59284746cb35c6b53eb04d0110dc42d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:43OUQYTKSPL4VBTFVAZWTIZORX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inference in Tightly Identified and Large-Scale Sign-Restricted SVARs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A differentiable reparameterization turns inequality restrictions into smooth constraints for efficient Hamiltonian Monte Carlo sampling in large-scale sign-restricted SVARs.","cross_cats":[],"primary_cat":"econ.EM","authors_text":"Adam Rybarczyk, Jani Luoto, Markku Lanne","submitted_at":"2026-04-24T11:01:30Z","abstract_excerpt":"We propose a new approach to inference in tightly identified and large-scale structural vector autoregressions based on a reparameterization that enables imposing identifying inequality restrictions through continuously differentiable mappings. Permitted inequality restrictions include shape and ranking restrictions as well as bounds on economically relevant elasticities, and the approach is also able to accommodate zero restrictions in a straightforward manner. We implement a Hamiltonian Monte Carlo algorithm and show how the posterior density can be rapidly evaluated under the reparameteriza"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We implement a Hamiltonian Monte Carlo algorithm and show how the posterior density can be rapidly evaluated under the reparameterization, thus facilitating inference in high-dimensional settings. Two empirical applications demonstrate that our approach tends to result in lower serial dependence in Markov chains, larger effective sample sizes and reduced computation time relative to existing methods.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The continuously differentiable mappings used to impose shape, ranking, and elasticity restrictions correctly represent the original identifying constraints and preserve the target posterior distribution without introducing bias or numerical instabilities in high dimensions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A differentiable reparameterization combined with HMC sampling improves posterior exploration and reduces computation time for tightly identified large-scale sign-restricted SVARs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A differentiable reparameterization turns inequality restrictions into smooth constraints for efficient Hamiltonian Monte Carlo sampling in large-scale sign-restricted SVARs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e805dd8b9befaf2d9935cb23629fc37c4e0eaf1ffb8e4653e6bd5cef6d2319c3"},"source":{"id":"2604.22445","kind":"arxiv","version":2},"verdict":{"id":"a0fa3cda-dbee-4986-85dd-8120d99f96ce","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T09:16:14.175100Z","strongest_claim":"We implement a Hamiltonian Monte Carlo algorithm and show how the posterior density can be rapidly evaluated under the reparameterization, thus facilitating inference in high-dimensional settings. Two empirical applications demonstrate that our approach tends to result in lower serial dependence in Markov chains, larger effective sample sizes and reduced computation time relative to existing methods.","one_line_summary":"A differentiable reparameterization combined with HMC sampling improves posterior exploration and reduces computation time for tightly identified large-scale sign-restricted SVARs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The continuously differentiable mappings used to impose shape, ranking, and elasticity restrictions correctly represent the original identifying constraints and preserve the target posterior distribution without introducing bias or numerical instabilities in high dimensions.","pith_extraction_headline":"A differentiable reparameterization turns inequality restrictions into smooth constraints for efficient Hamiltonian Monte Carlo sampling in large-scale sign-restricted SVARs."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.22445/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T10:40:15.773468Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:57:27.810997Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3ea12811ef1f6ef566ee525ba190d7fdbe86be2462519fb450f25facfb7c20ae"},"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":"a0fa3cda-dbee-4986-85dd-8120d99f96ce"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDhAySyX1ZKxJpxD55PenujgPj1O/TORWVFb3qfnvao93EHVYtciiFheNNSIJjTzIKvqNzHHxnFSdV3PYZMLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:43.214965Z"},"content_sha256":"735ce39471147c1f490195f9c1d9c5525cb4d4914ba0c158cdeee39e91763f0d","schema_version":"1.0","event_id":"sha256:735ce39471147c1f490195f9c1d9c5525cb4d4914ba0c158cdeee39e91763f0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43OUQYTKSPL4VBTFVAZWTIZORX/bundle.json","state_url":"https://pith.science/pith/43OUQYTKSPL4VBTFVAZWTIZORX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43OUQYTKSPL4VBTFVAZWTIZORX/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-03T16:07:43Z","links":{"resolver":"https://pith.science/pith/43OUQYTKSPL4VBTFVAZWTIZORX","bundle":"https://pith.science/pith/43OUQYTKSPL4VBTFVAZWTIZORX/bundle.json","state":"https://pith.science/pith/43OUQYTKSPL4VBTFVAZWTIZORX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43OUQYTKSPL4VBTFVAZWTIZORX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:43OUQYTKSPL4VBTFVAZWTIZORX","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":"0e6f56ff01252bc64c7fcb6fdce8d0c81dce04015aa311e7ca57c95c345b7381","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-04-24T11:01:30Z","title_canon_sha256":"17872c485bfbc75ebd9a43845edee3bffc650b6443a2f4463806c373345b0768"},"schema_version":"1.0","source":{"id":"2604.22445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22445","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22445v2","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22445","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"43OUQYTKSPL4","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"43OUQYTKSPL4VBTF","created_at":"2026-05-22T01:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"43OUQYTK","created_at":"2026-05-22T01:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:735ce39471147c1f490195f9c1d9c5525cb4d4914ba0c158cdeee39e91763f0d","target":"graph","created_at":"2026-05-22T01:04:03Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We implement a Hamiltonian Monte Carlo algorithm and show how the posterior density can be rapidly evaluated under the reparameterization, thus facilitating inference in high-dimensional settings. Two empirical applications demonstrate that our approach tends to result in lower serial dependence in Markov chains, larger effective sample sizes and reduced computation time relative to existing methods."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The continuously differentiable mappings used to impose shape, ranking, and elasticity restrictions correctly represent the original identifying constraints and preserve the target posterior distribution without introducing bias or numerical instabilities in high dimensions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A differentiable reparameterization combined with HMC sampling improves posterior exploration and reduces computation time for tightly identified large-scale sign-restricted SVARs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A differentiable reparameterization turns inequality restrictions into smooth constraints for efficient Hamiltonian Monte Carlo sampling in large-scale sign-restricted SVARs."}],"snapshot_sha256":"e805dd8b9befaf2d9935cb23629fc37c4e0eaf1ffb8e4653e6bd5cef6d2319c3"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T10:40:15.773468Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:57:27.810997Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.22445/integrity.json","findings":[],"snapshot_sha256":"3ea12811ef1f6ef566ee525ba190d7fdbe86be2462519fb450f25facfb7c20ae","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new approach to inference in tightly identified and large-scale structural vector autoregressions based on a reparameterization that enables imposing identifying inequality restrictions through continuously differentiable mappings. Permitted inequality restrictions include shape and ranking restrictions as well as bounds on economically relevant elasticities, and the approach is also able to accommodate zero restrictions in a straightforward manner. We implement a Hamiltonian Monte Carlo algorithm and show how the posterior density can be rapidly evaluated under the reparameteriza","authors_text":"Adam Rybarczyk, Jani Luoto, Markku Lanne","cross_cats":[],"headline":"A differentiable reparameterization turns inequality restrictions into smooth constraints for efficient Hamiltonian Monte Carlo sampling in large-scale sign-restricted SVARs.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-04-24T11:01:30Z","title":"Inference in Tightly Identified and Large-Scale Sign-Restricted SVARs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.22445","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T09:16:14.175100Z","id":"a0fa3cda-dbee-4986-85dd-8120d99f96ce","model_set":{"reader":"grok-4.3"},"one_line_summary":"A differentiable reparameterization combined with HMC sampling improves posterior exploration and reduces computation time for tightly identified large-scale sign-restricted SVARs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A differentiable reparameterization turns inequality restrictions into smooth constraints for efficient Hamiltonian Monte Carlo sampling in large-scale sign-restricted SVARs.","strongest_claim":"We implement a Hamiltonian Monte Carlo algorithm and show how the posterior density can be rapidly evaluated under the reparameterization, thus facilitating inference in high-dimensional settings. Two empirical applications demonstrate that our approach tends to result in lower serial dependence in Markov chains, larger effective sample sizes and reduced computation time relative to existing methods.","weakest_assumption":"The continuously differentiable mappings used to impose shape, ranking, and elasticity restrictions correctly represent the original identifying constraints and preserve the target posterior distribution without introducing bias or numerical instabilities in high dimensions."}},"verdict_id":"a0fa3cda-dbee-4986-85dd-8120d99f96ce"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:731ccd2e44fe59b5b7bf7babd381b541c59284746cb35c6b53eb04d0110dc42d","target":"record","created_at":"2026-05-22T01:04:03Z","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":"0e6f56ff01252bc64c7fcb6fdce8d0c81dce04015aa311e7ca57c95c345b7381","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"econ.EM","submitted_at":"2026-04-24T11:01:30Z","title_canon_sha256":"17872c485bfbc75ebd9a43845edee3bffc650b6443a2f4463806c373345b0768"},"schema_version":"1.0","source":{"id":"2604.22445","kind":"arxiv","version":2}},"canonical_sha256":"e6dd48626a93d7ca8665a83369a32e8de90e186e1f4526551da30a546eeee992","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6dd48626a93d7ca8665a83369a32e8de90e186e1f4526551da30a546eeee992","first_computed_at":"2026-05-22T01:04:03.047523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:03.047523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DgGAL0zQIE+iBgq2rDUrgplIbQzmIgHyb17SDNwJ1Q7ODTRb/IeYKImsHJcLZtcb8Kj67oevu3OfJK8A2MksBA==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:03.048069Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.22445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:731ccd2e44fe59b5b7bf7babd381b541c59284746cb35c6b53eb04d0110dc42d","sha256:735ce39471147c1f490195f9c1d9c5525cb4d4914ba0c158cdeee39e91763f0d"],"state_sha256":"dfde4ab9c14f844d752ad921b918da387bada0e36f9c7833fdb4ab027906db0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9tznp/hVNX1mqPHx1Agf6Wj/aYNujhuE2qKdXcW/m6VERS+BSe0tUJzXcGovVSBy90vZJthD+2GsAiZsq5UCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:07:43.217323Z","bundle_sha256":"801ee5cb4a9df457f29d773312a7df093409d7c3ed89ee46dfefd502a3ec53f5"}}