{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7NFMOI6TO7GHCBNDBNL76IETZ6","short_pith_number":"pith:7NFMOI6T","schema_version":"1.0","canonical_sha256":"fb4ac723d377cc7105a30b57ff2093cf80bca761b1f4844120e2fc2b09dc9b6a","source":{"kind":"arxiv","id":"1601.07002","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.07002","created_at":"2026-05-18T01:21:59.347459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07002v1","created_at":"2026-05-18T01:21:59.347459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07002","created_at":"2026-05-18T01:21:59.347459+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NFMOI6TO7GH","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NFMOI6TO7GHCBND","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NFMOI6T","created_at":"2026-05-18T12:30:04.600751+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/7NFMOI6TO7GHCBNDBNL76IETZ6","json":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6.json","graph_json":"https://pith.science/api/pith-number/7NFMOI6TO7GHCBNDBNL76IETZ6/graph.json","events_json":"https://pith.science/api/pith-number/7NFMOI6TO7GHCBNDBNL76IETZ6/events.json","paper":"https://pith.science/paper/7NFMOI6T"},"agent_actions":{"view_html":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6","download_json":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6.json","view_paper":"https://pith.science/paper/7NFMOI6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07002&json=true","fetch_graph":"https://pith.science/api/pith-number/7NFMOI6TO7GHCBNDBNL76IETZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/7NFMOI6TO7GHCBNDBNL76IETZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/action/storage_attestation","attest_author":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/action/author_attestation","sign_citation":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/action/citation_signature","submit_replication":"https://pith.science/pith/7NFMOI6TO7GHCBNDBNL76IETZ6/action/replication_record"}},"created_at":"2026-05-18T01:21:59.347459+00:00","updated_at":"2026-05-18T01:21:59.347459+00:00"}