{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KAIDBT2WTXELWVMEUZF6PG2BRR","short_pith_number":"pith:KAIDBT2W","schema_version":"1.0","canonical_sha256":"501030cf569dc8bb5584a64be79b418c423055df3fc675ef9489c835e63a2d14","source":{"kind":"arxiv","id":"2209.05725","version":1},"attestation_state":"computed","paper":{"title":"Hypersparse Network Flow Analysis of Packets with GraphBLAS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Adam Michaleas, Albert Reuther, Andrew Prout, Anna Klein, Antonio Rosa, Chad Meiners, Chansup Byun, Charles Yee, David Bestor, Doug Stetson, Erik Welch, Hayden Jananthan, Jeremy Kepner, Julie Mullen, Lauren Milechin, Matthew Hubbell, Michael Jones, Micheal Houle, Peter Michaleas, Sandeep Pisharody, Siddharth Samsi, Timothy Davis, Tyler Trigg, Vijay Gadepally, William Arcand, William Bergeron","submitted_at":"2022-09-13T04:28:28Z","abstract_excerpt":"Internet analysis is a major challenge due to the volume and rate of network traffic. In lieu of analyzing traffic as raw packets, network analysts often rely on compressed network flows (netflows) that contain the start time, stop time, source, destination, and number of packets in each direction. However, many traffic analyses benefit from temporal aggregation of multiple simultaneous netflows, which can be computationally challenging. To alleviate this concern, a novel netflow compression and resampling method has been developed leveraging GraphBLAS hyperspace traffic matrices that preserve"},"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":"2209.05725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2022-09-13T04:28:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"bde0b3349dc55d083990e3f5954952552943e37ad966eca571694ff8dfa176ed","abstract_canon_sha256":"e595af05660a9e5949a265bf6c855d76382873c9ae872752dec1126ebc64bd57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:49.486965Z","signature_b64":"4gWBDqoOeh6kWqvKJjh/UFAce1qxDD/wh/UbIIpNyMFH2e++RmHgacxHx7SSdORSvToDfX6WAx7HvYhK+22kCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"501030cf569dc8bb5584a64be79b418c423055df3fc675ef9489c835e63a2d14","last_reissued_at":"2026-07-05T04:56:49.486550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:49.486550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypersparse Network Flow Analysis of Packets with GraphBLAS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Adam Michaleas, Albert Reuther, Andrew Prout, Anna Klein, Antonio Rosa, Chad Meiners, Chansup Byun, Charles Yee, David Bestor, Doug Stetson, Erik Welch, Hayden Jananthan, Jeremy Kepner, Julie Mullen, Lauren Milechin, Matthew Hubbell, Michael Jones, Micheal Houle, Peter Michaleas, Sandeep Pisharody, Siddharth Samsi, Timothy Davis, Tyler Trigg, Vijay Gadepally, William Arcand, William Bergeron","submitted_at":"2022-09-13T04:28:28Z","abstract_excerpt":"Internet analysis is a major challenge due to the volume and rate of network traffic. In lieu of analyzing traffic as raw packets, network analysts often rely on compressed network flows (netflows) that contain the start time, stop time, source, destination, and number of packets in each direction. However, many traffic analyses benefit from temporal aggregation of multiple simultaneous netflows, which can be computationally challenging. To alleviate this concern, a novel netflow compression and resampling method has been developed leveraging GraphBLAS hyperspace traffic matrices that preserve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05725","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/2209.05725/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":"2209.05725","created_at":"2026-07-05T04:56:49.486613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.05725v1","created_at":"2026-07-05T04:56:49.486613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05725","created_at":"2026-07-05T04:56:49.486613+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAIDBT2WTXEL","created_at":"2026-07-05T04:56:49.486613+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAIDBT2WTXELWVME","created_at":"2026-07-05T04:56:49.486613+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAIDBT2W","created_at":"2026-07-05T04:56:49.486613+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/KAIDBT2WTXELWVMEUZF6PG2BRR","json":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR.json","graph_json":"https://pith.science/api/pith-number/KAIDBT2WTXELWVMEUZF6PG2BRR/graph.json","events_json":"https://pith.science/api/pith-number/KAIDBT2WTXELWVMEUZF6PG2BRR/events.json","paper":"https://pith.science/paper/KAIDBT2W"},"agent_actions":{"view_html":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR","download_json":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR.json","view_paper":"https://pith.science/paper/KAIDBT2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.05725&json=true","fetch_graph":"https://pith.science/api/pith-number/KAIDBT2WTXELWVMEUZF6PG2BRR/graph.json","fetch_events":"https://pith.science/api/pith-number/KAIDBT2WTXELWVMEUZF6PG2BRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR/action/storage_attestation","attest_author":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR/action/author_attestation","sign_citation":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR/action/citation_signature","submit_replication":"https://pith.science/pith/KAIDBT2WTXELWVMEUZF6PG2BRR/action/replication_record"}},"created_at":"2026-07-05T04:56:49.486613+00:00","updated_at":"2026-07-05T04:56:49.486613+00:00"}