{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HHZPBZHWCKEUYVC2NTAYCEEHJ2","short_pith_number":"pith:HHZPBZHW","schema_version":"1.0","canonical_sha256":"39f2f0e4f612894c545a6cc18110874eacecc7dc1eec77d9d2b35399b15a435a","source":{"kind":"arxiv","id":"2506.13383","version":1},"attestation_state":"computed","paper":{"title":"StacKAT: Infinite State Network Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexandra Silva, Dexter Kozen, Jana Wagemaker, Jules Jacobs, Lily Saada, Nate Foster, Tobias Kapp\\'e","submitted_at":"2025-06-16T11:47:27Z","abstract_excerpt":"We develop StacKAT, a network verification language featuring loops, finite state variables, nondeterminism, and - most importantly - access to a stack with accompanying push and pop operations. By viewing the variables and stack as the (parsed) headers and (to-be-parsed) contents of a network packet, StacKAT can express a wide range of network behaviors including parsing, source routing, and telemetry. These behaviors are difficult or impossible to model using existing languages like NetKAT. We develop a decision procedure for StacKAT program equivalence, based on finite automata. This decisi"},"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":"2506.13383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-16T11:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"2f8d7972c97917e6b8cff04dd644775c25c7e076398437e18649bbf651fea6b8","abstract_canon_sha256":"7f400f6fd5eb00bdcc5418586d6d8ca4fdcdb0dac0bb3a11b868391da5a6e5a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:09.471120Z","signature_b64":"OYcxvliXREL3gAkCZJkRmbdS+59wJCdfTDYiyL9EbucraM4WzrvYygNHw/WOyKYAYqr8aGYcDUzhgKt3bqevAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39f2f0e4f612894c545a6cc18110874eacecc7dc1eec77d9d2b35399b15a435a","last_reissued_at":"2026-07-05T11:22:09.470642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:09.470642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"StacKAT: Infinite State Network Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexandra Silva, Dexter Kozen, Jana Wagemaker, Jules Jacobs, Lily Saada, Nate Foster, Tobias Kapp\\'e","submitted_at":"2025-06-16T11:47:27Z","abstract_excerpt":"We develop StacKAT, a network verification language featuring loops, finite state variables, nondeterminism, and - most importantly - access to a stack with accompanying push and pop operations. By viewing the variables and stack as the (parsed) headers and (to-be-parsed) contents of a network packet, StacKAT can express a wide range of network behaviors including parsing, source routing, and telemetry. These behaviors are difficult or impossible to model using existing languages like NetKAT. We develop a decision procedure for StacKAT program equivalence, based on finite automata. This decisi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13383","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/2506.13383/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":"2506.13383","created_at":"2026-07-05T11:22:09.470701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13383v1","created_at":"2026-07-05T11:22:09.470701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13383","created_at":"2026-07-05T11:22:09.470701+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHZPBZHWCKEU","created_at":"2026-07-05T11:22:09.470701+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHZPBZHWCKEUYVC2","created_at":"2026-07-05T11:22:09.470701+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHZPBZHW","created_at":"2026-07-05T11:22:09.470701+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/HHZPBZHWCKEUYVC2NTAYCEEHJ2","json":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2.json","graph_json":"https://pith.science/api/pith-number/HHZPBZHWCKEUYVC2NTAYCEEHJ2/graph.json","events_json":"https://pith.science/api/pith-number/HHZPBZHWCKEUYVC2NTAYCEEHJ2/events.json","paper":"https://pith.science/paper/HHZPBZHW"},"agent_actions":{"view_html":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2","download_json":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2.json","view_paper":"https://pith.science/paper/HHZPBZHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13383&json=true","fetch_graph":"https://pith.science/api/pith-number/HHZPBZHWCKEUYVC2NTAYCEEHJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/HHZPBZHWCKEUYVC2NTAYCEEHJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/action/storage_attestation","attest_author":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/action/author_attestation","sign_citation":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/action/citation_signature","submit_replication":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/action/replication_record"}},"created_at":"2026-07-05T11:22:09.470701+00:00","updated_at":"2026-07-05T11:22:09.470701+00:00"}