{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EV3ZBIJD47SFN6EMJYT5XKQUOY","short_pith_number":"pith:EV3ZBIJD","canonical_record":{"source":{"id":"1603.08213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-27T12:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"e1d61a9fba12ee48320a1c204a46b125a42598a72a3e8c16be4d484942d039c3","abstract_canon_sha256":"d0ad31b4601a7575a95523e5e10d29e7ce2a1e6bd73bbfecdca22c5e58d1899e"},"schema_version":"1.0"},"canonical_sha256":"257790a123e7e456f88c4e27dbaa147624ffdd40aba4a147392487928656d75b","source":{"kind":"arxiv","id":"1603.08213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08213","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08213v1","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08213","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"EV3ZBIJD47SF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EV3ZBIJD47SFN6EM","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EV3ZBIJD","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EV3ZBIJD47SFN6EMJYT5XKQUOY","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-27T12:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"e1d61a9fba12ee48320a1c204a46b125a42598a72a3e8c16be4d484942d039c3","abstract_canon_sha256":"d0ad31b4601a7575a95523e5e10d29e7ce2a1e6bd73bbfecdca22c5e58d1899e"},"schema_version":"1.0"},"canonical_sha256":"257790a123e7e456f88c4e27dbaa147624ffdd40aba4a147392487928656d75b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:12.880207Z","signature_b64":"Xy3HN2rgglUz5TthY3EabcNvuJW9qW9Vca1HkKzrv9oOdqeswvHtBP11U35KZ0sG7s0mwbDcOI8B+wWpt9q7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"257790a123e7e456f88c4e27dbaa147624ffdd40aba4a147392487928656d75b","last_reissued_at":"2026-05-18T01:18:12.879567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:12.879567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08213","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:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"McAsyHBQYhON8vpzPX9QTsNYPDcIJVAWwVR7AnOthN4Lgcr6Jcj5NFW9N/3BOu2DVfMe9uXLc6lo/ja2HhrJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:46.902901Z"},"content_sha256":"7409f5aea559959f530c83a2a123b28473607e8fd8641bf5796a16c5a5add6fb","schema_version":"1.0","event_id":"sha256:7409f5aea559959f530c83a2a123b28473607e8fd8641bf5796a16c5a5add6fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EV3ZBIJD47SFN6EMJYT5XKQUOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating reversible circuits from higher-order functional programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benoit Valiron","submitted_at":"2016-03-27T12:49:26Z","abstract_excerpt":"Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and validation of a reversible circuit simulating a given function is a difficult problem. In 1973, Bennett proposed to generate reversible circuits from traces of execution of Turing machines. In this paper, we propose a novel presentation of this approach, adapted to higher-order programs. Starting with a PCF-like language, we use a monadic representation of the trace of execution to turn a regular boolean program into a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08213","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:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pW8yzb3H2ERRyAiM4xCYxyf897pauUvE2GFbnuy2jxF55OscQuUmkZwrB6pObjQ5xtMpiGPJo6DRFE0cAqUiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:46.903256Z"},"content_sha256":"2a817ce15917d2389c6ae8e70b88d6c1b3a09a225b7a0622ab074396d25182f0","schema_version":"1.0","event_id":"sha256:2a817ce15917d2389c6ae8e70b88d6c1b3a09a225b7a0622ab074396d25182f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EV3ZBIJD47SFN6EMJYT5XKQUOY/bundle.json","state_url":"https://pith.science/pith/EV3ZBIJD47SFN6EMJYT5XKQUOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EV3ZBIJD47SFN6EMJYT5XKQUOY/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-30T00:30:46Z","links":{"resolver":"https://pith.science/pith/EV3ZBIJD47SFN6EMJYT5XKQUOY","bundle":"https://pith.science/pith/EV3ZBIJD47SFN6EMJYT5XKQUOY/bundle.json","state":"https://pith.science/pith/EV3ZBIJD47SFN6EMJYT5XKQUOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EV3ZBIJD47SFN6EMJYT5XKQUOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EV3ZBIJD47SFN6EMJYT5XKQUOY","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":"d0ad31b4601a7575a95523e5e10d29e7ce2a1e6bd73bbfecdca22c5e58d1899e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-27T12:49:26Z","title_canon_sha256":"e1d61a9fba12ee48320a1c204a46b125a42598a72a3e8c16be4d484942d039c3"},"schema_version":"1.0","source":{"id":"1603.08213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08213","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08213v1","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08213","created_at":"2026-05-18T01:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"EV3ZBIJD47SF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EV3ZBIJD47SFN6EM","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EV3ZBIJD","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:2a817ce15917d2389c6ae8e70b88d6c1b3a09a225b7a0622ab074396d25182f0","target":"graph","created_at":"2026-05-18T01:18:12Z","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":"Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and validation of a reversible circuit simulating a given function is a difficult problem. In 1973, Bennett proposed to generate reversible circuits from traces of execution of Turing machines. In this paper, we propose a novel presentation of this approach, adapted to higher-order programs. Starting with a PCF-like language, we use a monadic representation of the trace of execution to turn a regular boolean program into a c","authors_text":"Benoit Valiron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-27T12:49:26Z","title":"Generating reversible circuits from higher-order functional programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08213","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:7409f5aea559959f530c83a2a123b28473607e8fd8641bf5796a16c5a5add6fb","target":"record","created_at":"2026-05-18T01:18:12Z","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":"d0ad31b4601a7575a95523e5e10d29e7ce2a1e6bd73bbfecdca22c5e58d1899e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-27T12:49:26Z","title_canon_sha256":"e1d61a9fba12ee48320a1c204a46b125a42598a72a3e8c16be4d484942d039c3"},"schema_version":"1.0","source":{"id":"1603.08213","kind":"arxiv","version":1}},"canonical_sha256":"257790a123e7e456f88c4e27dbaa147624ffdd40aba4a147392487928656d75b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"257790a123e7e456f88c4e27dbaa147624ffdd40aba4a147392487928656d75b","first_computed_at":"2026-05-18T01:18:12.879567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:12.879567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xy3HN2rgglUz5TthY3EabcNvuJW9qW9Vca1HkKzrv9oOdqeswvHtBP11U35KZ0sG7s0mwbDcOI8B+wWpt9q7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:12.880207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7409f5aea559959f530c83a2a123b28473607e8fd8641bf5796a16c5a5add6fb","sha256:2a817ce15917d2389c6ae8e70b88d6c1b3a09a225b7a0622ab074396d25182f0"],"state_sha256":"12abf9becd62c5cdeb831ec5e5e24d46c4a524eb63bc562fddbfa72f725de723"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"po1cFOQoqvtXRf5sEmRp52sY9lv4BYo7YoCqTH2VgoAdf27emsiGxeyZL5lqXhXUtdPG4ssx3C3lIGxtRCrvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:30:46.905332Z","bundle_sha256":"2c17ed51daf81bd7920077bbb31a806f2fb8edb98daaaa4a59a8d8a62d180d3a"}}