{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IJQ7W7FSAW3IIYW44IW2HDLPLK","short_pith_number":"pith:IJQ7W7FS","canonical_record":{"source":{"id":"1811.11746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-29T15:20:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8a00afafc441375d4ad9529e40a40c0ab0e95d8bcfbb1edbff430d0158786161","abstract_canon_sha256":"29a5dfdcfa9693f76fa9673a0ef158f6659e5500288c9f21bdcb1fbe8aad3fdf"},"schema_version":"1.0"},"canonical_sha256":"4261fb7cb205b68462dce22da38d6f5aba5ff34b3ab7499d65489a3590834b88","source":{"kind":"arxiv","id":"1811.11746","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11746","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11746v1","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11746","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"IJQ7W7FSAW3I","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IJQ7W7FSAW3IIYW4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IJQ7W7FS","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IJQ7W7FSAW3IIYW44IW2HDLPLK","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-29T15:20:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8a00afafc441375d4ad9529e40a40c0ab0e95d8bcfbb1edbff430d0158786161","abstract_canon_sha256":"29a5dfdcfa9693f76fa9673a0ef158f6659e5500288c9f21bdcb1fbe8aad3fdf"},"schema_version":"1.0"},"canonical_sha256":"4261fb7cb205b68462dce22da38d6f5aba5ff34b3ab7499d65489a3590834b88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:37.735435Z","signature_b64":"4v0UNOhcVCV/x1a0bKoukE9BK5OcqjjkmB8TNnfQ2seK4SSIdSG4tNHGElIpRgOdhXHDRy1l86Yk3nKa4RvADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4261fb7cb205b68462dce22da38d6f5aba5ff34b3ab7499d65489a3590834b88","last_reissued_at":"2026-05-17T23:59:37.734642Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:37.734642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11746","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-17T23:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DY1fFZni3sM8QINM+ocm65idX4dgGzQtYy6lUJwJnK8r4i4iPBP11Lau4GlIaIchVnhelMCzcS+p055cGbwbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:27:20.668175Z"},"content_sha256":"985c6326519933368efe2803c4fa0ad8903cc7f3f015803eb5653f71c67d0c42","schema_version":"1.0","event_id":"sha256:985c6326519933368efe2803c4fa0ad8903cc7f3f015803eb5653f71c67d0c42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IJQ7W7FSAW3IIYW44IW2HDLPLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Sparse TFIDF & Incremental Similarity with Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.IR","authors_text":"Pavel Brazdil, Rui Portocarrero Sarmento","submitted_at":"2018-11-29T15:20:32Z","abstract_excerpt":"In this report, we experimented with several concepts regarding text streams analysis.\n  We tested an implementation of Incremental Sparse TF-IDF (IS-TFIDF) and Incremental Cosine Similarity (ICS) with the use of bipartite graphs.\n  We are using bipartite graphs - one type of node are documents, and the other type of nodes are words - to know what documents are affected with a word arrival at the stream (the neighbors of the word in the graph). Thus, with this information, we leverage optimized algorithms used for graph-based applications. The concept is similar to, for example, the use of has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11746","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-17T23:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVOlBhwrJ1uHVPp2HbPNUq2Y2G+NsfrxC7kSq4REVN3CtlxZwb8ovQT0DdCm7MYvi0fn2incpAlP9yY58VDGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:27:20.668947Z"},"content_sha256":"1e647e43bb83b5e405e08101f65aaa6d2bba02bf23b06bbfd21f2c785ad55cab","schema_version":"1.0","event_id":"sha256:1e647e43bb83b5e405e08101f65aaa6d2bba02bf23b06bbfd21f2c785ad55cab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJQ7W7FSAW3IIYW44IW2HDLPLK/bundle.json","state_url":"https://pith.science/pith/IJQ7W7FSAW3IIYW44IW2HDLPLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJQ7W7FSAW3IIYW44IW2HDLPLK/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-06-08T20:27:20Z","links":{"resolver":"https://pith.science/pith/IJQ7W7FSAW3IIYW44IW2HDLPLK","bundle":"https://pith.science/pith/IJQ7W7FSAW3IIYW44IW2HDLPLK/bundle.json","state":"https://pith.science/pith/IJQ7W7FSAW3IIYW44IW2HDLPLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJQ7W7FSAW3IIYW44IW2HDLPLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IJQ7W7FSAW3IIYW44IW2HDLPLK","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":"29a5dfdcfa9693f76fa9673a0ef158f6659e5500288c9f21bdcb1fbe8aad3fdf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-29T15:20:32Z","title_canon_sha256":"8a00afafc441375d4ad9529e40a40c0ab0e95d8bcfbb1edbff430d0158786161"},"schema_version":"1.0","source":{"id":"1811.11746","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11746","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11746v1","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11746","created_at":"2026-05-17T23:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"IJQ7W7FSAW3I","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IJQ7W7FSAW3IIYW4","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IJQ7W7FS","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:1e647e43bb83b5e405e08101f65aaa6d2bba02bf23b06bbfd21f2c785ad55cab","target":"graph","created_at":"2026-05-17T23:59:37Z","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":"In this report, we experimented with several concepts regarding text streams analysis.\n  We tested an implementation of Incremental Sparse TF-IDF (IS-TFIDF) and Incremental Cosine Similarity (ICS) with the use of bipartite graphs.\n  We are using bipartite graphs - one type of node are documents, and the other type of nodes are words - to know what documents are affected with a word arrival at the stream (the neighbors of the word in the graph). Thus, with this information, we leverage optimized algorithms used for graph-based applications. The concept is similar to, for example, the use of has","authors_text":"Pavel Brazdil, Rui Portocarrero Sarmento","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-29T15:20:32Z","title":"Incremental Sparse TFIDF & Incremental Similarity with Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11746","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:985c6326519933368efe2803c4fa0ad8903cc7f3f015803eb5653f71c67d0c42","target":"record","created_at":"2026-05-17T23:59:37Z","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":"29a5dfdcfa9693f76fa9673a0ef158f6659e5500288c9f21bdcb1fbe8aad3fdf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-29T15:20:32Z","title_canon_sha256":"8a00afafc441375d4ad9529e40a40c0ab0e95d8bcfbb1edbff430d0158786161"},"schema_version":"1.0","source":{"id":"1811.11746","kind":"arxiv","version":1}},"canonical_sha256":"4261fb7cb205b68462dce22da38d6f5aba5ff34b3ab7499d65489a3590834b88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4261fb7cb205b68462dce22da38d6f5aba5ff34b3ab7499d65489a3590834b88","first_computed_at":"2026-05-17T23:59:37.734642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:37.734642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4v0UNOhcVCV/x1a0bKoukE9BK5OcqjjkmB8TNnfQ2seK4SSIdSG4tNHGElIpRgOdhXHDRy1l86Yk3nKa4RvADQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:37.735435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11746","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:985c6326519933368efe2803c4fa0ad8903cc7f3f015803eb5653f71c67d0c42","sha256:1e647e43bb83b5e405e08101f65aaa6d2bba02bf23b06bbfd21f2c785ad55cab"],"state_sha256":"8bb99cfdc2d133391b5a0a0d412b20a9a86ca50f6b65117cc497a8670faaf18f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcDjdksJORIdM6OxSlnSBKOE4pyAOb9dJq6Plgid8wRtxd2iqH+nCtJnS5x0R5zQ5DR+UyrvjNPotcN+FXjsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:27:20.672935Z","bundle_sha256":"e0e4218936085110df93b36d288fc72880aed2fcb8c81c5a79bb9df8edd3b45d"}}