{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3G5DJAJ6VFPHRU5NX2SZ5W7ORH","short_pith_number":"pith:3G5DJAJ6","schema_version":"1.0","canonical_sha256":"d9ba34813ea95e78d3adbea59edbee89d62cb10e5f7e0f4220a7dfdafa1815a6","source":{"kind":"arxiv","id":"2307.14193","version":1},"attestation_state":"computed","paper":{"title":"Efficient Learning of Discrete-Continuous Computation Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Friede, Mathias Niepert","submitted_at":"2023-07-26T13:47:52Z","abstract_excerpt":"Numerous models for supervised and reinforcement learning benefit from combinations of discrete and continuous model components. End-to-end learnable discrete-continuous models are compositional, tend to generalize better, and are more interpretable. A popular approach to building discrete-continuous computation graphs is that of integrating discrete probability distributions into neural networks using stochastic softmax tricks. Prior work has mainly focused on computation graphs with a single discrete component on each of the graph's execution paths. We analyze the behavior of more complex st"},"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":"2307.14193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-26T13:47:52Z","cross_cats_sorted":[],"title_canon_sha256":"bc02f18d68c88eac3987788c2206a8b69fb88e6d83fb6e85a432e385fc3bb5b1","abstract_canon_sha256":"c8c5da03d36a0ea2b7202fd69d1a6b875e7185966643f8fe1bf1a10cdf1921c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:58.887797Z","signature_b64":"C6xqDl7X1NRrAiwMMUfr9Y1dA9n/N70PQ5mnZ/ZKSerM2k96MwAvhmacI8N02bwfdX3Auo2T6X+gHzk79dFuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ba34813ea95e78d3adbea59edbee89d62cb10e5f7e0f4220a7dfdafa1815a6","last_reissued_at":"2026-07-05T06:34:58.887362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:58.887362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Learning of Discrete-Continuous Computation Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Friede, Mathias Niepert","submitted_at":"2023-07-26T13:47:52Z","abstract_excerpt":"Numerous models for supervised and reinforcement learning benefit from combinations of discrete and continuous model components. End-to-end learnable discrete-continuous models are compositional, tend to generalize better, and are more interpretable. A popular approach to building discrete-continuous computation graphs is that of integrating discrete probability distributions into neural networks using stochastic softmax tricks. Prior work has mainly focused on computation graphs with a single discrete component on each of the graph's execution paths. We analyze the behavior of more complex st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.14193","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/2307.14193/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":"2307.14193","created_at":"2026-07-05T06:34:58.887427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.14193v1","created_at":"2026-07-05T06:34:58.887427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.14193","created_at":"2026-07-05T06:34:58.887427+00:00"},{"alias_kind":"pith_short_12","alias_value":"3G5DJAJ6VFPH","created_at":"2026-07-05T06:34:58.887427+00:00"},{"alias_kind":"pith_short_16","alias_value":"3G5DJAJ6VFPHRU5N","created_at":"2026-07-05T06:34:58.887427+00:00"},{"alias_kind":"pith_short_8","alias_value":"3G5DJAJ6","created_at":"2026-07-05T06:34:58.887427+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/3G5DJAJ6VFPHRU5NX2SZ5W7ORH","json":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH.json","graph_json":"https://pith.science/api/pith-number/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/graph.json","events_json":"https://pith.science/api/pith-number/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/events.json","paper":"https://pith.science/paper/3G5DJAJ6"},"agent_actions":{"view_html":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH","download_json":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH.json","view_paper":"https://pith.science/paper/3G5DJAJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.14193&json=true","fetch_graph":"https://pith.science/api/pith-number/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/graph.json","fetch_events":"https://pith.science/api/pith-number/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/action/storage_attestation","attest_author":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/action/author_attestation","sign_citation":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/action/citation_signature","submit_replication":"https://pith.science/pith/3G5DJAJ6VFPHRU5NX2SZ5W7ORH/action/replication_record"}},"created_at":"2026-07-05T06:34:58.887427+00:00","updated_at":"2026-07-05T06:34:58.887427+00:00"}