{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MINOKHW4IGKUJDTM3MF27IMALA","short_pith_number":"pith:MINOKHW4","schema_version":"1.0","canonical_sha256":"621ae51edc4195448e6cdb0bafa180581a4b925faf8a4ce7e0db0645eba346f1","source":{"kind":"arxiv","id":"2406.13679","version":1},"attestation_state":"computed","paper":{"title":"Prose-to-P4: Leveraging High Level Languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Costin Raiciu, Mihai-Valentin Dumitru, Vlad-Andrei B\\u{a}doiu","submitted_at":"2024-06-19T16:32:27Z","abstract_excerpt":"Languages such as P4 and NPL have enabled a wide and diverse range of networking applications that take advantage of programmable dataplanes. However, software development in these languages is difficult. To address this issue, high-level languages have been designed to offer programmers powerful abstractions that reduce the time, effort and domain-knowledge required for developing networking applications. These languages are then translated by a compiler into P4/NPL code. Inspired by the recent success of Large Language Models (LLMs) in the task of code generation, we propose to raise the lev"},"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":"2406.13679","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-06-19T16:32:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6ef945fdd827c5320d07e19ed962a38480c52eac9d346d9dc76d2a221e5faf0c","abstract_canon_sha256":"7e1bccee765af2b7f6496c1650d1985ac0f35693188c339934056be88ab91447"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:33.134710Z","signature_b64":"zyveLkArVrxjhqzveiRA0WnW4SjbbUbP0T3gAm7Byxf98ViTkah9ot+wN4r6pcQm9abGK7Q3CwRRllwyz5CYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"621ae51edc4195448e6cdb0bafa180581a4b925faf8a4ce7e0db0645eba346f1","last_reissued_at":"2026-07-05T08:34:33.134287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:33.134287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prose-to-P4: Leveraging High Level Languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Costin Raiciu, Mihai-Valentin Dumitru, Vlad-Andrei B\\u{a}doiu","submitted_at":"2024-06-19T16:32:27Z","abstract_excerpt":"Languages such as P4 and NPL have enabled a wide and diverse range of networking applications that take advantage of programmable dataplanes. However, software development in these languages is difficult. To address this issue, high-level languages have been designed to offer programmers powerful abstractions that reduce the time, effort and domain-knowledge required for developing networking applications. These languages are then translated by a compiler into P4/NPL code. Inspired by the recent success of Large Language Models (LLMs) in the task of code generation, we propose to raise the lev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.13679","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/2406.13679/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":"2406.13679","created_at":"2026-07-05T08:34:33.134359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.13679v1","created_at":"2026-07-05T08:34:33.134359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.13679","created_at":"2026-07-05T08:34:33.134359+00:00"},{"alias_kind":"pith_short_12","alias_value":"MINOKHW4IGKU","created_at":"2026-07-05T08:34:33.134359+00:00"},{"alias_kind":"pith_short_16","alias_value":"MINOKHW4IGKUJDTM","created_at":"2026-07-05T08:34:33.134359+00:00"},{"alias_kind":"pith_short_8","alias_value":"MINOKHW4","created_at":"2026-07-05T08:34:33.134359+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/MINOKHW4IGKUJDTM3MF27IMALA","json":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA.json","graph_json":"https://pith.science/api/pith-number/MINOKHW4IGKUJDTM3MF27IMALA/graph.json","events_json":"https://pith.science/api/pith-number/MINOKHW4IGKUJDTM3MF27IMALA/events.json","paper":"https://pith.science/paper/MINOKHW4"},"agent_actions":{"view_html":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA","download_json":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA.json","view_paper":"https://pith.science/paper/MINOKHW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.13679&json=true","fetch_graph":"https://pith.science/api/pith-number/MINOKHW4IGKUJDTM3MF27IMALA/graph.json","fetch_events":"https://pith.science/api/pith-number/MINOKHW4IGKUJDTM3MF27IMALA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA/action/storage_attestation","attest_author":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA/action/author_attestation","sign_citation":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA/action/citation_signature","submit_replication":"https://pith.science/pith/MINOKHW4IGKUJDTM3MF27IMALA/action/replication_record"}},"created_at":"2026-07-05T08:34:33.134359+00:00","updated_at":"2026-07-05T08:34:33.134359+00:00"}