{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5C5SCACTGE54OV3POFJMY4PZQ3","short_pith_number":"pith:5C5SCACT","schema_version":"1.0","canonical_sha256":"e8bb210053313bc7576f7152cc71f986d6a83205972700fe37b72d918df49b83","source":{"kind":"arxiv","id":"2211.11659","version":3},"attestation_state":"computed","paper":{"title":"Formal Abstractions for Packet Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anshuman Mohan, Dexter Kozen, Nate Foster, Tobias Kapp\\'e, Yunhe Liu","submitted_at":"2022-11-21T17:21:50Z","abstract_excerpt":"Early programming models for software-defined networking (SDN) focused on basic features for controlling network-wide forwarding paths, but more recent work has considered richer features, such as packet scheduling and queueing, that affect performance. In particular, PIFO trees, proposed by Sivaraman et al., offer a flexible and efficient primitive for programmable packet scheduling. Prior work has shown that PIFO trees can express a wide range of practical algorithms including strict priority, weighted fair queueing, and hierarchical schemes. However, the semantic properties of PIFO trees ar"},"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":"2211.11659","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2022-11-21T17:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"67370941a8ebc00141f239ddb03a3876cf39085859f60142d15e161026f16d1c","abstract_canon_sha256":"11ce97b8d62c54023c55b6f6bb4eab6d4a710ee57ad1fc3cc6a62d59dbf4760d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:26.514548Z","signature_b64":"KkQI315Y1iv49OjGtUebIndEoUiilKf3hnkt00IO05tmPwwwXd4OyeJVqjDFGYyqBCHexzEi03LbTMtjF/jAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8bb210053313bc7576f7152cc71f986d6a83205972700fe37b72d918df49b83","last_reissued_at":"2026-07-05T07:02:26.514061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:26.514061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Abstractions for Packet Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anshuman Mohan, Dexter Kozen, Nate Foster, Tobias Kapp\\'e, Yunhe Liu","submitted_at":"2022-11-21T17:21:50Z","abstract_excerpt":"Early programming models for software-defined networking (SDN) focused on basic features for controlling network-wide forwarding paths, but more recent work has considered richer features, such as packet scheduling and queueing, that affect performance. In particular, PIFO trees, proposed by Sivaraman et al., offer a flexible and efficient primitive for programmable packet scheduling. Prior work has shown that PIFO trees can express a wide range of practical algorithms including strict priority, weighted fair queueing, and hierarchical schemes. However, the semantic properties of PIFO trees ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11659","kind":"arxiv","version":3},"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/2211.11659/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":"2211.11659","created_at":"2026-07-05T07:02:26.514117+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.11659v3","created_at":"2026-07-05T07:02:26.514117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11659","created_at":"2026-07-05T07:02:26.514117+00:00"},{"alias_kind":"pith_short_12","alias_value":"5C5SCACTGE54","created_at":"2026-07-05T07:02:26.514117+00:00"},{"alias_kind":"pith_short_16","alias_value":"5C5SCACTGE54OV3P","created_at":"2026-07-05T07:02:26.514117+00:00"},{"alias_kind":"pith_short_8","alias_value":"5C5SCACT","created_at":"2026-07-05T07:02:26.514117+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/5C5SCACTGE54OV3POFJMY4PZQ3","json":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3.json","graph_json":"https://pith.science/api/pith-number/5C5SCACTGE54OV3POFJMY4PZQ3/graph.json","events_json":"https://pith.science/api/pith-number/5C5SCACTGE54OV3POFJMY4PZQ3/events.json","paper":"https://pith.science/paper/5C5SCACT"},"agent_actions":{"view_html":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3","download_json":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3.json","view_paper":"https://pith.science/paper/5C5SCACT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.11659&json=true","fetch_graph":"https://pith.science/api/pith-number/5C5SCACTGE54OV3POFJMY4PZQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/5C5SCACTGE54OV3POFJMY4PZQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3/action/storage_attestation","attest_author":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3/action/author_attestation","sign_citation":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3/action/citation_signature","submit_replication":"https://pith.science/pith/5C5SCACTGE54OV3POFJMY4PZQ3/action/replication_record"}},"created_at":"2026-07-05T07:02:26.514117+00:00","updated_at":"2026-07-05T07:02:26.514117+00:00"}