{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KLBM6MAVG4C2IO73CZTNPXCZ6I","short_pith_number":"pith:KLBM6MAV","canonical_record":{"source":{"id":"2505.21194","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-27T13:42:33Z","cross_cats_sorted":[],"title_canon_sha256":"d4792d2429582c2d323729fa7024936671273c8ab03ac84faf9c588093a085b4","abstract_canon_sha256":"85834c65109c7f268b73b2d5cc1ec9ea28ef66efb0b1fcad9227acb1bf0a1d42"},"schema_version":"1.0"},"canonical_sha256":"52c2cf30153705a43bfb1666d7dc59f2347cb8993d6cc1f75bb1576ec273910a","source":{"kind":"arxiv","id":"2505.21194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21194","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21194v1","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21194","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"KLBM6MAVG4C2","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"pith_short_16","alias_value":"KLBM6MAVG4C2IO73","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"pith_short_8","alias_value":"KLBM6MAV","created_at":"2026-07-05T11:10:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KLBM6MAVG4C2IO73CZTNPXCZ6I","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21194","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-27T13:42:33Z","cross_cats_sorted":[],"title_canon_sha256":"d4792d2429582c2d323729fa7024936671273c8ab03ac84faf9c588093a085b4","abstract_canon_sha256":"85834c65109c7f268b73b2d5cc1ec9ea28ef66efb0b1fcad9227acb1bf0a1d42"},"schema_version":"1.0"},"canonical_sha256":"52c2cf30153705a43bfb1666d7dc59f2347cb8993d6cc1f75bb1576ec273910a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:38.559299Z","signature_b64":"VZB/4zLjfql4KcphZ8/gDVhBofjBGNJ6z6v/Ia0VXK7MYN0sz1FYdlGxp8JS3BHvl4YbSsskxUsKSeyTudiXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52c2cf30153705a43bfb1666d7dc59f2347cb8993d6cc1f75bb1576ec273910a","last_reissued_at":"2026-07-05T11:10:38.558827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:38.558827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21194","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:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/y1f/I64PYgp4hyUh6yYbO/hdU+eioGb3AEJC1hIs8I2t3x+8ymfLsxgH4FYMJAjdbRRZ3Q0akgvQsKBZKADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:55:20.647356Z"},"content_sha256":"6844f396735951140f3f7e971781cccf2403a44b4928a672728c255887ec84e7","schema_version":"1.0","event_id":"sha256:6844f396735951140f3f7e971781cccf2403a44b4928a672728c255887ec84e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KLBM6MAVG4C2IO73CZTNPXCZ6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vectorized Sequence-Based Chunking for Data Deduplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Samer Al-Kiswany, Sreeharsha Udayashankar","submitted_at":"2025-05-27T13:42:33Z","abstract_excerpt":"Data deduplication has gained wide acclaim as a mechanism to improve storage efficiency and conserve network bandwidth. Its most critical phase, data chunking, is responsible for the overall space savings achieved via the deduplication process. However, modern data chunking algorithms are slow and compute-intensive because they scan large amounts of data while simultaneously making data-driven boundary decisions.\n  We present SeqCDC, a novel chunking algorithm that leverages lightweight boundary detection, content-defined skipping, and SSE/AVX acceleration to improve chunking throughput for la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21194","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/2505.21194/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:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ek65S/bxS5QaxLQxsNb2CnMMzzDUyJga+XHQ70OlJuzkaA7c1tQR2azeqOYI6janMKKpa1ewAbCvnM/787BTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:55:20.647887Z"},"content_sha256":"01e3583760ad435937664cfe04bec27e207143db564abd34fafc2115f0180422","schema_version":"1.0","event_id":"sha256:01e3583760ad435937664cfe04bec27e207143db564abd34fafc2115f0180422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLBM6MAVG4C2IO73CZTNPXCZ6I/bundle.json","state_url":"https://pith.science/pith/KLBM6MAVG4C2IO73CZTNPXCZ6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLBM6MAVG4C2IO73CZTNPXCZ6I/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-08T12:55:20Z","links":{"resolver":"https://pith.science/pith/KLBM6MAVG4C2IO73CZTNPXCZ6I","bundle":"https://pith.science/pith/KLBM6MAVG4C2IO73CZTNPXCZ6I/bundle.json","state":"https://pith.science/pith/KLBM6MAVG4C2IO73CZTNPXCZ6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLBM6MAVG4C2IO73CZTNPXCZ6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KLBM6MAVG4C2IO73CZTNPXCZ6I","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":"85834c65109c7f268b73b2d5cc1ec9ea28ef66efb0b1fcad9227acb1bf0a1d42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-27T13:42:33Z","title_canon_sha256":"d4792d2429582c2d323729fa7024936671273c8ab03ac84faf9c588093a085b4"},"schema_version":"1.0","source":{"id":"2505.21194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21194","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21194v1","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21194","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"KLBM6MAVG4C2","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"pith_short_16","alias_value":"KLBM6MAVG4C2IO73","created_at":"2026-07-05T11:10:38Z"},{"alias_kind":"pith_short_8","alias_value":"KLBM6MAV","created_at":"2026-07-05T11:10:38Z"}],"graph_snapshots":[{"event_id":"sha256:01e3583760ad435937664cfe04bec27e207143db564abd34fafc2115f0180422","target":"graph","created_at":"2026-07-05T11:10:38Z","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/2505.21194/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Data deduplication has gained wide acclaim as a mechanism to improve storage efficiency and conserve network bandwidth. Its most critical phase, data chunking, is responsible for the overall space savings achieved via the deduplication process. However, modern data chunking algorithms are slow and compute-intensive because they scan large amounts of data while simultaneously making data-driven boundary decisions.\n  We present SeqCDC, a novel chunking algorithm that leverages lightweight boundary detection, content-defined skipping, and SSE/AVX acceleration to improve chunking throughput for la","authors_text":"Samer Al-Kiswany, Sreeharsha Udayashankar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-27T13:42:33Z","title":"Vectorized Sequence-Based Chunking for Data Deduplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21194","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:6844f396735951140f3f7e971781cccf2403a44b4928a672728c255887ec84e7","target":"record","created_at":"2026-07-05T11:10:38Z","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":"85834c65109c7f268b73b2d5cc1ec9ea28ef66efb0b1fcad9227acb1bf0a1d42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-27T13:42:33Z","title_canon_sha256":"d4792d2429582c2d323729fa7024936671273c8ab03ac84faf9c588093a085b4"},"schema_version":"1.0","source":{"id":"2505.21194","kind":"arxiv","version":1}},"canonical_sha256":"52c2cf30153705a43bfb1666d7dc59f2347cb8993d6cc1f75bb1576ec273910a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52c2cf30153705a43bfb1666d7dc59f2347cb8993d6cc1f75bb1576ec273910a","first_computed_at":"2026-07-05T11:10:38.558827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:10:38.558827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZB/4zLjfql4KcphZ8/gDVhBofjBGNJ6z6v/Ia0VXK7MYN0sz1FYdlGxp8JS3BHvl4YbSsskxUsKSeyTudiXCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:10:38.559299Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6844f396735951140f3f7e971781cccf2403a44b4928a672728c255887ec84e7","sha256:01e3583760ad435937664cfe04bec27e207143db564abd34fafc2115f0180422"],"state_sha256":"83b2f50c55b50efedda98e0c034e19b7900d868209333ec02609c6fd5061a562"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSXGxpuOe4HIHuSEduxVSclLTzd4gzJmWN5YhBk1d1gmWWhi488AAndx/RM7hGTPluo1dzAoImAuDFjhFbOVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:55:20.653310Z","bundle_sha256":"3e68ae1974034a044097e06e42875d080d66182fcfb66d93e9451980660d2a7d"}}