{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HHZPBZHWCKEUYVC2NTAYCEEHJ2","short_pith_number":"pith:HHZPBZHW","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"},"canonical_sha256":"39f2f0e4f612894c545a6cc18110874eacecc7dc1eec77d9d2b35399b15a435a","source":{"kind":"arxiv","id":"2506.13383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.13383","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"2506.13383v1","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13383","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"HHZPBZHWCKEU","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"pith_short_16","alias_value":"HHZPBZHWCKEUYVC2","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"pith_short_8","alias_value":"HHZPBZHW","created_at":"2026-07-05T11:22:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HHZPBZHWCKEUYVC2NTAYCEEHJ2","target":"record","payload":{"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"},"canonical_sha256":"39f2f0e4f612894c545a6cc18110874eacecc7dc1eec77d9d2b35399b15a435a","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"},"source_kind":"arxiv","source_id":"2506.13383","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1CYVIQ9FQxxetB+zd6PdYcjhwvNCWi+ysuBFt0w30qHrCHFuIAJznzjdBLa/NAg3VdzYSQSguw4xjzJa9wJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T16:46:54.823729Z"},"content_sha256":"a0f1fbf2e521c35c200485b7577a1f997d16c706e303bb6e7e8dcc0b78c2fee2","schema_version":"1.0","event_id":"sha256:a0f1fbf2e521c35c200485b7577a1f997d16c706e303bb6e7e8dcc0b78c2fee2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HHZPBZHWCKEUYVC2NTAYCEEHJ2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQ84ySQSWFrekn0vKB3+U8F+h4e3zLd5llowpYINpSGP2PqyGEJaBywsJdiKBrQ7CrjiWgkLrqqIQq8dNfHpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T16:46:54.824315Z"},"content_sha256":"e2832f50f799f9e8afd9b9da37256ce07e977dabc7ed482f3d84fb17d5a68fd0","schema_version":"1.0","event_id":"sha256:e2832f50f799f9e8afd9b9da37256ce07e977dabc7ed482f3d84fb17d5a68fd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/bundle.json","state_url":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T16:46:54Z","links":{"resolver":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2","bundle":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/bundle.json","state":"https://pith.science/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHZPBZHWCKEUYVC2NTAYCEEHJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HHZPBZHWCKEUYVC2NTAYCEEHJ2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7f400f6fd5eb00bdcc5418586d6d8ca4fdcdb0dac0bb3a11b868391da5a6e5a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-16T11:47:27Z","title_canon_sha256":"2f8d7972c97917e6b8cff04dd644775c25c7e076398437e18649bbf651fea6b8"},"schema_version":"1.0","source":{"id":"2506.13383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.13383","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"2506.13383v1","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13383","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"HHZPBZHWCKEU","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"pith_short_16","alias_value":"HHZPBZHWCKEUYVC2","created_at":"2026-07-05T11:22:09Z"},{"alias_kind":"pith_short_8","alias_value":"HHZPBZHW","created_at":"2026-07-05T11:22:09Z"}],"graph_snapshots":[{"event_id":"sha256:e2832f50f799f9e8afd9b9da37256ce07e977dabc7ed482f3d84fb17d5a68fd0","target":"graph","created_at":"2026-07-05T11:22:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.13383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexandra Silva, Dexter Kozen, Jana Wagemaker, Jules Jacobs, Lily Saada, Nate Foster, Tobias Kapp\\'e","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-16T11:47:27Z","title":"StacKAT: Infinite State Network Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13383","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a0f1fbf2e521c35c200485b7577a1f997d16c706e303bb6e7e8dcc0b78c2fee2","target":"record","created_at":"2026-07-05T11:22:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7f400f6fd5eb00bdcc5418586d6d8ca4fdcdb0dac0bb3a11b868391da5a6e5a9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-16T11:47:27Z","title_canon_sha256":"2f8d7972c97917e6b8cff04dd644775c25c7e076398437e18649bbf651fea6b8"},"schema_version":"1.0","source":{"id":"2506.13383","kind":"arxiv","version":1}},"canonical_sha256":"39f2f0e4f612894c545a6cc18110874eacecc7dc1eec77d9d2b35399b15a435a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39f2f0e4f612894c545a6cc18110874eacecc7dc1eec77d9d2b35399b15a435a","first_computed_at":"2026-07-05T11:22:09.470642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:22:09.470642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OYcxvliXREL3gAkCZJkRmbdS+59wJCdfTDYiyL9EbucraM4WzrvYygNHw/WOyKYAYqr8aGYcDUzhgKt3bqevAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:22:09.471120Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.13383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0f1fbf2e521c35c200485b7577a1f997d16c706e303bb6e7e8dcc0b78c2fee2","sha256:e2832f50f799f9e8afd9b9da37256ce07e977dabc7ed482f3d84fb17d5a68fd0"],"state_sha256":"5d7b71ed0302c1f9fbf223ae9456b972aad704cbc4572ea60b4cedd85f0ca217"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGGR6aHKME2za/PY38s8fCzYWWQCcESDnR0C8+y1hhn7H/KfBh8JP6dKLpnleScNOoHyK4kGryjkk05J6x1DBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T16:46:54.828583Z","bundle_sha256":"d6b6dc842a1154bbf98b2d58e70b620b4af1bd6b8bd5ba0049b4863ca0452d2d"}}