{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DQN7P7C75A54VHHHAZ7VZPQHM4","short_pith_number":"pith:DQN7P7C7","schema_version":"1.0","canonical_sha256":"1c1bf7fc5fe83bca9ce7067f5cbe076729068c8b2bb4f3469493c0675b3d788d","source":{"kind":"arxiv","id":"1512.05023","version":2},"attestation_state":"computed","paper":{"title":"Packet Transactions: High-level Programming for Line-Rate Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alvin Cheung, Anirudh Sivaraman, Changhoon Kim, George Varghese, Hari Balakrishnan, Mihai Budiu, Mohammad Alizadeh, Nick McKeown, Steve Licking","submitted_at":"2015-12-16T01:15:06Z","abstract_excerpt":"Many algorithms for congestion control, scheduling, network measurement, active queue management, security, and load balancing require custom processing of packets as they traverse the data plane of a network switch. To run at line rate, these data-plane algorithms must be in hardware. With today's switch hardware, algorithms cannot be changed, nor new algorithms installed, after a switch has been built.\n  This paper shows how to program data-plane algorithms in a high-level language and compile those programs into low-level microcode that can run on emerging programmable line-rate switching c"},"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":"1512.05023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-12-16T01:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"576a6ab39351ad5051b08bb5e79d60d8a37ac980a118ad8c4b199d856ff9691c","abstract_canon_sha256":"a04fb47f1c15d98fe59c63757ed11d4955fbf8a815dd65907140f993420b44b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:36.692439Z","signature_b64":"Hnvyb3EnplYM8mGVdKCkUdacNgoon6bUO6vG56fOpExop6RDdrOGSzYI9289fmaMiojk01tECq+0fdCIbaRCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1bf7fc5fe83bca9ce7067f5cbe076729068c8b2bb4f3469493c0675b3d788d","last_reissued_at":"2026-05-18T01:21:36.691860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:36.691860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packet Transactions: High-level Programming for Line-Rate Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alvin Cheung, Anirudh Sivaraman, Changhoon Kim, George Varghese, Hari Balakrishnan, Mihai Budiu, Mohammad Alizadeh, Nick McKeown, Steve Licking","submitted_at":"2015-12-16T01:15:06Z","abstract_excerpt":"Many algorithms for congestion control, scheduling, network measurement, active queue management, security, and load balancing require custom processing of packets as they traverse the data plane of a network switch. To run at line rate, these data-plane algorithms must be in hardware. With today's switch hardware, algorithms cannot be changed, nor new algorithms installed, after a switch has been built.\n  This paper shows how to program data-plane algorithms in a high-level language and compile those programs into low-level microcode that can run on emerging programmable line-rate switching c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05023","kind":"arxiv","version":2},"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":"1512.05023","created_at":"2026-05-18T01:21:36.691960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05023v2","created_at":"2026-05-18T01:21:36.691960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05023","created_at":"2026-05-18T01:21:36.691960+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQN7P7C75A54","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQN7P7C75A54VHHH","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQN7P7C7","created_at":"2026-05-18T12:29:17.054201+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/DQN7P7C75A54VHHHAZ7VZPQHM4","json":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4.json","graph_json":"https://pith.science/api/pith-number/DQN7P7C75A54VHHHAZ7VZPQHM4/graph.json","events_json":"https://pith.science/api/pith-number/DQN7P7C75A54VHHHAZ7VZPQHM4/events.json","paper":"https://pith.science/paper/DQN7P7C7"},"agent_actions":{"view_html":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4","download_json":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4.json","view_paper":"https://pith.science/paper/DQN7P7C7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05023&json=true","fetch_graph":"https://pith.science/api/pith-number/DQN7P7C75A54VHHHAZ7VZPQHM4/graph.json","fetch_events":"https://pith.science/api/pith-number/DQN7P7C75A54VHHHAZ7VZPQHM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4/action/storage_attestation","attest_author":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4/action/author_attestation","sign_citation":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4/action/citation_signature","submit_replication":"https://pith.science/pith/DQN7P7C75A54VHHHAZ7VZPQHM4/action/replication_record"}},"created_at":"2026-05-18T01:21:36.691960+00:00","updated_at":"2026-05-18T01:21:36.691960+00:00"}