{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FX7RUEWIYJCSMXGYFGGTICUCLV","short_pith_number":"pith:FX7RUEWI","schema_version":"1.0","canonical_sha256":"2dff1a12c8c245265cd8298d340a825d42e523853fde8b9ecfa93eb4b5d77805","source":{"kind":"arxiv","id":"1903.01855","version":1},"attestation_state":"computed","paper":{"title":"TensorFlow Eager: A Multi-Stage, Python-Embedded DSL for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Akshay Agrawal, Akshay Naresh Modi, Alexandre Passos, Allen Lavoie, Ashish Agarwal, Asim Shankar, Igor Ganichev, Josh Levenberg, Mingsheng Hong, Rajat Monga, Shanqing Cai","submitted_at":"2019-02-27T03:08:20Z","abstract_excerpt":"TensorFlow Eager is a multi-stage, Python-embedded domain-specific language for hardware-accelerated machine learning, suitable for both interactive research and production. TensorFlow, which TensorFlow Eager extends, requires users to represent computations as dataflow graphs; this permits compiler optimizations and simplifies deployment but hinders rapid prototyping and run-time dynamism. TensorFlow Eager eliminates these usability costs without sacrificing the benefits furnished by graphs: It provides an imperative front-end to TensorFlow that executes operations immediately and a JIT trace"},"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":"1903.01855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-27T03:08:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7e83c1ae81102ba81b69edcc1ca376b2477d39176173ca18aed5255b0786be44","abstract_canon_sha256":"b97a567c15e0c58f418a48eabec635e6888b3ed538af4ef6cfe7d35e58345520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.575012Z","signature_b64":"kbDRIh0thbTFzRu7Ez0YtTzV9QC9DUN+Fv/Aq55VuY64DCcYUvla1mKUitKgh0KL1Ggks7BsMm1CRtwEPAXQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dff1a12c8c245265cd8298d340a825d42e523853fde8b9ecfa93eb4b5d77805","last_reissued_at":"2026-05-17T23:51:59.574565Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.574565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TensorFlow Eager: A Multi-Stage, Python-Embedded DSL for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Akshay Agrawal, Akshay Naresh Modi, Alexandre Passos, Allen Lavoie, Ashish Agarwal, Asim Shankar, Igor Ganichev, Josh Levenberg, Mingsheng Hong, Rajat Monga, Shanqing Cai","submitted_at":"2019-02-27T03:08:20Z","abstract_excerpt":"TensorFlow Eager is a multi-stage, Python-embedded domain-specific language for hardware-accelerated machine learning, suitable for both interactive research and production. TensorFlow, which TensorFlow Eager extends, requires users to represent computations as dataflow graphs; this permits compiler optimizations and simplifies deployment but hinders rapid prototyping and run-time dynamism. TensorFlow Eager eliminates these usability costs without sacrificing the benefits furnished by graphs: It provides an imperative front-end to TensorFlow that executes operations immediately and a JIT trace"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01855","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.01855","created_at":"2026-05-17T23:51:59.574627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01855v1","created_at":"2026-05-17T23:51:59.574627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01855","created_at":"2026-05-17T23:51:59.574627+00:00"},{"alias_kind":"pith_short_12","alias_value":"FX7RUEWIYJCS","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FX7RUEWIYJCSMXGY","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FX7RUEWI","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.16248","citing_title":"GraphMend: Code Transformations for Fixing Graph Breaks in PyTorch 2","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV","json":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV.json","graph_json":"https://pith.science/api/pith-number/FX7RUEWIYJCSMXGYFGGTICUCLV/graph.json","events_json":"https://pith.science/api/pith-number/FX7RUEWIYJCSMXGYFGGTICUCLV/events.json","paper":"https://pith.science/paper/FX7RUEWI"},"agent_actions":{"view_html":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV","download_json":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV.json","view_paper":"https://pith.science/paper/FX7RUEWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01855&json=true","fetch_graph":"https://pith.science/api/pith-number/FX7RUEWIYJCSMXGYFGGTICUCLV/graph.json","fetch_events":"https://pith.science/api/pith-number/FX7RUEWIYJCSMXGYFGGTICUCLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV/action/storage_attestation","attest_author":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV/action/author_attestation","sign_citation":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV/action/citation_signature","submit_replication":"https://pith.science/pith/FX7RUEWIYJCSMXGYFGGTICUCLV/action/replication_record"}},"created_at":"2026-05-17T23:51:59.574627+00:00","updated_at":"2026-05-17T23:51:59.574627+00:00"}