{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W3O36CVR2PAEUNJLVBH75MXILV","short_pith_number":"pith:W3O36CVR","canonical_record":{"source":{"id":"1707.08272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T02:01:22Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"f721acce1707c7a6ad7f7bdc1f62fb7093c2bb8c7d57eed75551bf65fa10223c","abstract_canon_sha256":"29bed051916ba74744da92d00ccc1bffb0266d9f49d8955998398e1f5426d8e1"},"schema_version":"1.0"},"canonical_sha256":"b6ddbf0ab1d3c04a352ba84ffeb2e85d6f7efaff32d24b1e748a6979ea67cd7b","source":{"kind":"arxiv","id":"1707.08272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08272","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08272v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08272","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"W3O36CVR2PAE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3O36CVR2PAEUNJL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3O36CVR","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W3O36CVR2PAEUNJLVBH75MXILV","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T02:01:22Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"f721acce1707c7a6ad7f7bdc1f62fb7093c2bb8c7d57eed75551bf65fa10223c","abstract_canon_sha256":"29bed051916ba74744da92d00ccc1bffb0266d9f49d8955998398e1f5426d8e1"},"schema_version":"1.0"},"canonical_sha256":"b6ddbf0ab1d3c04a352ba84ffeb2e85d6f7efaff32d24b1e748a6979ea67cd7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.740546Z","signature_b64":"PzS6MNRkhKYgImYX5GjtYMLEzgB4XA+uKnXhX6ZnY6ejaMmSOhHR0WPQuDZiRA78BAJr1VNb59qJFKMYelUoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ddbf0ab1d3c04a352ba84ffeb2e85d6f7efaff32d24b1e748a6979ea67cd7b","last_reissued_at":"2026-05-18T00:39:24.740042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.740042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08272","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-18T00:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKMQOvPfwvClndpk+sCDO2ImLwdDreaxZ+/D3Rev74BdSDPug0M7Bjl62qUC1LRjQmsHnURzcTgqXIWx7FLzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:34:35.400096Z"},"content_sha256":"ab1f05125e2291f73445d00f74fe8175c7e0b32a95bb8c4f3c02d7681762b66e","schema_version":"1.0","event_id":"sha256:ab1f05125e2291f73445d00f74fe8175c7e0b32a95bb8c4f3c02d7681762b66e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W3O36CVR2PAEUNJLVBH75MXILV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Apurba Das, Srikanta Tirthapura","submitted_at":"2017-07-26T02:01:22Z","abstract_excerpt":"We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph changes, we are interested in knowing the change in the set of maximal bicliques (the \"change\"), rather than in knowing the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without explicitly enumerating the set of all maximal bicliques. In this work, we present (1) near-tight bounds on the magnitude of change in the set of maximal bicliques of a graph,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08272","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-18T00:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLMjQ+8jiouYUvbi12ZtP/pyw911oVGGf0lQ1DehPIHskcIzZTlC6SGWL8UKXDzEM+VrNCgmeQUVvW+qXQgjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:34:35.400830Z"},"content_sha256":"89333692c85b05787a326d62067a9d1cd2cec5e9e01dfe14a6d2342fcf01e53c","schema_version":"1.0","event_id":"sha256:89333692c85b05787a326d62067a9d1cd2cec5e9e01dfe14a6d2342fcf01e53c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3O36CVR2PAEUNJLVBH75MXILV/bundle.json","state_url":"https://pith.science/pith/W3O36CVR2PAEUNJLVBH75MXILV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3O36CVR2PAEUNJLVBH75MXILV/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-10T22:34:35Z","links":{"resolver":"https://pith.science/pith/W3O36CVR2PAEUNJLVBH75MXILV","bundle":"https://pith.science/pith/W3O36CVR2PAEUNJLVBH75MXILV/bundle.json","state":"https://pith.science/pith/W3O36CVR2PAEUNJLVBH75MXILV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3O36CVR2PAEUNJLVBH75MXILV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W3O36CVR2PAEUNJLVBH75MXILV","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":"29bed051916ba74744da92d00ccc1bffb0266d9f49d8955998398e1f5426d8e1","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T02:01:22Z","title_canon_sha256":"f721acce1707c7a6ad7f7bdc1f62fb7093c2bb8c7d57eed75551bf65fa10223c"},"schema_version":"1.0","source":{"id":"1707.08272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08272","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08272v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08272","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"W3O36CVR2PAE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3O36CVR2PAEUNJL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3O36CVR","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:89333692c85b05787a326d62067a9d1cd2cec5e9e01dfe14a6d2342fcf01e53c","target":"graph","created_at":"2026-05-18T00:39:24Z","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":"We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph changes, we are interested in knowing the change in the set of maximal bicliques (the \"change\"), rather than in knowing the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without explicitly enumerating the set of all maximal bicliques. In this work, we present (1) near-tight bounds on the magnitude of change in the set of maximal bicliques of a graph,","authors_text":"Apurba Das, Srikanta Tirthapura","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T02:01:22Z","title":"A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08272","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:ab1f05125e2291f73445d00f74fe8175c7e0b32a95bb8c4f3c02d7681762b66e","target":"record","created_at":"2026-05-18T00:39:24Z","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":"29bed051916ba74744da92d00ccc1bffb0266d9f49d8955998398e1f5426d8e1","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-26T02:01:22Z","title_canon_sha256":"f721acce1707c7a6ad7f7bdc1f62fb7093c2bb8c7d57eed75551bf65fa10223c"},"schema_version":"1.0","source":{"id":"1707.08272","kind":"arxiv","version":1}},"canonical_sha256":"b6ddbf0ab1d3c04a352ba84ffeb2e85d6f7efaff32d24b1e748a6979ea67cd7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6ddbf0ab1d3c04a352ba84ffeb2e85d6f7efaff32d24b1e748a6979ea67cd7b","first_computed_at":"2026-05-18T00:39:24.740042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:24.740042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PzS6MNRkhKYgImYX5GjtYMLEzgB4XA+uKnXhX6ZnY6ejaMmSOhHR0WPQuDZiRA78BAJr1VNb59qJFKMYelUoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:24.740546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab1f05125e2291f73445d00f74fe8175c7e0b32a95bb8c4f3c02d7681762b66e","sha256:89333692c85b05787a326d62067a9d1cd2cec5e9e01dfe14a6d2342fcf01e53c"],"state_sha256":"0238dd183bc9c539a2d50f263770c9c8b2e77dd0f9fc3625c0daedbe0d5fded6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlUODrdumW2g0j66JbRCJGOMgjzwoL9CA1YEPTrX2UOBhDklkQOFTmNp7XhF8uQQcwPPDAHe6q1ZjMgpANeaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:34:35.404972Z","bundle_sha256":"7f6b56917e7330f6a38539e27a5565b71112d65ecfa2919dbfcd8c5c2854849d"}}