{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WX2TVSZFSWWZ36KFD2QSGRA6M2","short_pith_number":"pith:WX2TVSZF","canonical_record":{"source":{"id":"1207.3397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-14T06:57:22Z","cross_cats_sorted":[],"title_canon_sha256":"2bd0d62c432443444925f364df376ddecc585b2cae637c094b560d31411b3ba8","abstract_canon_sha256":"26ae79ae567b691d45be2338c100789770c9794ca694a400eb39cab2e7bc3e7f"},"schema_version":"1.0"},"canonical_sha256":"b5f53acb2595ad9df9451ea123441e66a360c02aa5d779cfea7544c270e18e0b","source":{"kind":"arxiv","id":"1207.3397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3397","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3397v1","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3397","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"WX2TVSZFSWWZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WX2TVSZFSWWZ36KF","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WX2TVSZF","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WX2TVSZFSWWZ36KFD2QSGRA6M2","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-14T06:57:22Z","cross_cats_sorted":[],"title_canon_sha256":"2bd0d62c432443444925f364df376ddecc585b2cae637c094b560d31411b3ba8","abstract_canon_sha256":"26ae79ae567b691d45be2338c100789770c9794ca694a400eb39cab2e7bc3e7f"},"schema_version":"1.0"},"canonical_sha256":"b5f53acb2595ad9df9451ea123441e66a360c02aa5d779cfea7544c270e18e0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:01.303258Z","signature_b64":"7O6N6/4VbxYd07jV6sYYArpOQDfdsdIvCnxpMU+kfSL7ouX7ftJ4f0mvb7tHulC4EcOthDk3NB7LypXDqaAwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5f53acb2595ad9df9451ea123441e66a360c02aa5d779cfea7544c270e18e0b","last_reissued_at":"2026-05-18T03:51:01.302378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:01.302378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3397","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-18T03:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mp5ojW6T2bKVP8vKVNDnn8mPWIvZsvJ4qZJNtuGhhe61LGXUoEoiG0yApmp121W/1jHfLpdK5+6Jvp+y2z2sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:46:21.639450Z"},"content_sha256":"4cd439efdf619e41a4b452e2975812d774e2832c1336e09d3fbbedadb2cf2f64","schema_version":"1.0","event_id":"sha256:4cd439efdf619e41a4b452e2975812d774e2832c1336e09d3fbbedadb2cf2f64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WX2TVSZFSWWZ36KFD2QSGRA6M2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on d-Biclique Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Farokhlagha Moazami, Nasrin Soltankhah, Shahzad Basiriz","submitted_at":"2012-07-14T06:57:22Z","abstract_excerpt":"A d-biclique cover of a graph G is a collection of bicliques of G such that each edge of G is in at least d of the bicliques. The number of bicliques in a minimum d-biclique cover of G is called the d-biclique covering number of G and is denoted by ${bc}_d(G)$. In this paper, we present an upper bound for the d- biclique covering number of the lexicographic product of graphs. Also, we introduce some bounds of this parameter for some graph constructions and obtain the exact value of the d-biclique covering number of some graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3397","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-18T03:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAt9XykjrgDz4DSfC6WDp4p31Y4sncQqq33ZIuCNj+MqycEYTuFVcAUsspXS52kRuMY5EMFDxzRcH4kXz4xJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:46:21.639786Z"},"content_sha256":"d975383edcfa8d9f1a00fdbbd3b01825419925b8940c66b0f23fcff617bd62ba","schema_version":"1.0","event_id":"sha256:d975383edcfa8d9f1a00fdbbd3b01825419925b8940c66b0f23fcff617bd62ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WX2TVSZFSWWZ36KFD2QSGRA6M2/bundle.json","state_url":"https://pith.science/pith/WX2TVSZFSWWZ36KFD2QSGRA6M2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WX2TVSZFSWWZ36KFD2QSGRA6M2/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-28T12:46:21Z","links":{"resolver":"https://pith.science/pith/WX2TVSZFSWWZ36KFD2QSGRA6M2","bundle":"https://pith.science/pith/WX2TVSZFSWWZ36KFD2QSGRA6M2/bundle.json","state":"https://pith.science/pith/WX2TVSZFSWWZ36KFD2QSGRA6M2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WX2TVSZFSWWZ36KFD2QSGRA6M2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WX2TVSZFSWWZ36KFD2QSGRA6M2","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":"26ae79ae567b691d45be2338c100789770c9794ca694a400eb39cab2e7bc3e7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-14T06:57:22Z","title_canon_sha256":"2bd0d62c432443444925f364df376ddecc585b2cae637c094b560d31411b3ba8"},"schema_version":"1.0","source":{"id":"1207.3397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3397","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3397v1","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3397","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"WX2TVSZFSWWZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WX2TVSZFSWWZ36KF","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WX2TVSZF","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:d975383edcfa8d9f1a00fdbbd3b01825419925b8940c66b0f23fcff617bd62ba","target":"graph","created_at":"2026-05-18T03:51:01Z","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":"A d-biclique cover of a graph G is a collection of bicliques of G such that each edge of G is in at least d of the bicliques. The number of bicliques in a minimum d-biclique cover of G is called the d-biclique covering number of G and is denoted by ${bc}_d(G)$. In this paper, we present an upper bound for the d- biclique covering number of the lexicographic product of graphs. Also, we introduce some bounds of this parameter for some graph constructions and obtain the exact value of the d-biclique covering number of some graphs.","authors_text":"Farokhlagha Moazami, Nasrin Soltankhah, Shahzad Basiriz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-14T06:57:22Z","title":"A Note on d-Biclique Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3397","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:4cd439efdf619e41a4b452e2975812d774e2832c1336e09d3fbbedadb2cf2f64","target":"record","created_at":"2026-05-18T03:51:01Z","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":"26ae79ae567b691d45be2338c100789770c9794ca694a400eb39cab2e7bc3e7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-14T06:57:22Z","title_canon_sha256":"2bd0d62c432443444925f364df376ddecc585b2cae637c094b560d31411b3ba8"},"schema_version":"1.0","source":{"id":"1207.3397","kind":"arxiv","version":1}},"canonical_sha256":"b5f53acb2595ad9df9451ea123441e66a360c02aa5d779cfea7544c270e18e0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5f53acb2595ad9df9451ea123441e66a360c02aa5d779cfea7544c270e18e0b","first_computed_at":"2026-05-18T03:51:01.302378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:01.302378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7O6N6/4VbxYd07jV6sYYArpOQDfdsdIvCnxpMU+kfSL7ouX7ftJ4f0mvb7tHulC4EcOthDk3NB7LypXDqaAwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:01.303258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cd439efdf619e41a4b452e2975812d774e2832c1336e09d3fbbedadb2cf2f64","sha256:d975383edcfa8d9f1a00fdbbd3b01825419925b8940c66b0f23fcff617bd62ba"],"state_sha256":"699467058bcfbf5cd86b18a62ef7d611bd62f990ec930ac2a87dfc24899b5337"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+3EzAo9/DZrPCyCxCCqYGXf51rGpBn+OocbbMyPfG/LTq1PDfQhQtCVx/dmqfqg0DDJ5p8IH5Be0aWN5Wd+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:46:21.641599Z","bundle_sha256":"39ad88ee08c1c3eca50ddbfbb9cc8291fd46a22dff0d99b81d784c4de46af275"}}