{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NLW7TZ4ZEIVOCFXMUW6ZQGQM3S","short_pith_number":"pith:NLW7TZ4Z","schema_version":"1.0","canonical_sha256":"6aedf9e799222ae116eca5bd981a0cdc8740a7df1b8f0e4d73c3db7d5a29386a","source":{"kind":"arxiv","id":"1812.05520","version":1},"attestation_state":"computed","paper":{"title":"Toward incremental FIB aggregation with quick selections (FAQS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Garegin Grigoryan, Yaoqing Liu","submitted_at":"2018-12-13T16:56:25Z","abstract_excerpt":"Several approaches to mitigating the Forwarding Information Base (FIB) overflow problem were developed and software solutions using FIB aggregation are of particular interest. One of the greatest concerns to deploy these algorithms to real networks is their high running time and heavy computational overhead to handle thousands of FIB updates every second. In this work, we manage to use a single tree traversal to implement faster aggregation and update handling algorithm with much lower memory footprint than other existing work. We utilize 6-year realistic IPv4 and IPv6 routing tables from 2011"},"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":"1812.05520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-13T16:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"42379098bb8ecf260388c0d2af89e5fa2a2ae5b10d4de23f91862cc45de71b59","abstract_canon_sha256":"9cfea1945a37be7332d342c052035d1fb1ddd668323c92a0673526e7068f3e9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:20.058096Z","signature_b64":"7YQAu5VyHBEgzg80JmX0LRO9RrFgDLKUbh7RoKjU7TjBkUKcFpG+YMjLPIwihQNVGEU867O9Q8i8upPuculJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aedf9e799222ae116eca5bd981a0cdc8740a7df1b8f0e4d73c3db7d5a29386a","last_reissued_at":"2026-05-17T23:58:20.057722Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:20.057722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward incremental FIB aggregation with quick selections (FAQS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Garegin Grigoryan, Yaoqing Liu","submitted_at":"2018-12-13T16:56:25Z","abstract_excerpt":"Several approaches to mitigating the Forwarding Information Base (FIB) overflow problem were developed and software solutions using FIB aggregation are of particular interest. One of the greatest concerns to deploy these algorithms to real networks is their high running time and heavy computational overhead to handle thousands of FIB updates every second. In this work, we manage to use a single tree traversal to implement faster aggregation and update handling algorithm with much lower memory footprint than other existing work. We utilize 6-year realistic IPv4 and IPv6 routing tables from 2011"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05520","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":"1812.05520","created_at":"2026-05-17T23:58:20.057778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05520v1","created_at":"2026-05-17T23:58:20.057778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05520","created_at":"2026-05-17T23:58:20.057778+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLW7TZ4ZEIVO","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLW7TZ4ZEIVOCFXM","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLW7TZ4Z","created_at":"2026-05-18T12:32:40.477152+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/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S","json":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S.json","graph_json":"https://pith.science/api/pith-number/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/graph.json","events_json":"https://pith.science/api/pith-number/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/events.json","paper":"https://pith.science/paper/NLW7TZ4Z"},"agent_actions":{"view_html":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S","download_json":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S.json","view_paper":"https://pith.science/paper/NLW7TZ4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05520&json=true","fetch_graph":"https://pith.science/api/pith-number/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/graph.json","fetch_events":"https://pith.science/api/pith-number/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/action/storage_attestation","attest_author":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/action/author_attestation","sign_citation":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/action/citation_signature","submit_replication":"https://pith.science/pith/NLW7TZ4ZEIVOCFXMUW6ZQGQM3S/action/replication_record"}},"created_at":"2026-05-17T23:58:20.057778+00:00","updated_at":"2026-05-17T23:58:20.057778+00:00"}