{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7NFMOI6TO7GHCBNDBNL76IETZ6","short_pith_number":"pith:7NFMOI6T","canonical_record":{"source":{"id":"1601.07002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-26T13:02:19Z","cross_cats_sorted":[],"title_canon_sha256":"3a42a377ac6ba6f7cbd6a91980c9834d2dda5e8ce1694f38b0c16aee1dd19ca1","abstract_canon_sha256":"503620677144cb218b30462dd7a99a66b4222baed83823e1884ee61a2f03223a"},"schema_version":"1.0"},"canonical_sha256":"fb4ac723d377cc7105a30b57ff2093cf80bca761b1f4844120e2fc2b09dc9b6a","source":{"kind":"arxiv","id":"1601.07002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07002","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07002v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07002","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"7NFMOI6TO7GH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7NFMOI6TO7GHCBND","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7NFMOI6T","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7NFMOI6TO7GHCBNDBNL76IETZ6","target":"record","payload":{"canonical_record":{"source":{"id":"1601.07002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-26T13:02:19Z","cross_cats_sorted":[],"title_canon_sha256":"3a42a377ac6ba6f7cbd6a91980c9834d2dda5e8ce1694f38b0c16aee1dd19ca1","abstract_canon_sha256":"503620677144cb218b30462dd7a99a66b4222baed83823e1884ee61a2f03223a"},"schema_version":"1.0"},"canonical_sha256":"fb4ac723d377cc7105a30b57ff2093cf80bca761b1f4844120e2fc2b09dc9b6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:59.348003Z","signature_b64":"WAsbh2jpF8esS0ksINOswPDuOBZEbTbvE/UsMHGd0z7FlmHosFTXKsL3n+7zs36UBBjhPkdFxHd3IQJS0oZTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb4ac723d377cc7105a30b57ff2093cf80bca761b1f4844120e2fc2b09dc9b6a","last_reissued_at":"2026-05-18T01:21:59.347350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:59.347350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.07002","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-05-18T01:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTW0opEXbs4BR6Ciw+oeTzeRv9L5OFLcEzw0doOIbUihZOIUl8aUJsbVFS0OiLrMf9HTgSJ74qNdOyY8U0XbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:33:10.231931Z"},"content_sha256":"679d05d3c85ac8479027514c357ddf561215d9ad4e82b12fa67b97aef2da7947","schema_version":"1.0","event_id":"sha256:679d05d3c85ac8479027514c357ddf561215d9ad4e82b12fa67b97aef2da7947"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7NFMOI6TO7GHCBNDBNL76IETZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forwarding Tables Verification through Representative Header Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Diego Perino (LINCS), Fabien Mathieu (LINCS), GANG), Laurent Viennot (LINCS, Leonardo Linguaglossa (GANG, LINCS), Ricardo De La Paz (GANG), Yacine Boufkhad (LIAFA)","submitted_at":"2016-01-26T13:02:19Z","abstract_excerpt":"Forwarding table verification consists in checking the distributed data-structure resulting from the forwarding tables of a network. A classical concern is the detection of loops. We study this problem in the context of software-defined networking (SDN) where forwarding rules can be arbitrary bitmasks (generalizing prefix matching) and where tables are updated by a centralized controller. Basic verification problems such as loop detection are NP-hard and most previous work solves them with heuristics or SAT solvers. We follow a different approach based on computing a representation of the head"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07002","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":""},"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-05-18T01:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4vQ9Hn6BsXpQ1dFqI3Uyrh6UKKDhOAP7jCpA5ZAN8Gxh8N1+85CWKkQmE766FSVtTYVgYppFLZqEvTRmp/WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:33:10.232550Z"},"content_sha256":"8db6f21a5b0d91853687f9dc4a69fad7d0eb904f7b29e1bbd0f85c981ccd1095","schema_version":"1.0","event_id":"sha256:8db6f21a5b0d91853687f9dc4a69fad7d0eb904f7b29e1bbd0f85c981ccd1095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/bundle.json","state_url":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/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-05-23T11:33:10Z","links":{"resolver":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6","bundle":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/bundle.json","state":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7NFMOI6TO7GHCBNDBNL76IETZ6","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":"503620677144cb218b30462dd7a99a66b4222baed83823e1884ee61a2f03223a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-26T13:02:19Z","title_canon_sha256":"3a42a377ac6ba6f7cbd6a91980c9834d2dda5e8ce1694f38b0c16aee1dd19ca1"},"schema_version":"1.0","source":{"id":"1601.07002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07002","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07002v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07002","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"7NFMOI6TO7GH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7NFMOI6TO7GHCBND","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7NFMOI6T","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:8db6f21a5b0d91853687f9dc4a69fad7d0eb904f7b29e1bbd0f85c981ccd1095","target":"graph","created_at":"2026-05-18T01:21:59Z","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"},"paper":{"abstract_excerpt":"Forwarding table verification consists in checking the distributed data-structure resulting from the forwarding tables of a network. A classical concern is the detection of loops. We study this problem in the context of software-defined networking (SDN) where forwarding rules can be arbitrary bitmasks (generalizing prefix matching) and where tables are updated by a centralized controller. Basic verification problems such as loop detection are NP-hard and most previous work solves them with heuristics or SAT solvers. We follow a different approach based on computing a representation of the head","authors_text":"Diego Perino (LINCS), Fabien Mathieu (LINCS), GANG), Laurent Viennot (LINCS, Leonardo Linguaglossa (GANG, LINCS), Ricardo De La Paz (GANG), Yacine Boufkhad (LIAFA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-26T13:02:19Z","title":"Forwarding Tables Verification through Representative Header Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07002","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:679d05d3c85ac8479027514c357ddf561215d9ad4e82b12fa67b97aef2da7947","target":"record","created_at":"2026-05-18T01:21:59Z","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":"503620677144cb218b30462dd7a99a66b4222baed83823e1884ee61a2f03223a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-26T13:02:19Z","title_canon_sha256":"3a42a377ac6ba6f7cbd6a91980c9834d2dda5e8ce1694f38b0c16aee1dd19ca1"},"schema_version":"1.0","source":{"id":"1601.07002","kind":"arxiv","version":1}},"canonical_sha256":"fb4ac723d377cc7105a30b57ff2093cf80bca761b1f4844120e2fc2b09dc9b6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb4ac723d377cc7105a30b57ff2093cf80bca761b1f4844120e2fc2b09dc9b6a","first_computed_at":"2026-05-18T01:21:59.347350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:59.347350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WAsbh2jpF8esS0ksINOswPDuOBZEbTbvE/UsMHGd0z7FlmHosFTXKsL3n+7zs36UBBjhPkdFxHd3IQJS0oZTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:59.348003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:679d05d3c85ac8479027514c357ddf561215d9ad4e82b12fa67b97aef2da7947","sha256:8db6f21a5b0d91853687f9dc4a69fad7d0eb904f7b29e1bbd0f85c981ccd1095"],"state_sha256":"5381c4f042f90aa7c1bbb3ae2664268be717d6c63b2c7602ef51d692aed81413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBSfxPeuMboLxKiZlGHMepE/Y75JyrmrV/YtARQ64wmZQqxN4SsikK6mPuL25lfkoKozvRZc6gxoGJRwhB1fBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T11:33:10.235510Z","bundle_sha256":"2647982af26a35a99b5a7410ec2edc9cd535e82dee7bf105b56e0dc084fc9c85"}}