{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6D3SE6YTOM4PA52MFJ2ZI4YE3Z","short_pith_number":"pith:6D3SE6YT","schema_version":"1.0","canonical_sha256":"f0f7227b137338f0774c2a75947304de4950b7d19424d18cc6d5bd9fec6af58a","source":{"kind":"arxiv","id":"1908.06656","version":3},"attestation_state":"computed","paper":{"title":"On the edge-biclique graph and the iterated edge-biclique operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Leandro Montero, Sylvain Legay","submitted_at":"2019-08-19T09:21:36Z","abstract_excerpt":"A biclique of a graph $G$ is a maximal induced complete bipartite subgraph of $G$. The edge-biclique graph of $G$, $KB_e(G)$, is the edge-intersection graph of the bicliques of $G$. A graph $G$ diverges (resp. converges or is periodic) under an operator $H$ whenever $\\lim_{k \\rightarrow \\infty}|V(H^k(G))|=\\infty$ (resp. $\\lim_{k \\rightarrow \\infty}H^k(G)=H^m(G)$ for some $m$ or $H^k(G)=H^{k+s}(G)$ for some $k$ and $s \\geq 2$). The iterated edge-biclique graph of $G$, $KB_e^k(G)$, is the graph obtained by applying the edge-biclique operator $k$ successive times to $G$. In this paper, we first s"},"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":"1908.06656","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-19T09:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"eb46150363bc5b1bd585cae9e9e2bfedba664f8c0eb4eaeb35e7b68b3d859dff","abstract_canon_sha256":"20d1a2b4aee1f4a07dfee5b50c0223920321871b87d1021abfcd0c31f0234495"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:47.651893Z","signature_b64":"79lFixL5gnR4Dv4CqzoNB4jWs3sZ8WidojV4Dz0wlGlZ49PXNsFdZheh7lxQihImQ7IOgvSGWt9+1A8qcoqAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f7227b137338f0774c2a75947304de4950b7d19424d18cc6d5bd9fec6af58a","last_reissued_at":"2026-07-05T03:35:47.651436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:47.651436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the edge-biclique graph and the iterated edge-biclique operator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Leandro Montero, Sylvain Legay","submitted_at":"2019-08-19T09:21:36Z","abstract_excerpt":"A biclique of a graph $G$ is a maximal induced complete bipartite subgraph of $G$. The edge-biclique graph of $G$, $KB_e(G)$, is the edge-intersection graph of the bicliques of $G$. A graph $G$ diverges (resp. converges or is periodic) under an operator $H$ whenever $\\lim_{k \\rightarrow \\infty}|V(H^k(G))|=\\infty$ (resp. $\\lim_{k \\rightarrow \\infty}H^k(G)=H^m(G)$ for some $m$ or $H^k(G)=H^{k+s}(G)$ for some $k$ and $s \\geq 2$). The iterated edge-biclique graph of $G$, $KB_e^k(G)$, is the graph obtained by applying the edge-biclique operator $k$ successive times to $G$. In this paper, we first s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06656","kind":"arxiv","version":3},"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/1908.06656/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":"1908.06656","created_at":"2026-07-05T03:35:47.651502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06656v3","created_at":"2026-07-05T03:35:47.651502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06656","created_at":"2026-07-05T03:35:47.651502+00:00"},{"alias_kind":"pith_short_12","alias_value":"6D3SE6YTOM4P","created_at":"2026-07-05T03:35:47.651502+00:00"},{"alias_kind":"pith_short_16","alias_value":"6D3SE6YTOM4PA52M","created_at":"2026-07-05T03:35:47.651502+00:00"},{"alias_kind":"pith_short_8","alias_value":"6D3SE6YT","created_at":"2026-07-05T03:35:47.651502+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/6D3SE6YTOM4PA52MFJ2ZI4YE3Z","json":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z.json","graph_json":"https://pith.science/api/pith-number/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/graph.json","events_json":"https://pith.science/api/pith-number/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/events.json","paper":"https://pith.science/paper/6D3SE6YT"},"agent_actions":{"view_html":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z","download_json":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z.json","view_paper":"https://pith.science/paper/6D3SE6YT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06656&json=true","fetch_graph":"https://pith.science/api/pith-number/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/action/storage_attestation","attest_author":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/action/author_attestation","sign_citation":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/action/citation_signature","submit_replication":"https://pith.science/pith/6D3SE6YTOM4PA52MFJ2ZI4YE3Z/action/replication_record"}},"created_at":"2026-07-05T03:35:47.651502+00:00","updated_at":"2026-07-05T03:35:47.651502+00:00"}